Exploiting constant trace property in large-scale polynomial optimization

DOI10.1145/3555309MaRDI QIDQ6599981FDOQ6599981

Authors: Ngoc Hoang Anh Mai, Jean B. Lasserre, Victor Magron, Jie Wang 

Publication date: 6 September 2024

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

zbMATH Keywords

polynomial optimizationmoment-SOS hierarchyconditional gradient-based augmented Lagrangianconstant trace property

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• ARPACK Users' Guide
• New limited memory bundle method for large-scale nonsmooth optimization
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Conic optimization via operator splitting and homogeneous self-dual embedding
• A Spectral Bundle Method for Semidefinite Programming
• Semidefinite Programming
• Global optimization with polynomials and the problem of moments
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Moments, positive polynomials and their applications
• An Interior-Point Method for Semidefinite Programming
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Local minima and convergence in low-rank semidefinite programming
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• On the linear convergence of the alternating direction method of multipliers
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Lasserre hierarchy for large scale polynomial optimization in real and complex variables
• Optimization of polynomials in non-commuting variables
• A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
• A MAX-CUT formulation of 0/1 programs
• Solving Natural Conic Formulations with Hypatia.jl
• The spectral bundle method with second-order information
• \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks
• A sublevel moment-SOS hierarchy for polynomial optimization
• Sparse noncommutative polynomial optimization
• Exploiting term sparsity in noncommutative polynomial optimization
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• COSMO: a conic operator splitting method for convex conic problems
• Scalable semidefinite programming
• The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
• A second order cone characterization for sums of nonnegative circuits
• Sum-of-squares optimization without semidefinite programming
• Alfonso: Matlab Package for Nonsymmetric Conic Optimization
• First-Order Methods for Nonconvex Quadratic Minimization
• Rank optimality for the Burer-Monteiro factorization

Cited In (2)

• The moment-SOS hierarchy: applications and related topics
• Trajectory generation for the unicycle model using semidefinite relaxations

This page was built for publication: Exploiting constant trace property in large-scale polynomial optimization

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