An adaptive procedure for the global minimization of a class of polynomial functions
type: Item
instance of: scholarly article
title: An adaptive procedure for the global minimization of a class of polynomial functions
zbMATH Open document ID: 1461.90109
author: Ornella Menchi
author: Paola Favati
author: Grazia Lotti
author: Francesco Romani
published in: Algorithms
publication date: 2020-10-07T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7257175
zbMATH Keywords: global minimization
zbMATH Keywords: polynomial function
zbMATH Keywords: adaptive strategy
describes a project that uses: SymNMF
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a12050109
OpenAlex ID: W2945278217
cites work: Performance of global random search algorithms for large dimensions
cites work: Q4072723
cites work: Q3311717
cites work: Optimization by Simulated Annealing
cites work: Q4833803
cites work: A Simplex Method for Function Minimization
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Q5287558
cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
cites work: SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
cites work: Tensor Decompositions and Applications
cites work: Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
cites work: Partial and Total Matrix Multiplication
DOI: 10.3390/A12050109
description: scientific article; zbMATH DE number 7257175