A hierarchy of spectral relaxations for polynomial optimization

DOI10.1007/S12532-023-00243-7zbMath1527.90151arXiv2007.09027OpenAlexW3043614436MaRDI QIDQ6062883

Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron

Publication date: 2 December 2023

Published in: Mathematical Programming Computation (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationsemidefinite programmingpolynomial optimizationmoment-SOS hierarchylimited-memory bundle methodmaximal eigenvalue minimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Polynomial optimization (90C23) Computational real algebraic geometry (14Q30)

Related Items (2)

The moment-SOS hierarchy: applications and related topics ⋮ Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth optimization via quasi-Newton methods
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Optimization of upper semidifferentiable functions
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
• Proximity control in bundle methods for convex nondifferentiable minimization
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A bounded degree SOS hierarchy for polynomial optimization
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• Projection Methods in Conic Optimization
• Relative Entropy Relaxations for Signomial Optimization
• Introduction to Nonsmooth Optimization
• The spectral bundle method with second-order information
• An Introduction to Polynomial and Semi-Algebraic Optimization
• A Stochastic Smoothing Algorithm for Semidefinite Programming
• Numerical Methods for Large Eigenvalue Problems
• Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Updating Quasi-Newton Matrices with Limited Storage
• Large-Scale Optimization of Eigenvalues
• An Algorithm for Constrained Optimization with Semismooth Functions
• ARPACK Users' Guide
• A Spectral Bundle Method for Semidefinite Programming
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• Scalable Semidefinite Programming
• A second order cone characterization for sums of nonnegative circuits
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
• New limited memory bundle method for large-scale nonsmooth optimization
• Revisiting two theorems of Curto and Fialkow on moment matrices
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Strong duality in lasserre's hierarchy for polynomial optimization

This page was built for publication: A hierarchy of spectral relaxations for polynomial optimization