Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
From MaRDI portal
Publication:2116030
Recommendations
- Approximate solutions for abstract inequality systems
- Error Bounds for Abstract Linear Inequality Systems
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- Local error bounds for infinite convex-composite inequalities in Banach spaces
- Error bounds for convex differentiable inequality systems in Banach spaces
Cites work
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 3558452 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A unified approach to generalized inverses of linear operators: I. Algebraic, topological and projectional properties
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- An Application of Error Bounds for Convex Programming in a Linear Space
- Approximate solutions for abstract inequality systems
- Approximate solutions of analytic inequality systems
- Approximations to Solutions to Systems of Linear Inequalities
- Asymptotic constraint qualifications and global error bounds for convex inequalities.
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Error Bounds for Abstract Linear Inequality Systems
- Error Bounds for Convex Polynomials
- Error Bounds for Degenerate Cone Inclusion Problems
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Farkas-type results and duality for DC programs with convex constraints
- Global error bounds for piecewise convex polynomials
- Inequality systems and global optimization
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Monotone processes of convex and concave type
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- On the Stability of the Feasible Set in Optimization Problems
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
Cited in
(2)
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)
