The following pages link to The distance to a polyhedron (Q1187387):
Displaying 15 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Existence and relaxation of solutions for a subdifferential inclusion with unbounded perturbation (Q335417) (← links)
- Variational relation problems: existence of solutions and fixed points of contraction mappings (Q401796) (← links)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Existence and relaxation of solutions to differential inclusions with unbounded right-hand side in a Banach space (Q1675189) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
- Error bounds for inequality systems defining convex sets (Q2230941) (← links)
- Polyhedral sweeping processes with unbounded nonconvex-valued perturbation (Q2407150) (← links)
- Hoffman's least error bounds for systems of linear inequalities (Q2574102) (← links)
- Duality for optimization and best approximation over finite intersections (Q4221452) (← links)
- Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation ** (Q4265526) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
