Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
From MaRDI portal
Publication:2392776
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
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- A closedness condition and its applications to DC programs with convex constraints
- A dual condition for the convex subdifferential sum formula with applications
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Bi-level strategies in semi-infinite programming.
- Constraint qualifications for semi-infinite systems of convex inequalities
- Convex analysis and global optimization
- DC programming: overview.
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Farkas-type results and duality for DC programs with convex constraints
- First order optimality conditions for generalized semi-infinite programming problems
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First-order optimality conditions in generalized semi-infinite programming
- 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
- Generalized semi-infinite optimization: A first order optimality condition and examples
- New Farkas-type constraint qualifications in convex infinite programming
- On convex lower level problems in generalized semi-infinite optimization.
- On functions representable as a difference of convex functions
- On the minimization of difference functions
- Optimality conditions for non-smooth semi-infinite programming
- Optimization and nonsmooth analysis
Cited in
(11)- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Generalized subdifferentials of the value function for parametrized DC optimization problems
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- Non-convex semi-infinite min-max optimization with noncompact sets
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)
