Pages that link to "Item:Q4837939"

The following pages link to Error bounds for solutions of linear equations and inequalities (Q4837939):

Displaying 31 items.

• Error bounds for mixed integer linear optimization problems (Q263186) (← links)
• Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming (Q301728) (← links)
• Best Lipschitz constants of solutions of quadratic programs (Q328443) (← links)
• Quantitative stability of full random two-stage stochastic programs with recourse (Q497451) (← links)
• Critical objective size and calmness modulus in linear programming (Q505622) (← links)
• Point-based neighborhoods for sharp calmness constants in linear programming (Q683298) (← links)
• The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs (Q695340) (← links)
• Calmness of the feasible set mapping for linear inequality systems (Q742194) (← links)
• Lipschitz lower semicontinuity moduli for linear inequality systems (Q776920) (← links)
• A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
• Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization (Q2018867) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• Acceptable solutions and backward errors for tensor complementarity problems (Q2026729) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Error bounds for inequality systems defining convex sets (Q2230941) (← links)
• Calmness of the argmin mapping in linear semi-infinite optimization (Q2250063) (← links)
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
• An approach to calmness of linear inequality systems from Farkas lemma (Q2414111) (← links)
• Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
• Hoffman's least error bounds for systems of linear inequalities (Q2574102) (← links)
• Continuity of parametric mixed-integer quadratic programs and its application to stability analysis of two-stage quadratic stochastic programs with mixed-integer recourse (Q2808329) (← links)
• Calmness of partially perturbed linear systems with an application to the central path (Q4634160) (← links)
• Bilevel Linear Optimization Under Uncertainty (Q5014639) (← links)
• From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems (Q5051384) (← links)
• Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
• Risk-Averse Models in Bilevel Stochastic Linear Programming (Q5215518) (← links)
• Comments on: Stability in linear optimization and related topics. A personal tour (Q5970638) (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
• An easily computable upper bound on the Hoffman constant for homogeneous inequality systems (Q6179881) (← links)
• Lipschitzian stability in linear semi-infinite optimization (Q6629188) (← links)
• Efficient randomized block Kaczmarz method for linear feasibility (Q6661009) (← links)