Optimality conditions for homogeneous polynomial optimization on the unit sphere

DOI10.1007/S11590-022-01940-3MaRDI QIDQ6097490zbMATH OpenOpenAlexFDO

Authors Lei Huang

Publication date 5 June 2023

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.01971

zbMATH Keywords

homogeneous polynomialsoptimality conditionsoptimization on the unit sphere

Mathematics Subject Classification ID

Polynomial optimization (90C23) Optimality conditions and duality in mathematical programming (90C46)

Abstract: In this note, we prove that for homogeneous polynomial optimization on the sphere, if the objective $f$ is generic in the input space, all feasible points satisfying the first order and second order necessary optimality conditions are local minimizers, which addresses an issue raised in the recent work by Lasserre (Optimization Letters, 2021). As a corollary, this implies that Lasserre's hierarchy has finite convergence when $f$ is generic.

Review text

In this paper, the author proves that for homogeneous polynomial optimization on the sphere, if the objective \( f\) is generic in the input space, all feasible points satisfying the first-order and second-order necessary optimality conditions are local minimizers. A direct consequence of this result is that the standard Lasserre's hierarchy converges in finite steps generically.

Recommendations

• Homogeneous polynomials and spurious local minima on the unit sphere
• Optimality conditions and finite convergence of Lasserre's hierarchy
• The hierarchy of local minimums in polynomial optimization
• Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
• Algebraic degree of polynomial optimization

Cites work

• Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
• Global optimization with polynomials and the problem of moments
• Homogeneous polynomials and spurious local minima on the unit sphere
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• Optimality conditions and finite convergence of Lasserre's hierarchy
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• The sum-of-squares hierarchy on the sphere and applications in quantum information theory
• Uniform denominators in Hilbert's seventeenth problem

Cited in

(10)

• Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
• scientific article; zbMATH DE number 7323312 (Why is no real title available?)
• Necessary and sufficient conditions for an extremum in complex problems of optimization of systems described by polynomial and analytic functions
• Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
• Moment-SOS and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
• Finite convergence of the moment-SOS hierarchy for polynomial matrix optimization
• On the complexity of matrix Putinar's Positivstellensätz
• Convergence rates of sum-of-squares hierarchies for polynomial semidefinite programs
• Lagrange multiplier expressions for matrix polynomial optimization and tight relaxations
• Convergence rates for polynomial optimization on set products

This page was built for publication: Optimality conditions for homogeneous polynomial optimization on the unit sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097490)