Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
From MaRDI portal
Publication:5963691
DOI10.1007/s11590-015-0855-xzbMath1332.90289OpenAlexW1997819524MaRDI QIDQ5963691
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0855-x
optimality conditionseparable Hilbert spaceconstraint qualificationasplund spacecalmness propertycountably infinite Lipschitz problem
Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued functions (26E25) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Calmness of set-valued mappings between Asplund spaces and application to equilibrium problems
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Variational Analysis and Generalized Differentiation I
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings