An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions
AbstractThe paper deals with the problem of global minimization of a polynomial function expressed through the Frobenius norm of two-dimensional or three-dimensional matrices. An adaptive procedure is proposed which applies a Multistart algorithm according to a heuristic approach. The basic step of the procedure consists of splitting the runs of different initial points in segments of fixed length and to interlace the processing order of the various segments, discarding those which appear less promising. A priority queue is suggested to implement this strategy. Various parameters contribute to the handling of the queue, whose length shrinks during the computation, allowing a considerable saving of the computational time with respect to classical procedures. To verify the validity of the approach, a large experimentation has been performed on both nonnegatively constrained and unconstrained problems. View Full-Text
Share & Cite This Article
Favati, P.; Lotti, G.; Menchi, O.; Romani, F. An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions. Algorithms 2019, 12, 109.
Favati P, Lotti G, Menchi O, Romani F. An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions. Algorithms. 2019; 12(5):109.Chicago/Turabian Style
Favati, Paola; Lotti, Grazia; Menchi, Ornella; Romani, Francesco. 2019. "An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions." Algorithms 12, no. 5: 109.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.