Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
From MaRDI portal
Publication:2910878
DOI10.1137/110825844zbMath1250.65080arXiv0909.3551OpenAlexW1986699627MaRDI QIDQ2910878
Publication date: 12 September 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.3551
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06)
Related Items (15)
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Polynomial Norms ⋮ Lower bounds on the global minimum of a polynomial ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming ⋮ Algorithm 996 ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
Uses Software
This page was built for publication: Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
