Another characterization of convexity for set-valued maps
From MaRDI portal
Publication:4257049
DOI10.1080/01630569908816896zbMath0933.49011OpenAlexW2136113142MaRDI QIDQ4257049
Publication date: 29 March 2000
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569908816896
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Set-valued functions (26E25)
Cites Work
- Unnamed Item
- Seven kinds of monotone maps
- Generalized monotonicity and generalized convexity
- Invex multifunctions and duality
- Characterization of nonsmooth functions through their generalized gradients
- Optimization and nonsmooth analysis
- Characterisations of quasiconvex functions
- Subgradient Criteria for Monotonicity, The Lipschitz Condition, and Convexity
- Sub differential Monotonicity as Characterization of Convex Functions
- Sufficient conditions for generalized convex set-valued maps
- A characterization of convex functions
- Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
- Invexity in multifunction optimization
This page was built for publication: Another characterization of convexity for set-valued maps