\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints

DOI10.1007/s10957-008-9475-2zbMath1175.90319OpenAlexW1966443656MaRDI QIDQ1028592

Jean Jacques Strodiot, Ta Quang Son, Van Hien Nguyen

Publication date: 6 July 2009

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-008-9475-2

zbMATH Keywords

\(\varepsilon\)-optimality\(\varepsilon\)-Lagrange dualityinfinite programming problemKarush-Kuhn-Tucker type conditionsNonconvex programming problemQuasisaddlepoints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (33)

An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Characterizing ϵ-properly efficient solutions ⋮ Some new properties of the Lagrange function and its applications ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ On quasi \(\epsilon\)-solution for robust convex optimization problems ⋮ Optimality conditions and the basic constraint qualification for quasiconvex programming ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Subdifferential of optimal value functions in nonlinear infinite programming ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of upper semidifferentiable functions
• Semi-infinite programming
• Characterizations of optimal solution sets of convex infinite programs
• Generalized gradients of Lipschitz functionals
• Generalizations of Slater's constraint qualification for infinite convex programs
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• Optimization. Algorithms and consistent approximations
• On optimality conditions for generalized semi-infinite programming problems
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• On the variational principle
• On generalized semi-infinite optimization and bilevel optimization
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Approximate duality
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• Optimization and nonsmooth analysis
• Necessary conditions for ε-optimality
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• On optimality conditions in nondifferentiable programming
• Semismooth and Semiconvex Functions in Constrained Optimization
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Solving generalized semi-infinite programs by reduction to simpler problems
• Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
• New Farkas-type constraint qualifications in convex infinite programming

This page was built for publication: \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints