Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
From MaRDI portal
Publication:3192091
DOI10.1137/130910002zbMATH Open1297.90164OpenAlexW2002922855MaRDI QIDQ3192091FDOQ3192091
Authors: Nader Kanzi 
Publication date: 26 September 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130910002
Recommendations
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Nonsmooth semi-infinite programming problems with mixed constraints
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- scientific article; zbMATH DE number 6988801
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cited In (33)
- Optimality conditions for nondifferentiable multiobjective semi-infinite programming problems
- Title not available (Why is that?)
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Title not available (Why is that?)
- \(\varPhi\)-weak Slater constraint qualification in nonsmooth multiobjective semi-infinite programming
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- A parametric view on the Mangasarian-Fromovitz constraint qualification
- Nonsmooth semi-infinite programming problems with mixed constraints
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Title not available (Why is that?)
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimality conditions in convex multiobjective SIP
- Exponentially \(E\)-convex vector optimization problems
- Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Subdifferentials of marginal functions in semi-infinite programming
This page was built for publication: Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192091)
