Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
From MaRDI portal
Publication:724901
DOI10.1007/s40995-017-0323-9zbMath1391.90592OpenAlexW2768470248MaRDI QIDQ724901
Publication date: 26 July 2018
Published in: Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0323-9
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Semi-infinite programming
- Generalized semi-infinite programming: a tutorial
- Family of projected descent methods for optimization problems with simple bounds
- Linear semi-infinite programming theory: an updated survey
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Nonsmooth semi-infinite programming problems with mixed constraints
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimality conditions for non-smooth semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
