-optimal solutions in nonconvex semi-infinite programs with support functions

DOI10.1155/2011/175327MaRDI QIDQ536840zbMATH OpenOpenAlexWikidataFDO

Authors Do Sang Kim, T. Q. Son

Publication date 19 May 2011

Published in Fixed Point Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/224557

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

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

• A subgradient duality theorem
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• Augmented lagrangians in semi-infinite programming
• Characterizations of optimal solution sets of convex infinite programs
• Duality for a class of nondifferentiable multiobjective programming problems
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• New Farkas-type constraint qualifications in convex infinite programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Non differentiable symmetric duality
• On fractional programming containing support functions
• On nonlinear programming with support functions
• Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
• 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
• \(\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
• ε-Optimal solutions in nondifferentiable convex programming and some related questions

Cited in

(6)

• Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
• scientific article; zbMATH DE number 6400750 (Why is no real title available?)
• Approximate optimality in semi infinite programming
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints

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)