Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
DOI10.1007/S11228-020-00551-3zbMATH Open1497.47088OpenAlexW3084526555MaRDI QIDQ2116030FDOQ2116030
Publication date: 15 March 2022
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-020-00551-3
error boundBanach spacesweak-Robinson conditioncenter-Lipschitz conditionabstract inequality systemsinfinite systems of inequalities
Sensitivity, stability, parametric optimization (90C31) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Global error bounds for piecewise convex polynomials
- An Application of Error Bounds for Convex Programming in a Linear Space
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Approximations to Solutions to Systems of Linear Inequalities
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Approximate solutions of analytic inequality systems
- Approximate solutions for abstract inequality systems
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- A unified approach to generalized inverses of linear operators: I. Algebraic, topological and projectional properties
- Monotone processes of convex and concave type
- Error Bounds for Degenerate Cone Inclusion Problems
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Inequality systems and global optimization
- Error Bounds for Abstract Linear Inequality Systems
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Asymptotic constraint qualifications and global error bounds for convex inequalities.
- Error Bounds for Convex Polynomials
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- On the Stability of the Feasible Set in Optimization Problems
- Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces
This page was built for publication: Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116030)
