Approximate solutions of multiobjective optimization problems
From MaRDI portal
Publication:259809
DOI10.1007/s11117-015-0350-8zbMath1338.90368OpenAlexW828106490MaRDI QIDQ259809
Publication date: 18 March 2016
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-015-0350-8
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (32)
Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ On quasi \(\epsilon\)-solution for robust convex optimization problems ⋮ Approximate solutions of interval-valued optimization problems ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Optimality Conditions for Approximate Pareto Minimality ⋮ 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 optimality conditions for robust multi-objective convex optimization problems ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Approximate solutions for robust multiobjective optimization programming in Asplund spaces ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ 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 ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- \(\epsilon\)-solutions in vector minimization problems
- Theory of multiobjective optimization
- On the variational principle
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Cone characterizations of approximate solutions in real vector optimization
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- Two Types of Approximate Saddle Points
- Optimization and nonsmooth analysis
- Exact penalty functions in nonlinear programming
- Variational Analysis
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Convex Analysis
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
This page was built for publication: Approximate solutions of multiobjective optimization problems
