An adaptive procedure for the global minimization of a class of polynomial functions

DOI10.3390/a12050109zbMath1461.90109OpenAlexW2945278217MaRDI QIDQ2004881

Ornella Menchi, Francesco Romani, Paola Favati, Grazia Lotti

Publication date: 7 October 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12050109

zbMATH Keywords

polynomial functionglobal minimizationadaptive strategy

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• SymNMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Tensor Decompositions and Applications
• 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
• Performance of global random search algorithms for large dimensions
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
• Partial and Total Matrix Multiplication
• A Simplex Method for Function Minimization