Convexity in SemiAlgebraic Geometry and Polynomial Optimization
From MaRDI portal
Publication:3648539
DOI10.1137/080728214zbMath1181.90216arXiv0806.3784OpenAlexW1970515840WikidataQ92970002 ScholiaQ92970002MaRDI QIDQ3648539
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.3784
Related Items
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data, Improved Conic Reformulations for $K$-means Clustering, SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A bounded degree SOS hierarchy for polynomial optimization, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, New examples of extremal positive linear maps, Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint, Reinhardt free spectrahedra, Homogenization for polynomial optimization with unbounded sets, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Sum-of-squares relaxations in robust DC optimization and feature selection, NP-hardness of deciding convexity of quartic polynomials and related problems, Characterizing a class of robust vector polynomial optimization via sum of squares conditions, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, 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, Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables, Convex generalized Nash equilibrium problems and polynomial optimization, Free semidefinite representation of matrix power functions, On solving a class of fractional semi-infinite polynomial programming problems, A multilevel analysis of the Lasserre hierarchy, 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, Approximation algorithms for optimization of real-valued general conjugate complex forms, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, Certificates of convexity for basic semi-algebraic sets, A convex polynomial that is not sos-convex, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, Total Variation Isoperimetric Profiles, Introduction to Semidefinite, Conic and Polynomial Optimization, Semidefinite Representation of Convex Sets and Convex Hulls, Multi-objective convex polynomial optimization and semidefinite programming relaxations, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, Positive Maps and Separable Matrices, Linear optimization with cones of moments and nonnegative polynomials, Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls, Robust Quadratic Programming with Mixed-Integer Uncertainty, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints, Distributionally robust optimization with moment ambiguity sets
