Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
From MaRDI portal
Publication:970569
DOI10.1007/s10957-009-9609-1zbMath1189.90137OpenAlexW1982597623MaRDI QIDQ970569
Joydeep Dutta, Marius Durea, Christiane Tammer
Publication date: 19 May 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9609-1
Related Items (49)
Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors ⋮ Stability of minimizers of set optimization problems ⋮ Quasi-relative interiors for graphs of convex set-valued mappings ⋮ Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets ⋮ Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions ⋮ Relationships between the oriented distance functional and a nonlinear separation functional ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ 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 set scalarization function and Dini directional derivatives with applications in set optimization problems ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Unified duality theory for constrained extremum problems. II: Special duality schemes ⋮ Optimality Conditions for Approximate Pareto Minimality ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Scalarization in geometric and functional vector optimization revisited ⋮ Scalarization in vector optimization with arbitrary domination sets ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ 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 ⋮ Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces ⋮ Regularized nonlinear scalarization for vector optimization problems with PDE-constraints ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Remarks on strict efficiency in scalar and vector optimization ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Lagrange Multiplier Rules for Weakly Minimal Solutions of Compact-Valued Set Optimization Problems ⋮ Connectedness in vector equilibrium problems involving cones with possibly empty interior ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization ⋮ On Lagrange Multiplier Rules for Set-Valued Optimization Problems in the Sense of Set Criterion ⋮ A set-valued Lagrange theorem based on a process for convex vector programming ⋮ Second-order optimality conditions in set-valued optimization via asymptotic derivatives ⋮ Exact penalization and optimality conditions for approximate directional minima ⋮ Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis ⋮ Unnamed Item ⋮ Existence of Lagrange multipliers for set optimization with application to vector equilibrium problems ⋮ Some characterizations of a nonlinear scalarizing function via oriented distance function ⋮ Approximate solutions of multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ Optimality conditions for quasi-solutions of vector optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- Lagrangian conditions for vector optimization in Banach spaces
- On the Clarke subdifferential of the distance function of a closed set
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Optimality conditions in portfolio analysis with general deviation measures
- Fuzzy necessary optimality conditions for vector optimization problems
- 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
- Degrees of Efficiency and Degrees of Minimality
This page was built for publication: Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
