Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
DOI10.1007/S101070000165zbMATH Open0989.65061MaRDI QIDQ1587936FDOQ1587936
Authors: Robert M. Freund, Marina Epelman 
Publication date: 28 February 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- A Condition Number for Multifold Conic Systems
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- An algorithm for finding nonnegative minimal norm solutions of linear systems
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
computational complexityalgorithmcondition numberconditioninginterior point methoditerative methodnormed linear spacesellipsoid methodpartially ordered spaceconic linear systems
Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Equations and inequalities involving linear operators, with vector unknowns (47A50) Linear operators on ordered spaces (47B60) Numerical solutions to equations with linear operators (65J10)
Cited In (34)
- Smoothed analysis of condition numbers and complexity implications for linear programming
- First-order methods for the convex hull membership problem
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Conic programming: infeasibility certificates and projective geometry
- First-order methods for convex optimization
- Conic systems and sublinear mappings: equivalent approaches.
- Hopfield neural networks in large-scale linear optimization problems
- A Condition Number for Multifold Conic Systems
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- On Chubanov's method for solving a homogeneous inequality system
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
- Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- A primal-dual symmetric relaxation for homogeneous conic systems
- The condition number of a function relative to a set
- A data-independent distance to infeasibility for linear conic systems
- A condition-based algorithm for solving polyhedral feasibility problems
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- Rescaling algorithms for linear conic feasibility
- On strata of degenerate polyhedral cones. I: Condition and distance to strata
- Some preconditioners for systems of linear inequalities
- Solving conic systems via projection and rescaling
- Normality and modulability indices. I: Convex cones in normed spaces
- The Condition Number of Riemannian Approximation Problems
- On the block-structured distance to non-surjectivity of sublinear mappings
- Rescaled coordinate descent methods for linear programming
- Generalized self-concordant analysis of Frank-Wolfe algorithms
- Randomized Gradient Boosting Machine
- Stability in linear optimization and related topics. A personal tour
- Theorems of the alternative for conic integer programming
- A characterization theorem and an algorithm for a convex hull problem
- On the von Neumann and Frank-Wolfe algorithms with away steps
This page was built for publication: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587936)
