Conic programming: infeasibility certificates and projective geometry
From MaRDI portal
Publication:1996078
DOI10.1016/j.jpaa.2020.106605zbMath1461.90100arXiv1810.11792OpenAlexW3094318897WikidataQ114851519 ScholiaQ114851519MaRDI QIDQ1996078
Publication date: 3 March 2021
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.11792
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Real algebraic and real-analytic geometry (14P99)
Related Items (3)
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Sums of squares of polynomials with rational coefficients
- New stopping criteria for detecting infeasibility in conic optimization
- An exact duality theory for semidefinite programming and its complexity implications
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Positive polynomials in control.
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- On the connection of facially exposed and nice cones
- Bad Semidefinite Programs: They All Look the Same
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Strong Duality for Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
This page was built for publication: Conic programming: infeasibility certificates and projective geometry
