Condition number complexity of an elementary algorithm for computing a reliable solution 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)
- 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
- The Condition Number of Riemannian Approximation Problems
- On the von Neumann and Frank-Wolfe algorithms with away steps
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- Rescaling algorithms for linear conic feasibility
- Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Smoothed analysis of condition numbers and complexity implications for linear programming
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- The condition number of a function relative to a set
- Hopfield neural networks in large-scale linear optimization problems
- Generalized self-concordant analysis of Frank-Wolfe algorithms
- A primal-dual symmetric relaxation for homogeneous conic systems
- On the block-structured distance to non-surjectivity of sublinear mappings
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Theorems of the alternative for conic integer programming
- Solving conic systems via projection and rescaling
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- A data-independent distance to infeasibility for linear conic systems
- First-order methods for convex optimization
- Rescaled coordinate descent methods for linear programming
- Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
- Randomized Gradient Boosting Machine
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Stability in linear optimization and related topics. A personal tour
- Conic systems and sublinear mappings: equivalent approaches.
- First-order methods for the convex hull membership problem
- On strata of degenerate polyhedral cones. I: Condition and distance to strata
- On Chubanov's method for solving a homogeneous inequality system
- A Condition Number for Multifold Conic Systems
- Normality and modulability indices. I: Convex cones in normed spaces
- A characterization theorem and an algorithm for a convex hull problem
- Some preconditioners for systems of linear inequalities
- A condition-based algorithm for solving polyhedral feasibility problems
- Conic programming: infeasibility certificates and projective geometry
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)
