Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
DOI10.1007/s10107-012-0550-yzbMath1273.49020arXiv1101.4176OpenAlexW2107801746MaRDI QIDQ1925778
Hung M. Phan, Boris S. Mordukhovich
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.4176
multiobjective optimizationnormal conessemi-infinite programmingvariational analysistangent conesgeneralized differentiationqualification conditionsextremal principles
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Nonsmooth analysis
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Locally Farkas-Minkowski linear inequality systems
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Constrained best approximation in Hilbert space
- Qualification and optimality conditions for dc programs with infinite constraints
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Techniques of variational analysis
- Bounded linear regularity of convex sets in Banach spaces and its applications
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Boundary Half-Strips and the Strong CHIP
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Set-valued optimization in welfare economics
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
This page was built for publication: Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization