Pages that link to "Item:Q1924066"
From MaRDI portal
The following pages link to Linear programming, complexity theory and elementary functional analysis (Q1924066):
Displaying 23 items.
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- A condition number theorem in convex programming (Q2515039) (← links)
- Metric regularity of semi-infinite constraint systems (Q2576725) (← links)
- Metric regularity and Lipschitzian stability of parametric variational systems (Q2653938) (← links)
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps (Q2789610) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS (Q4548047) (← links)
- Calmness of the Optimal Value in Linear Programming (Q4581757) (← links)
- Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
- The radius of metric regularity (Q4779878) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space (Q5107285) (← links)
- (Q5110205) (← 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)
- The Condition Number of Riemannian Approximation Problems (Q5857299) (← links)
- Robustness analysis via the running time of the interior point methods (Q5958427) (← links)
- Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- (Q6191375) (← links)