On the maximization of (not necessarily) convex functions on convex sets
From MaRDI portal
Publication:2433925
DOI10.1007/s10898-006-9016-1zbMath1120.90043OpenAlexW2101504640MaRDI QIDQ2433925
Publication date: 31 October 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9016-1
Related Items (5)
A note on maxmin problem ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ Load capacity ratios for structures ⋮ Minimizing the difference of two quasiconvex functions ⋮ Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower subdifferentiable functions and their minimization by cutting planes
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- The search for a global maximum of a convex functional on an admissible set
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Characterization of nonsmooth functions through their generalized gradients
- What is quasiconvex analysis?
- Optimality conditions for maximizing a locally Lipschitz function
- Convex Analysis
- Piecewise-convex maximization problems.
This page was built for publication: On the maximization of (not necessarily) convex functions on convex sets