Duality in nonconvex vector optimization
From MaRDI portal
Publication:2038922
DOI10.1007/s10898-021-01018-xzbMath1475.90068OpenAlexW3148021930MaRDI QIDQ2038922
Refail Kasimbeyli, Masoud Karimi
Publication date: 7 July 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01018-x
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (2)
Robust duality for nonconvex uncertain vector optimization via a general scalarization ⋮ Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
- A multi-objective programming approach to 1.5-dimensional assortment problem
- Duality for set-valued multiobjective optimization problems. I: Mathematical programming
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- A duality theorem for a convex programming problem in order complete vector lattices
- Stability and duality of nonconvex problems via augmented Lagrangian
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Combined forecasts in portfolio optimization: a generalized approach
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Separation theorems for nonconvex sets and application in optimization
- Existence and characterization theorems in nonconvex vector optimization
- A conic scalarization method in multi-objective optimization
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- A general approach for studying duality in multiobjective optimization
- Extension of Fenchel's duality theorem for convex functions
- A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
- Duality for vector optimization problems via a general scalarization
- Duality in Vector Optimization
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- Duality in vector optimization
- Radial epiderivatives and set-valued optimization
- Set-valued Optimization
- Nonlinear Programming
- Separation via polyhedral conic functions
- Some Remarks on Dualization in Vector Optimization
- On Conjugate Convex Functions
This page was built for publication: Duality in nonconvex vector optimization
