An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
From MaRDI portal
Abstract: In this paper, we study a class of fractional semi-infinite polynomial programming problems involving s.o.s-convex polynomial functions. For such a problem, by a conic reformulation proposed in our previous work and the quadratic modules associated with the index set, a hierarchy of semidefinite programming (SDP) relaxations can be constructed and convergent upper bounds of the optimum can be obtained. In this paper, by introducing Lasserre's measure-based representation of nonnegative polynomials on the index set to the conic reformulation, we present a new SDP relaxation method for the considered problem. This method enables us to compute convergent lower bounds of the optimum and extract approximate minimizers. Moreover, for a set defined by infinitely many s.o.s-convex polynomial inequalities, we obtain a procedure to construct a convergent sequence of outer approximations which have semidefinite representations. The convergence rate of the lower bounds and outer approximations are also discussed.
Recommendations
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Semidefinite relaxations for semi-infinite polynomial programming
- Semidefinite programming relaxations for linear semi-infinite polynomial programming
- On solving a class of linear semi-infinite programming by SDP method
Cites work
- A convex polynomial that is not sos-convex
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- An algorithm for semi-infinite polynomial optimization
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Convex sets with semidefinite representation
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- CVXPY: a Python-embedded modeling language for convex optimization
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- How to Integrate a Polynomial over a Sphere
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Multivariate ``needle polynomials with application to norming sets and cubature formulas
- NP-hardness of deciding convexity of quartic polynomials and related problems
- On density of interpolation points, a Kadec-type theorem, and Saff's principle of contamination in \(L_ p\)-approximation
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- On solving a class of fractional semi-infinite polynomial programming problems
- On solving a class of linear semi-infinite programming by SDP method
- Quadratic programming with one negative eigenvalue is NP-hard
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite approximations of projections and polynomial images of semialgebraic sets
- Semidefinite relaxations for semi-infinite polynomial programming
- Semidefinite representation of convex sets
- Seven Kinds of Convexity
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Theta bodies for polynomial ideals
- Tractable approximations of sets defined with quantifiers
- Volume of sublevel sets of homogeneous polynomials
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
This page was built for publication: An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181366)
