Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
DOI10.1007/s11750-020-00546-1OpenAlexW3007609280MaRDI QIDQ2192032
Vicente Novo Sanjurjo, Bienvenido Jiménez, Lidia Huerga, César Gutiérrez
Publication date: 26 June 2020
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-020-00546-1
optimality conditionsmultiobjective optimizationnonlinear Lagrangianlinear scalarizationapproximate proper efficiencypolyhedral ordering cone
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
- Stability and scalarization in vector optimization using improvement sets
- Vector optimization problems via improvement sets
- Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
- Weak subdifferential for set-valued mappings and its applications
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- On approximate efficiency in multiobjective programming
- Proper efficiency with respect to cones
- Variational methods in partially ordered spaces
- Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Vector Optimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Limit Behavior of Approximate Proper Solutions in Vector Optimization
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
