Exploiting constant trace property in large-scale polynomial optimization

Related Items (2)

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

Cites Work

Unnamed Item
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Conic optimization via operator splitting and homogeneous self-dual embedding
On the linear convergence of the alternating direction method of multipliers
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
A MAX-CUT formulation of 0/1 programs
\(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
COSMO: a conic operator splitting method for convex conic problems
Local minima and convergence in low-rank semidefinite programming
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
Global Optimization with Polynomials and the Problem of Moments
On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
Optimization of Polynomials in Non-Commuting Variables
The spectral bundle method with second-order information
Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
ARPACK Users' Guide
A Spectral Bundle Method for Semidefinite Programming
Sum-of-Squares Optimization without Semidefinite Programming
Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
Semidefinite Programming
An Interior-Point Method for Semidefinite Programming
Rank Optimality for the Burer--Monteiro Factorization
The Moment-SOS Hierarchy
Scalable Semidefinite Programming
Solving Natural Conic Formulations with Hypatia.jl
Alfonso: Matlab Package for Nonsymmetric Conic Optimization
First-Order Methods for Nonconvex Quadratic Minimization
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
New limited memory bundle method for large-scale nonsmooth optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

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