An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
From MaRDI portal
Publication:1990434
DOI10.11650/tjm/180603zbMath1401.90171OpenAlexW2847167045MaRDI QIDQ1990434
Publication date: 25 October 2018
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1531382431
Wolfe dualityalmost quasi \(\epsilon\)-Pareto solutionalmost quasi weakly \(\epsilon\)-Pareto solutiongeneralized KKT condition up to \(\epsilon\)
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (18)
An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ 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 ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ On global well-posedness of semi-infinite set optimization problems ⋮ 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 isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ 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 ⋮ 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 ⋮ Exact penalization and optimality conditions for approximate directional minima ⋮ 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
Cites Work
- Approximate solutions of multiobjective optimization problems
- On the representation of the search region in multi-objective optimization
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Survey of multi-objective optimization methods for engineering
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- On approximate solutions in vector optimization problems via scalarization
- Constrained optimization using multiple objective programming
- Augmented lagrangians in semi-infinite programming
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\epsilon\)-solutions in vector minimization problems
- Scalarization of vector optimization problems
- Constructing a perfect duality in infinite programming
- Constraint qualifications in nonsmooth multiobjective optimization
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Nonsmooth semi-infinite multiobjective optimization problems
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- 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∗
- Vector Optimization
- Duality in Vector Optimization
- Scalarization in vector optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Optimization and nonsmooth analysis
- Necessary conditions for ε-optimality
- Regularity Conditions and Optimality in Vector Optimization
- Multicriteria Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
