Pages that link to "Item:Q4852578"
From MaRDI portal
The following pages link to Incorporating Condition Measures into the Complexity Theory of Linear Programming (Q4852578):
Displaying 50 items.
- An SOS1-based approach for solving MPECs with a natural gas market application (Q264267) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Erratum to: ``CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization'' (Q298163) (← links)
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- Some preconditioners for systems of linear inequalities (Q476281) (← links)
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms (Q494615) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← 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)
- Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- On strata of degenerate polyhedral cones. II: Relations between condition measures (Q964924) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Some perturbation theory for linear programming (Q1334953) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Learning from rounded-off data. (Q1873753) (← 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)
- Some results on condition numbers in convex multiobjective optimization (Q1938521) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Quadrature rules with neighborhood of spherical designs on the two-sphere (Q2284795) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- Coderivative calculus and metric regularity for constraint and variational systems (Q2518602) (← links)
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps (Q2789610) (← 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)
- Condition Number Theorems in Linear-Quadratic Optimization (Q3114598) (← links)
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- Learning Paths from Signature Tensors (Q4631266) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Quantitative Stability Analysis of Two-Stage Stochastic Linear Programs with Full Random Recourse (Q5238078) (← links)
