Lagrange multipliers for -Pareto solutions in vector optimization with nonsolid cones in Banach spaces
From MaRDI portal
Publication:970569
DOI10.1007/S10957-009-9609-1zbMATH Open1189.90137OpenAlexW1982597623MaRDI QIDQ970569FDOQ970569
Authors: Marius Durea, Joydeep Dutta, Chr. 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
Recommendations
- The Lagrange multipliers for convex vector functions in Banach spaces
- Vector optimization and generalized Lagrangian duality
- Lagrange multipliers for Pareto minima in general Banach spaces
- On vector optimization when the ordering cone has an empty interior.
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy necessary optimality conditions for vector optimization problems
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Nonconvex separation theorems and some applications in vector optimization
- Lagrangian conditions for vector optimization in Banach spaces
- Variational principles for set-valued mappings with applications to multiobjective optimization
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Title not available (Why is that?)
- Optimality conditions in portfolio analysis with general deviation measures
- An Existence Theorem in Vector Optimization
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- On the Clarke subdifferential of the distance function of a closed set
- Coherent risk measures and vector optimization
Cited In (56)
- Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
- Some characterizations of a nonlinear scalarizing function via oriented distance function
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Approximate solutions of multiobjective optimization problems
- Optimality conditions for quasi-solutions of vector optimization problems
- Quasi-relative interiors for graphs of convex set-valued mappings
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Remarks on strict efficiency in scalar and vector optimization
- Lagrange multiplier theorem of vector extremal problems when ordered convex cones are nonpointed cones.
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Exact penalization and optimality conditions for approximate directional minima
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- Optimality Conditions for Approximate Pareto Minimality
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Gauge functions for convex cones
- 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
- A set-valued Lagrange theorem based on a process for convex vector programming
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Second-order optimality conditions in set-valued optimization via asymptotic derivatives
- Relationships between the oriented distance functional and a nonlinear separation functional
- Some properties of nonconvex oriented distance function and applications to vector optimization problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis
- Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle
- Optimality conditions for vector optimization problems with difference of convex maps
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Connectedness in vector equilibrium problems involving cones with possibly empty interior
- Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- Existence and optimality conditions for approximate solutions to vector optimization problems
- A set scalarization function and Dini directional derivatives with applications in set optimization problems
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Scalarization in geometric and functional vector optimization revisited
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces
- On vector optimization when the ordering cone has an empty interior.
- Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones
- Regularized nonlinear scalarization for vector optimization problems with PDE-constraints
- On the optimality conditions for D.C. vector optimization problems
- On Lagrange multiplier rules for set-valued optimization problems in the sense of set criterion
- Existence of Lagrange multipliers for set optimization with application to vector equilibrium problems
- Lagrange multipliers for Pareto minima in general Banach spaces
- Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets
- Lagrange multiplier rules for weakly minimal solutions of compact-valued set optimization problems
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Stability of minimizers of set optimization problems
- Scalarization in vector optimization with arbitrary domination sets
- The Lagrange multipliers for convex vector functions in Banach spaces
This page was built for publication: Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970569)
