\(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
From MaRDI portal
Publication:536840
DOI10.1155/2011/175327zbMath1213.90249OpenAlexW2091463490WikidataQ59253430 ScholiaQ59253430MaRDI QIDQ536840
Publication date: 19 May 2011
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224557
Related Items (1)
Cites Work
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Augmented lagrangians in semi-infinite programming
- Characterizations of optimal solution sets of convex infinite programs
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- A subgradient duality theorem
- Duality for a class of nondifferentiable multiobjective programming problems
- On nonlinear programming with support functions
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- On fractional programming containing support functions
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Semismooth and Semiconvex Functions in Constrained Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Non differentiable symmetric duality
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
