Approximate solutions of multiobjective optimization problems
From MaRDI portal
Publication:259809
DOI10.1007/S11117-015-0350-8zbMATH Open1338.90368OpenAlexW828106490MaRDI QIDQ259809FDOQ259809
Authors: Thai Doan Chuong, Do Sang Kim 
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
Recommendations
- Approximate quasi solutions of multiobjective optimization problems
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Variational Analysis
- Convex Analysis
- Theory of multiobjective optimization
- On the variational principle
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\epsilon\)-solutions in vector minimization problems
- \(\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
- Exact penalty functions in nonlinear programming
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector 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
Cited In (48)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization
- Uniform convergence and Pareto optimality
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- Optimality Conditions for Approximate Pareto Minimality
- Further results on quasi efficient solutions in multiobjective optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
- Approximations of bi-criteria optimization problem
- Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- Approximate solutions of interval-valued optimization problems
- On approximate solutions for nonsmooth robust 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
- Continuous time non-smooth optimization through quasi efficiency
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- A note on approximate proper efficiency in linear fractional vector optimization
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Approximation in multiobjective optimization
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- Approximate optimality conditions for nonsmooth optimization problems
- Multiobjective optimization problems
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Applications of discrepancy theory in multiobjective approximation
- Axiomatic approach to approximate solutions in multiobjective optimization
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Unified approach to approximate solutions in games and multiobjective programming
- On approximate optimality conditions for robust multi-objective convex optimization problems
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Approximability and Hardness in Multi-objective Optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
This page was built for publication: Approximate solutions of multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259809)
