A characterization of quasiconvex vector-valued functions
From MaRDI portal
Publication:4787496
DOI10.1090/S0002-9939-02-06761-8zbMath1024.26020OpenAlexW2096624591MaRDI QIDQ4787496
Jonathan M. Borwein, Nicolae Popovici, Joël Benoist
Publication date: 7 January 2003
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-02-06761-8
Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25) Calculus of functions taking values in infinite-dimensional spaces (26E20)
Related Items (30)
E-convexity and its generalizations ⋮ Complete duality for quasiconvex and convex set-valued functions ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ Scalar characterizations of weakly cone-convex and weakly cone-quasiconvex functions ⋮ Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions ⋮ Characterization of nonsmooth quasiconvex and pseudoconvex functions ⋮ On directed sets and their suprema ⋮ Unnamed Item ⋮ Applying convexificators in robust multiobjective optimization ⋮ Characterizations and applications of generalized invexity and monotonicity in Asplund spaces ⋮ Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ Unnamed Item ⋮ A Minty variational principle for set optimization ⋮ Some remarks on the Minty vector variational principle ⋮ Involving the Helly number in Pareto reducibility ⋮ Explicitly quasiconvex set-valued optimization ⋮ A variational approach to Lagrange multipliers ⋮ Characterizing sets of lower bounds: a hidden convexity result ⋮ A class of incomplete and ambiguity averse preferences ⋮ Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization ⋮ Arcwise cone-quasiconvex multicriteria optimization ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Vector optimization problems with quasiconvex constraints ⋮ On generalized convexity in Asplund spaces ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Image space analysis and scalarization of multivalued optimization ⋮ A characterization of cone-convexity for set-valued functions by cone-quasiconvexity ⋮ A new approach to constrained optimization via image space analysis ⋮ Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Norm duality for convex processes and applications
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Connectedness of the efficient point sets in quasiconcave vector maximization
- Minimax type theorems for n-valued functions
- Adjoint Process Duality
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps
This page was built for publication: A characterization of quasiconvex vector-valued functions
