LP relaxations for a class of linear semi-infinite programming problems
From MaRDI portal
Publication:5277959
DOI10.1080/02331934.2017.1295458zbMath1401.90245OpenAlexW2589563246MaRDI QIDQ5277959
Publication date: 12 July 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1295458
Related Items (2)
Recent contributions to linear semi-infinite optimization: an update ⋮ Exact relaxations for parametric robust linear optimization problems
Cites Work
- Unnamed Item
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Semi-infinite programming
- An algorithm for the global optimization of a class of continuous minimax problems
- Representing polynomials by positive linear functions on compact convex polyhedra
- An interior point algorithm for semi-infinite linear programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- An algorithm for semi-infinite polynomial optimization
- Semidefinite relaxations for semi-infinite polynomial programming
- A note on the representation of positive polynomials with structured sparsity
- Ill-posedness with respect to the solvability in linear optimization
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Moments of non-negative mass
- Semi-infinite programming, duality, discretization and optimality conditions†
- Polynomial Programming: LP-Relaxations Also Converge
- Distance to Solvability/Unsolvability in Linear Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- On the Momentum Problem for Distribution Functions in More than One Dimension
This page was built for publication: LP relaxations for a class of linear semi-infinite programming problems
