Exact SDP relaxations for classes of nonlinear semidefinite programming problems
From MaRDI portal
Publication:1939707
DOI10.1016/j.orl.2012.09.006zbMath1287.90047WikidataQ59241518 ScholiaQ59241518MaRDI QIDQ1939707
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 5 March 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.09.006
fractional programs; polynomial optimization; sum of squares polynomials; SOS-convex polynomials; convex semi-definite programming
90C22: Semidefinite programming
Related Items
A new class of alternative theorems for SOS-convex inequalities and robust optimization, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, Dual semidefinite programs without duality gaps for a class of convex minimax programs, Exact conic programming relaxations for a class of convex polynomial cone programs, SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, 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 minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint, A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs, Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, On solving a class of fractional semi-infinite polynomial programming problems, Characterizing robust solution sets of convex programs under data uncertainty, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- Representation of nonnegative convex polynomials
- Semidefinite programming relaxations for semialgebraic problems
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- A Frank--Wolfe type theorem for convex polynomial programs
- Convex sets with semidefinite representation
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Global Optimization with Polynomials and the Problem of Moments
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Nonnegative polynomials and sums of squares
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- On Extension of Fenchel Duality and its Application
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Semidefinite Programming
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
