Exploiting constant trace property in large-scale polynomial optimization
From MaRDI portal
Publication:6599981
Cites work
- A MAX-CUT formulation of 0/1 programs
- A Spectral Bundle Method for Semidefinite Programming
- A second order cone characterization for sums of nonnegative circuits
- A sublevel moment-SOS hierarchy for polynomial optimization
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- ARPACK Users' Guide
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- An Interior-Point Method for Semidefinite Programming
- COSMO: a conic operator splitting method for convex conic problems
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exploiting term sparsity in noncommutative polynomial optimization
- First-Order Methods for Nonconvex Quadratic Minimization
- Global optimization with polynomials and the problem of moments
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Local minima and convergence in low-rank semidefinite programming
- Moments, positive polynomials and their applications
- New 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
- On the linear convergence of the alternating direction method of multipliers
- Optimization of polynomials in non-commuting variables
- Rank optimality for the Burer-Monteiro factorization
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Scalable semidefinite programming
- Semidefinite Programming
- Solving Natural Conic Formulations with Hypatia.jl
- Sparse noncommutative polynomial optimization
- Sum-of-squares optimization without semidefinite programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- 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
Cited in
(2)
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)
