Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
From MaRDI portal
(Redirected from Publication:395853)
Recommendations
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Optimality conditions for a nonconvex set-valued optimization problem
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Lagrange multiplier rule for nonconvex set-valued optimization problem
Cites work
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- An Existence Theorem in Vector Optimization
- Approximate saddle-point theorems in vector optimization
- Epsilon efficiency
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Image space analysis and scalarization for -optimization of multifunctions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications
- Lagrangian conditions for vector optimization in Banach spaces
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Nonconvex separation theorems and some applications in vector optimization
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- On some Fermat rules for set-valued optimization problems
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Optimality conditions for several types of efficient solutions of set-valued optimization problems
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- Optimization and nonsmooth analysis
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- The Fermat rule for multifunctions on Banach spaces
- The Lagrange Multiplier Rule for Multifunctions in Banach Spaces
- Vector optimization. Set-valued and variational analysis.
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
Cited in
(11)- Approximate optimality conditions for composite convex optimization problems
- Approximate solutions for nonconvex set-valued optimization and vector variational inequality
- Generic stability of the solution mapping for set-valued optimization problems
- Optimality conditions for composite DC infinite programming problems
- Approximate optimal solutions and nonlinear Lagrangian functions.
- 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
- Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Non smooth Lagrangian sets and estimations of micro-support
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
This page was built for publication: Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395853)
