On strata of degenerate polyhedral cones. I: Condition and distance to strata
type: Item
instance of: scholarly article
title: On strata of degenerate polyhedral cones. I: Condition and distance to strata
zbMATH Open document ID: 1163.90644
author: Dennis Cheung
author: Felipe Cucker
author: Javier Peña
published in: European Journal of Operational Research
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 15A39
Mathematics Subject Classification ID: 15A12
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 5571487
zbMATH Keywords: polyhedral conic systems
zbMATH Keywords: degeneracy
zbMATH Keywords: condition numbers
Wikidata QID: Q57733141
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.07.012
OpenAlex ID: W1991949737
cites work: Nonlinear Programming
cites work: A new condition number for linear programming
cites work: Unifying Condition Numbers for Linear Programming
cites work: Q4079613
cites work: A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
cites work: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
cites work: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems
cites work: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
cites work: The Relaxation Method for Solving Systems of Linear Inequalities
cites work: Q3359644
cites work: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
cites work: Computing approximate solutions for convex conic systems of constraints
cites work: Some perturbation theory for linear programming
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: Condition numbers for polyhedra with real number data
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
DOI: 10.1016/J.EJOR.2008.07.012
DBLP publication ID: journals/eor/CheungCP09
description: scientific article; zbMATH DE number 5571487