The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
From MaRDI portal
Publication:695340
DOI10.1007/s10898-011-9729-7zbMath1281.90064OpenAlexW2073104494MaRDI QIDQ695340
Dariusz Zagrodny, Abderrahim Jourani
Publication date: 21 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9729-7
parametric programmingMosco convergenceerror boundconvex functionssubdifferentialsHoffman constantAttouch's theorempolyhedrals
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- On the convergence of subdifferentials of convex functions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
- Bounds for error in the solution set of a perturbed linear program
- Sufficient conditions for error bounds and applications
- Closed convex sets and their best simultaneous approximation properties with applications
- Hoffman's least error bounds for systems of linear inequalities
- Minimizers of the limit of Mosco converging functions
- On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
- Nonconvex minimization problems
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for solutions of linear equations and inequalities
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- The Validity of a Family of Optimization Methods
- Point-to-Set Maps in Mathematical Programming
