Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
From MaRDI portal
Publication:1667169
DOI10.1016/j.orl.2013.11.005zbMath1408.90227arXiv1306.6419OpenAlexW2140748229WikidataQ59241480 ScholiaQ59241480MaRDI QIDQ1667169
Guoyin Li, Tiên Sȯn Phạm, Vaithilingam Jeyakumar
Publication date: 27 August 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6419
Related Items (17)
On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints ⋮ Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Convergent conic linear programming relaxations for cone convex polynomial programs ⋮ A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems ⋮ On polynomial optimization over non-compact semi-algebraic sets ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ Unnamed Item ⋮ A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Coercive Polynomials and Their Newton Polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Semidefinite representation of convex sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- The \(K\)-moment problem for compact semi-algebraic sets
- Sums of squares on real algebraic curves
- A Frank--Wolfe type theorem for convex polynomial programs
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Distinguished representations of non-negative polynomials
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Nonsmooth vector functions and continuous optimization
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Nonnegative polynomials and sums of squares
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Error Bounds for Convex Polynomials
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Optimization of Polynomials on Compact Semialgebraic Sets
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
This page was built for publication: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
