Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
From MaRDI portal
Publication:288220
DOI10.1007/s10898-015-0356-6zbMath1369.90136OpenAlexW1196354647WikidataQ59241452 ScholiaQ59241452MaRDI QIDQ288220
Guoyin Li, Sunyoung Kim, Gue Myung Lee, Vaithilingam Jeyakumar
Publication date: 25 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0356-6
global continuous optimizationsemidefinite programming relaxationssparse polynomial optimizationstructured sparsitysums of squares polynomials
Related Items
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems, Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, Exact conic programming relaxations for a class of convex polynomial cone programs, On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, Unnamed Item, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On polynomial optimization over non-compact semi-algebraic sets
- Partitioning procedure for polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sum of squares method for sensor network localization
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- The \(K\)-moment problem for compact semi-algebraic sets
- Sums of squares on real algebraic curves
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- An exact Jacobian SDP relaxation for polynomial optimization
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Algorithm 920
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
