Abstract convexity, global optimization and data classification.

DOI10.1007/BF03398635zbMath1278.90320OpenAlexW2774472691MaRDI QIDQ2467820

Alexander Rubinov

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398635

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Global optimization of the difference of two increasing plus-convex-along-rays functions ⋮ Zero duality gap conditions via abstract convexity ⋮ Generalised rational approximation and its application to improve deep learning classifiers ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Abstract convexity, global optimization and data classification.