The degree of the central curve in semidefinite, linear, and quadratic programming
From MaRDI portal
Publication:5030928
DOI10.4418/2021.76.2.12zbMath1485.90093arXiv2011.15115MaRDI QIDQ5030928
No author found.
Publication date: 18 February 2022
Full work available at URL: https://arxiv.org/abs/2011.15115
Semidefinite programming (90C22) Convex programming (90C25) Computational aspects of algebraic curves (14Q05) Algebraic statistics (62R01)
Related Items (1)
Uses Software
Cites Work
- The central curve in linear programming
- Determinantal ideals of linear type of a generic symmetric matrix
- Mixed multiplicities and projective degrees of rational maps
- On the curvature of the central path of linear programming theory
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Interior Methods for Nonlinear Optimization
- Ideals with sliding depth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The degree of the central curve in semidefinite, linear, and quadratic programming