Projective re-normalization for improving the behavior of a homogeneous conic linear system
From MaRDI portal
Publication:1016122
DOI10.1007/s10107-007-0192-7zbMath1180.90181OpenAlexW2079586969MaRDI QIDQ1016122
Robert M. Freund, Alexandre Belloni
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/54746
Related Items (2)
Some preconditioners for systems of linear inequalities ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Choosing sample path length and number of sample paths when starting in steady state
- On the symmetry function of a convex set
- A Mathematical View of Interior-Point Methods in Convex Optimization
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- A randomized polynomial-time simplex algorithm for linear programming
- Practical Markov Chain Monte Carlo
- The geometry of logconcave functions and sampling algorithms
- Hit-and-run from a corner
- On the Complexity of Computing the Volume of a Polyhedron
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- Rounding of Polytopes in the Real Number Model of Computation
- Simulated Annealing for Convex Optimization
- Convex Analysis
- The Centroid of a Convex Body
- Solving convex programs by random walks
This page was built for publication: Projective re-normalization for improving the behavior of a homogeneous conic linear system
