Duality in vector optimization via augmented Lagrangian
From MaRDI portal
Publication:643551
DOI10.1016/j.jmaa.2011.07.017zbMath1231.90334OpenAlexW2082105367MaRDI QIDQ643551
Publication date: 2 November 2011
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.07.017
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Generalized Lagrangian duality in set-valued vector optimization via abstract subdifferential ⋮ A set-valued Lagrange theorem based on a process for convex vector programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate duality in vector optimization and some applications to the vector variational inequality
- Theory of multiobjective optimization
- On supremum of a set in a multidimensional space
- Remarks on multifunctions with convex graph
- Conjugate duality in vector optimization
- A generalization of Fenchel duality in set-valued vector optimization
- Conjugate duality in set-valued vector optimization
- Stability and duality of nonconvex problems via augmented Lagrangian
- Conjugate dual problems in constrained set-valued optimization and applications
- Nonsmooth vector functions and continuous optimization
- Duality in Vector Optimization
- A Duality Theorem in Multiobjective Nonlinear Programming
- General duality in vector optimization
- Variational Analysis
- Conjugate Maps, Subgradients and Conjugate Duality in Set-Valued Optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Continuity properties of midconvex set-valued maps
- Duality and exact penalization for vector optimization via augmented Lagrangian
This page was built for publication: Duality in vector optimization via augmented Lagrangian