\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
From MaRDI portal
Publication:377740
DOI10.1007/s10898-012-9994-0zbMath1274.90280OpenAlexW2014029348MaRDI QIDQ377740
Publication date: 7 November 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9994-0
\({\epsilon}\)-vector Lagrangianalmost quasi \({\epsilon}\)-Pareto solutionquasi \({\epsilon}\)-Pareto saddle point
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items
An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ 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 ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ 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 ⋮ 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 a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ Minimax programming as a tool for studying robust multi-objective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- On approximate solutions in vector optimization problems via scalarization
- 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
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Approximate saddle-point theorems in vector optimization
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Qualification and optimality conditions for dc programs with infinite constraints
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Cone characterizations of approximate solutions in real vector optimization
- 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
- Semismooth and Semiconvex Functions in Constrained Optimization
- ε-approximate solutions in multiobjective optimization
- Variational Inequalities with Generalized Monotone Operators
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- New Farkas-type constraint qualifications in convex infinite programming
