An adaptive procedure for the global minimization of a class of polynomial functions
Summary: The 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.
- Global minimization of a multivariate polynomial using matrix methods
- Globally minimizing polynomials without evaluating derivatives
- Global optimization with polynomials and the problem of moments
- A global optimization algorithm for polynomial programming
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- A Simplex Method for Function Minimization
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- scientific article; zbMATH DE number 3841285 (Why is no real title available?)
- scientific article; zbMATH DE number 3490347 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Optimization by simulated annealing
- Partial and Total Matrix Multiplication
- Performance of global random search algorithms for large dimensions
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Tensor Decompositions and Applications
This page was built for publication: An adaptive procedure for the global minimization of a class of polynomial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004881)
