Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
From MaRDI portal
Publication:2392776
DOI10.1007/S10898-011-9828-5zbMATH Open1300.90056OpenAlexW2094953918MaRDI QIDQ2392776FDOQ2392776
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9828-5
Recommendations
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Generalized subdifferentials of the value function for parametrized DC optimization problems
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- DC programming: overview.
- Optimization and nonsmooth analysis
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Bi-level strategies in semi-infinite programming.
- Title not available (Why is that?)
- Farkas-type results and duality for DC programs with convex constraints
- A closedness condition and its applications to DC programs with convex constraints
- Convex analysis and global optimization
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Optimality conditions for non-smooth semi-infinite programming
- A dual condition for the convex subdifferential sum formula with applications
- First-order optimality conditions in generalized semi-infinite programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First order optimality conditions for generalized semi-infinite programming problems
- New Farkas-type constraint qualifications in convex infinite programming
- On functions representable as a difference of convex functions
- From linear to convex systems: consistency, Farkas' lemma and applications
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- On the minimization of difference functions
- On convex lower level problems in generalized semi-infinite optimization.
Cited In (10)
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Non-convex semi-infinite min-max optimization with noncompact sets
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Title not available (Why is that?)
This page was built for publication: Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392776)
