Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
DOI10.1007/S40995-017-0323-9zbMATH Open1391.90592OpenAlexW2768470248MaRDI QIDQ724901FDOQ724901
Publication date: 26 July 2018
Published in: Iranian Journal of Science and Technology, Transactions A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0323-9
Recommendations
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Optimality conditions and duality in nonsmooth semiinfinite programming
- Karush-Kuhn-Tucker types optimality conditions for non-smooth semi-infinite vector optimization problems
- Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Nonsmooth semi-infinite programming problems with mixed constraints
- Optimality conditions for non-smooth 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
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Generalized semi-infinite programming: a tutorial
- Title not available (Why is that?)
- New Farkas-type constraint qualifications in convex infinite programming
- Family of projected descent methods for optimization problems with simple bounds
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Linear semi-infinite programming theory: an updated survey
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Title not available (Why is that?)
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
Cited In (12)
- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- Title not available (Why is that?)
- Optimality conditions for nonsmooth generalized semi-infinite programs
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Necessary and sufficient conditions \((\alpha,\beta)\)-accessibility of domain in nonsmooth case
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
- Necessary conditions for constrained optimization problems with semicontinuous and continuous data
- Sufficient Conditions for Nonsmoothr-Invexity
- Optimality conditions for non-smooth semi-infinite programming
- Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
- Title not available (Why is that?)
This page was built for publication: Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724901)
