Lagrangian conditions for vector optimization in Banach spaces
From MaRDI portal
Publication:857829
DOI10.1007/s00186-006-0079-zzbMath1131.90053OpenAlexW2080215670MaRDI QIDQ857829
Christiane Tammer, Joydeep Dutta
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0079-z
Mordukhovich subdifferentialIoffe subdifferentialLagrangian conditionsNon-convex vector optimization
Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Discrete location and assignment (90B80)
Related Items (25)
The Lipschitzianity of convex vector and set-valued functions ⋮ Kuhn-Tucker optimality conditions for vector equilibrium problems ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Scalar Lagrange multiplier rules for set-valued problems in infinite-dimensional spaces ⋮ On gap functions for multivalued Stampacchia variational inequalities ⋮ Scalarization in geometric and functional vector optimization revisited ⋮ 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 ⋮ Lipschitz properties of the scalarization function and applications ⋮ Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension ⋮ Subdifferential necessary conditions in set-valued optimization problems with equilibrium constraints ⋮ Multi-objective Pareto-optimal control: An application to wastewater management ⋮ Generalized Lagrange multiplier rule for non-convex vector optimization problems ⋮ Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces ⋮ Scalar multiplier rules in set-valued optimization ⋮ Scalarization and optimality conditions for vector equilibrium problems ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Optimality conditions for vector equilibrium problems with constraint in Banach spaces ⋮ Fuzzy necessary optimality conditions for vector optimization problems ⋮ Optimality conditions for vector equilibrium problems in normed spaces ⋮ Sensitivity analysis of gap functions for vector variational inequality via coderivatives ⋮ A unified characterization of nonlinear scalarizing functionals in optimization ⋮ Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis ⋮ Coderivatives of gap function for minty vector variational inequality
Cites Work
- Nonconvex separation theorems and some applications in vector optimization
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Nonlinear multiobjective optimization
- Generalized differential calculus for nonsmooth and set-valued mappings
- Constraint qualifications in nonsmooth multiobjective optimization
- The approximate subdifferential of composite functions
- Approximate subdifferentials and applications 3: the metric theory
- Optimization and nonsmooth analysis
- Approximate subdifferentials and applications II
- A robin-neumann problem in bounded domains with splitting boundary
- Lagrange multiplers for pareto nonsmooth programming problems in banach spaces
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Metric regularity and subdifferential calculus
- Regularity Conditions and Optimality in Vector Optimization
- Nonsmooth sequential analysis in Asplund spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lagrangian conditions for vector optimization in Banach spaces
