Pages that link to "Item:Q1961978"

The following pages link to Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system (Q1961978):

Displayed 27 items.

• Non-parametric tests of productive efficiency with errors-in-variables (Q278241) ‎ (← links)
• Conditioning of linear-quadratic two-stage stochastic optimization problems (Q484135) ‎ (← links)
• A numerical algorithm for zero counting. III: Randomization and condition (Q651058) ‎ (← links)
• Probabilistic analysis of condition numbers for linear programming (Q700762) ‎ (← links)
• On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) ‎ (← links)
• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) ‎ (← links)
• Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate (Q868540) ‎ (← links)
• Sufficient conditions for total ill-posedness in linear semi-infinite optimization (Q877594) ‎ (← links)
• A geometric analysis of Renegar's condition number, and its interplay with conic curvature (Q1013969) ‎ (← links)
• On infeasibility of systems of convex analytic inequalities (Q1295897) ‎ (← links)
• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) ‎ (← links)
• Stability in linear optimization and related topics. A personal tour (Q1939064) ‎ (← links)
• Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming (Q1958647) ‎ (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) ‎ (← links)
• The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) ‎ (← links)
• Probabilistic analysis of the Grassmann condition number (Q2340501) ‎ (← links)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) ‎ (← links)
• On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) ‎ (← links)
• Solving linear programs with finite precision. II: Algorithms (Q2496177) ‎ (← links)
• Ill-posedness with respect to the solvability in linear optimization (Q2496624) ‎ (← links)
• Towards a deeper geometric, analytic and algorithmic understanding of margins (Q2815511) ‎ (← links)
• On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) ‎ (← links)
• Extreme points of well-posed polytopes (Q3446581) ‎ (← links)
• The radius of metric regularity (Q4779878) ‎ (← links)
• Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) ‎ (← links)
• Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity (Q5758204) ‎ (← links)
• A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) ‎ (← links)