An algorithm for semi-infinite polynomial optimization
From MaRDI portal
Publication:1935882
DOI10.1007/s11750-011-0172-1zbMath1285.90076arXiv1101.4122OpenAlexW1984086663MaRDI QIDQ1935882
Publication date: 20 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.4122
Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34)
Related Items (11)
LP relaxations for a class of linear semi-infinite programming problems ⋮ Moment problem in infinitely many variables ⋮ Recent contributions to linear semi-infinite optimization ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Unnamed Item ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
Uses Software
Cites Work
- An algorithm for the global optimization of a class of continuous minimax problems
- Interval methods for semi-infinite programs
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Global Optimization with Polynomials and the Problem of Moments
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: An algorithm for semi-infinite polynomial optimization
