On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
DOI10.1007/s10589-019-00118-5zbMath1425.90076OpenAlexW2951051499MaRDI QIDQ2007822
Sunyoung Kim, Makoto Yamashita, Hikaru Komeiji
Publication date: 22 November 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00118-5
alternating direction method of multiplierssemidefinite programssums of squares of polynomialsconditions for finite terminationsums of squares of univariate trigonometric polynomials
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Uses Software
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- A boundary point method to solve semidefinite programs
- Lectures on numerical methods for non-linear variational problems
- Semidefinite programming relaxations for semialgebraic problems
- An exact Jacobian SDP relaxation for polynomial optimization
- Computing sum of squares decompositions with rational coefficients
- There are significantly more nonnegative polynomials than sums of squares
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Some NP-complete problems in quadratic and nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Trigonometric Polynomials Positive on Frequency Domains and Applications to 2-D FIR Filter Design
- Sampling Algebraic Varieties for Sum of Squares Programs
- Gram spectrahedra
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Regularization Methods for Semidefinite Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
