scientific article; zbMATH DE number 7413593
zbMath1487.90639MaRDI QIDQ5158548
Thanh Tam le, Christiane Tammer, Vu Anh Tuan
Publication date: 25 October 2021
Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/39318/39318-07.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrange multiplierClarke subdifferentialLipschitz functionoriented distance functioncone-convex functionabstract subdifferentialnonlinear scalarizing functional(weak) Pareto minimal point\((\epsilon, e)\)-Pareto minimal point
Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Lipschitzianity of convex vector and set-valued functions
- Nonconvex separation theorems and some applications in vector optimization
- On subdifferential calculus for set-valued mappings and optimality conditions
- Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Existence theorems in vector optimization
- On the Clarke subdifferential of the distance function of a closed set
- Variational methods in partially ordered spaces
- Scalarization in geometric and functional vector optimization revisited
- The Fermat rule for multifunctions on Banach spaces
- Approximate subdifferentials and applications 3: the metric theory
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Lipschitz properties of the scalarization function and applications
- Fuzzy necessary optimality conditions for vector optimization problems
- Approximate subdifferentials and applications II
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Sensitivity analysis for constraint and variational systems by means of set-valued differentiation
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
This page was built for publication:
