Pages that link to "Item:Q1334953"
From MaRDI portal
The following pages link to Some perturbation theory for linear programming (Q1334953):
Displaying 50 items.
- An SOS1-based approach for solving MPECs with a natural gas market application (Q264267) (← links)
- Non-parametric tests of productive efficiency with errors-in-variables (Q278241) (← links)
- A geometrical stability condition for compressed sensing (Q286166) (← links)
- Violation analysis on two-step method for interval linear programming (Q507647) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- On verified numerical computations in convex programming (Q849186) (← 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)
- Characterization of total ill-posedness in linear semi-infinite optimization (Q929606) (← links)
- Stability under perturbations of some condition numbers in optimization (Q959959) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- On strata of degenerate polyhedral cones. II: Relations between condition measures (Q964924) (← links)
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature (Q1013969) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Infeasibility analysis for systems of quadratic convex inequalities (Q1296129) (← links)
- On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- On condition number theorems in mathematical programming (Q1695809) (← links)
- Connections between the total least squares and the correction of an infeasible system of linear inequalities (Q1765915) (← links)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Stability in linear optimization and related topics. A personal tour (Q1939064) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- Generalized derivatives of the optimal value of a linear program with respect to matrix coefficients (Q2030704) (← links)
- Projection-based local and global Lipschitz moduli of the optimal value in linear programming (Q2139256) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
- Quadrature rules with neighborhood of spherical designs on the two-sphere (Q2284795) (← links)
- Lipschitz modulus of the optimal value in linear programming (Q2315260) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- Average-case complexity without the black swans (Q2360669) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- On two-stage convex chance constrained problems (Q2466772) (← links)
- On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
- Ill-posedness with respect to the solvability in linear optimization (Q2496624) (← links)
- A condition number theorem in convex programming (Q2515039) (← links)
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes (Q2810088) (← links)
