The hierarchy of local minimums in polynomial optimization
From MaRDI portal
Publication:2349136
Abstract: This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we construct a sequence of semidefinite relaxations, based on optimality conditions. We prove that each constructed sequence has finite convergence, under some generic conditions. A procedure for computing all local minimums is given. When there are equality constraints, we have similar results for computing the hierarchy of critical values and the hierarchy of local minimums. Several extensions are discussed.
Recommendations
- Polynomial optimization with real varieties
- A new hierarchy of SDP-relaxations for polynomial programming
- Global optimization with polynomials and the problem of moments
- Local saddle points for unconstrained polynomial optimization
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
Cites work
Cited in
(27)- Local saddle points for unconstrained polynomial optimization
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- Homogenization for polynomial optimization with unbounded sets
- Global uniqueness and solvability of tensor variational inequalities
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- Local minima, marginal functions, and separating hyperplanes in discrete optimization
- Complexity aspects of local minima and related notions
- Minimizer Extraction in Polynomial Optimization Is Robust
- An adaptive high order method for finding third-order critical points of nonconvex optimization
- Distributionally robust optimization with moment ambiguity sets
- A semidefinite method for tensor complementarity problems
- Low order polynomial bounds on the expected performance of local improvement algorithms
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- On types of isolated KKT points in polynomial optimization
- The maximum tensor complementarity eigenvalues
- Higher-degree tensor eigenvalue complementarity problems
- Optimality conditions for homogeneous polynomial optimization on the unit sphere
- Tensor complementarity problems. II: Solution methods
- Loss functions for finite sets
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- An efficient alternating minimization method for fourth degree polynomial optimization
- Tensor eigenvalue complementarity problems
- Real eigenvalues of nonsymmetric tensors
- Convex generalized Nash equilibrium problems and polynomial optimization
- scientific article; zbMATH DE number 512812 (Why is no real title available?)
- On types of degenerate critical points of real polynomial functions
This page was built for publication: The hierarchy of local minimums in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349136)
