A convex polynomial that is not sos-convex
From MaRDI portal
Publication:715094
DOI10.1007/s10107-011-0457-zzbMath1254.90159arXiv0903.1287OpenAlexW3105811395MaRDI QIDQ715094
Amir Ali Ahmadi, Pablo A. Parrilo
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.1287
Semidefinite programming (90C22) Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41)
Related Items
Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, Further results on sum-of-squares tensors, Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data, Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems, Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint, Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, NP-hardness of deciding convexity of quartic polynomials and related problems, Characterizing a class of robust vector polynomial optimization via sum of squares conditions, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Farkas' lemma: three decades of generalizations for mathematical optimization, Polynomial Norms, Dual semidefinite programs without duality gaps for a class of convex minimax programs, On solving a class of fractional semi-infinite polynomial programming problems, Three dimensional strongly symmetric circulant tensors, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, Solving fractional multicriteria optimization problems with sum of squares convex polynomial data, Exact conic programming relaxations for a class of convex polynomial cone programs, DC decomposition of nonconvex polynomials with algebraic techniques, On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint, On cones of nonnegative quartic forms, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, Characterizing robust solution sets of convex programs under data uncertainty, A new class of alternative theorems for SOS-convex inequalities and robust optimization, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, Semidefinite Representation of Convex Sets and Convex Hulls, Multi-objective convex polynomial optimization and semidefinite programming relaxations, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open questions in complexity theory for numerical optimization
- Semidefinite representation of convex sets
- Representation of nonnegative convex polynomials
- Positive semidefinite biquadratic forms
- Semidefinite programming relaxations for semialgebraic problems
- Symmetry groups, semidefinite programs, and sums of squares
- Uniform denominators in Hilbert's seventeenth problem
- Computing sum of squares decompositions with rational coefficients
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Some NP-complete problems in quadratic and nonlinear programming
- Class of global minimum bounds of polynomial functions
- An Example of a Positive Polynomial which is not a Sum of Squares of Polynomials A Positive, but not Strongly Positive Functional
- Exploiting Algebraic Structure in Sum of Squares Programs
- Semidefinite Programming
- ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES
- Convex Analysis
