An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials

DOI10.1007/s11590-023-01974-1arXiv2110.04737OpenAlexW4318315767MaRDI QIDQ6181366

Meijun Zhang, Feng Guo

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.04737

zbMATH Keywords

polynomial optimizationsemidefinite programming relaxationsfractional optimizationconvex semi-infinite systemssum-of-squares convex

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Multivariate ``needle polynomials with application to norming sets and cubature formulas
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
• A convex polynomial that is not sos-convex
• Semidefinite representation of convex sets
• Semi-infinite programming
• Quadratic programming with one negative eigenvalue is NP-hard
• On density of interpolation points, a Kadec-type theorem, and Saff's principle of contamination in \(L_ p\)-approximation
• Recent contributions to linear semi-infinite optimization
• Recent contributions to linear semi-infinite optimization: an update
• An algorithm for semi-infinite polynomial optimization
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
• On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
• On solving a class of fractional semi-infinite polynomial programming problems
• A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
• Tractable approximations of sets defined with quantifiers
• Convex sets with semidefinite representation
• Computing Gaussian \& exponential measures of semi-algebraic sets
• Semidefinite relaxations for semi-infinite polynomial programming
• How to Integrate a Polynomial over a Sphere
• Lectures on Modern Convex Optimization
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Theta Bodies for Polynomial Ideals
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
• Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Semi-infinite programming, duality, discretization and optimality conditions†
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• On solving a class of linear semi-infinite programming by SDP method
• Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
• Volume of Sublevel Sets of Homogeneous Polynomials
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• Seven Kinds of Convexity
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Strong duality in lasserre's hierarchy for polynomial optimization

This page was built for publication: An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials