Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
From MaRDI portal
Publication:467462
DOI10.1007/s10957-012-0259-3zbMath1378.90074OpenAlexW2146807310MaRDI QIDQ467462
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0259-3
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Nonsmooth analysis
- Epsilon efficiency
- On several concepts for \(\varepsilon\)-efficiency
- First and second-order optimality conditions for convex composite multiobjective optimization
- Ideal, weakly efficient solutions for vector optimization problems
- Variational methods in partially ordered spaces
- Outcome space partition of the weight set in multiobjective linear programming
- A Fuzzy Necessary Optimality Condition for Non-Lipschitz Optimization in Asplund Spaces
- A Unified Separation Theorem for Closed Sets in a Banach Space and Optimality Conditions for Vector Optimization
- A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
- Variational Analysis
- An Extended Extremal Principle with Applications to Multiobjective Optimization
- Degrees of Efficiency and Degrees of Minimality
- Hamiltonian Necessary Conditions for a Multiobjective Optimal Control Problem with Endpoint Constraints
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
