Radiant separation theorems and minimum-type subdifferentials of calm functions
type: Item
instance of: scholarly article
title: Radiant separation theorems and minimum-type subdifferentials of calm functions
zbMATH Open document ID: 1377.49036
author: A. R. Doagooei
author: A. Sheykhi
published in: Journal of Optimization Theory and Applications
publication date: 2017-10-27T00:00:00Z
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 26B25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6800878
zbMATH Keywords: global optimization
zbMATH Keywords: min-type function
zbMATH Keywords: abstract convexity
zbMATH Keywords: radiant set
zbMATH Keywords: separation theorems
zbMATH Keywords: subdifferential
MaRDI profile type: Publication
full work available at URL: s10957-017-1132-1
OpenAlex ID: W2731483338
cites work: Scalarizing vector optimization problems
cites work: Nonconvex separation theorems and some applications in vector optimization
cites work: A generalization of ekellandz’s variational principle
cites work: Coherent measures of risk
cites work: Abstract convexity and global optimization
cites work: Monotonic analysis over ordered topological vector spaces. IV
cites work: Sub-topical functions and plus-co-radiant sets
cites work: Monotonic Analysis over Cones: I
cites work: Q5442495
cites work: Abstract convexity for nonconvex optimization duality
cites work: Cutting angle methods in global optimization
cites work: Convex-along-rays functions and star-shaped sets
cites work: Subdifferentials of convex-along-rays functions
cites work: Minimum type functions, plus-cogauges, and applications
cites work: Is every radiant function the sum of quasiconvex functions?
cites work: Q5479901
cites work: Superlinear separation for radiant and coradiant sets
cites work: A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
cites work: Quasiconvex duality theory by generalized conjugation methods
cites work: An approach to the subproblem of the cutting angle method of global optimization
cites work: Convergence of a numerical abstract convexity algorithm
DOI: 10.1007/S10957-017-1132-1
description: scientific article; zbMATH DE number 6800878