-optimal solutions in nonconvex semi-infinite programs with support functions
From MaRDI portal
Publication:536840
DOI10.1155/2011/175327zbMATH Open1213.90249OpenAlexW2091463490WikidataQ59253430 ScholiaQ59253430MaRDI QIDQ536840FDOQ536840
Authors: Do Sang Kim, T. Q. Son 
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
Recommendations
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Approximate optimality in semi infinite programming
Cites Work
- Semismooth and Semiconvex Functions in Constrained Optimization
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- On fractional programming containing support functions
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- 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
- 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
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Augmented lagrangians in semi-infinite programming
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- A subgradient duality theorem
- On nonlinear programming with support functions
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Duality for a class of nondifferentiable multiobjective programming problems
Cited In (6)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Title not available (Why is that?)
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
- Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Approximate optimality in semi infinite programming
This page was built for publication: \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536840)
