Duality and saddle-points for convex-like vector optimization problems on real linear spaces
From MaRDI portal
Publication:819956
DOI10.1007/BF02579060zbMATH Open1112.90074MaRDI QIDQ819956FDOQ819956
Authors: Miguel Adán, V. Novo 
Publication date: 4 April 2006
Published in: Top (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1786289
- scientific article; zbMATH DE number 2156773
- The generalized vector convex-like mappings on real linear spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Proper efficiency in vector optimization on real linear spaces.
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proper solutions of vector optimization problems
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Convexlike alternative theorems and mathematical programming
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Scalarization and lagrange duality in multiobjective optimization
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Proper efficiency in vector optimization on real linear spaces.
- Duality in nondifferentiable vector programming
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- A characterization of generalized saddle points for vector-valued functions via scalarization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficiency and proper efficiency in vector maximization with respect to cones
- Alternative theorems and optimality conditions with weakened convexity
- Lagrange multipliers and saddle points in multiobjective programming
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
- The generalized vector convex-like mappings on real linear spaces
- Algebraic representation of dual scalar products and stabilization of saddle point problems
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization
- Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
This page was built for publication: Duality and saddle-points for convex-like vector optimization problems on real linear spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819956)
