A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
From MaRDI portal
Publication:2784423
DOI10.1137/S1052623401386794zbMath0996.90052OpenAlexW1972729079WikidataQ57733258 ScholiaQ57733258MaRDI QIDQ2784423
Publication date: 23 April 2002
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401386794
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51)
Related Items (17)
Extreme points of well-posed polytopes ⋮ On the complexity of the Plantinga-Vegter algorithm ⋮ A primal-dual symmetric relaxation for homogeneous conic systems ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ Round-off estimates for second-order conic feasibility problems ⋮ Robust smoothed analysis of a condition number for linear programming ⋮ Computing the homology of real projective sets ⋮ A numerical algorithm for zero counting. I: Complexity and accuracy ⋮ Coverage processes on spheres and condition numbers for linear programming ⋮ Probabilistic analyses of condition numbers ⋮ Probabilistic analysis of condition numbers for linear programming ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ On strata of degenerate polyhedral cones. I: Condition and distance to strata ⋮ Conditioning of random conic systems under a general family of input distributions ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Probabilistic analysis of the Grassmann condition number
Uses Software
This page was built for publication: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
