Pages that link to "Item:Q1844586"
From MaRDI portal
The following pages link to Bounds for error in the solution set of a perturbed linear program (Q1844586):
Displayed 40 items.
- Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem (Q263172) (← links)
- The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth (Q523179) (← links)
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs (Q695340) (← links)
- Lipschitz lower semicontinuity moduli for linear inequality systems (Q776920) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- Bounds for the solution set of linear complementarity problems (Q1087474) (← links)
- Stability in multicriteria optimization (Q1131961) (← links)
- The distance to a polyhedron (Q1187387) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
- Newton's method for nonlinear inequalities (Q1212334) (← links)
- The continuity of metric projections as functions of the data (Q1214068) (← links)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Some perturbation theory for linear programming (Q1334953) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- Characterizations of stability of error bounds for convex inequality constraint systems (Q2165598) (← links)
- Error bounds for inequality systems defining convex sets (Q2230941) (← links)
- About error bounds in metrizable topological vector spaces (Q2677661) (← links)
- BOUNDED RATIONALITY IN LONG-TERM PLANNING: A LINEAR PROGRAMMING APPROACH (Q3037081) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- Lipschitz modulus in convex semi-infinite optimization<i>via</i>d.c. functions (Q3643500) (← links)
- A Measure Approximation for Distributionally Robust PDE-Constrained Optimization Problems (Q4602349) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
- Stability analysis of a class of sparse optimization problems (Q5135257) (← links)
- Weak Stability of <i>ℓ</i><sub>1</sub>-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
- Normed Convex Processes (Q5680648) (← links)
- Comments on: Stability in linear optimization and related topics. A personal tour (Q5970638) (← links)
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems (Q6104921) (← links)
- (Q6178248) (← links)