Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems

DOI10.1007/S11590-012-0527-ZzbMath1311.90175OpenAlexW1977185222MaRDI QIDQ395853

Xian-Jun Long, Jing Zeng, Xiao-bing Li

Publication date: 30 January 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0527-z

zbMATH Keywords

approximate solutionLagrangian conditionMordukhovich coderivativenonconvex set-valued optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48)

Related Items (9)

Generic stability of the solution mapping for set-valued optimization problems ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality

Cites Work

• Unnamed Item
• Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
• Nonconvex separation theorems and some applications in vector optimization
• Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications
• Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Lagrangian conditions for vector optimization in Banach spaces
• Some properties of approximate solutions for vector optimization problem with set-valued functions
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• Optimality conditions for proper efficient solutions of vector set-valued optimization.
• Approximate saddle-point theorems in vector optimization
• Necessary conditions for super minimizers in constrained multiobjective optimization
• Existence and optimality conditions for approximate solutions to vector optimization problems
• \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
• Vector optimization. Set-valued and variational analysis.
• Lagrange multipliers for set-valued optimization problems associated with coderivatives
• The Fermat rule for multifunctions on Banach spaces
• On some Fermat rules for set-valued optimization problems
• Optimization and nonsmooth analysis
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• An Existence Theorem in Vector Optimization
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
• The Lagrange Multiplier Rule for Multifunctions in Banach Spaces

This page was built for publication: Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems