Radiant separation theorems and minimum-type subdifferentials of calm functions
From MaRDI portal
Publication:1673914
DOI10.1007/s10957-017-1132-1zbMath1377.49036OpenAlexW2731483338MaRDI QIDQ1673914
Publication date: 27 October 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1132-1
Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Generalized cutting plane method for solving nonlinear stochastic programming problems ⋮ On ℋn+1-convex functions: asymptotic behaviour and subdifferentials
Cites Work
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- An approach to the subproblem of the cutting angle method of global optimization
- Monotonic analysis over ordered topological vector spaces. IV
- Is every radiant function the sum of quasiconvex functions?
- Cutting angle methods in global optimization
- Scalarizing vector optimization problems
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Minimum type functions, plus-cogauges, and applications
- Coherent Measures of Risk
- Sub-topical functions and plus-co-radiant sets
- Convergence of a numerical abstract convexity algorithm
- Quasiconvex duality theory by generalized conjugation methods
- Convex-along-rays functions and star-shaped sets
- A generalization of ekellandz’s variational principle
- Monotonic Analysis over Cones: I
- Abstract convexity for nonconvex optimization duality
- Subdifferentials of convex-along-rays functions
- Superlinear separation for radiant and coradiant sets
- Abstract convexity and global optimization
