Abstract convexity, global optimization and data classification.
From MaRDI portal
Publication:2467820
DOI10.1007/BF03398635zbMath1278.90320MaRDI QIDQ2467820
Publication date: 29 January 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398635
90C26: Nonconvex programming, global optimization
90C46: Optimality conditions and duality in mathematical programming
Related Items
Zero duality gap conditions via abstract convexity, Unnamed Item, Global optimization of the difference of two increasing plus-convex-along-rays functions, Generalised rational approximation and its application to improve deep learning classifiers
Cites Work
- Cutting angle method and a local search
- A global optimization approach to classification
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Global minimization of increasing positively homogeneous functions over the unit simplex
- Abstract convexity and global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item