Regularization methods for SDP relaxations in large-scale polynomial optimization
From MaRDI portal
Abstract: We study how to solve semidefinite programming relaxations for large scale polynomial optimization. When interior-point methods are used, typically only small or moderately large problems could be solved. This paper studies regularization methods for solving polynomial optimization problems. We describe these methods for semidefinite optimization with block structures, and then apply them to solve large scale polynomial optimization problems. The performance is tested on various numerical examples. By regularization methods, significantly bigger problems could be solved on a regular computer, which is almost impossible by interior point methods.
Recommendations
- Regularization methods for semidefinite programming
- Semidefinite relaxations for semi-infinite polynomial programming
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
Cited in
(22)- Optimality conditions and optimization methods for quartic polynomial optimization
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- 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
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- Lower bounds on the global minimum of a polynomial
- Polynomial norms
- Algorithm 996
- 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 convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- SPLD polynomial optimization and bounded degree SOS hierarchies
- Spectral methods for polynomial optimization
This page was built for publication: Regularization methods for SDP relaxations in large-scale polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910878)
