scientific article; zbMATH DE number 6293788

zbMath1401.90150MaRDI QIDQ5415303

Alberto Seeger, Manlio Gaudioso, Annabella Astorino

Publication date: 12 May 2014

Full work available at URL: http://www.heldermann.de/JCA/JCA21/JCA211/jca21001.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

classificationconvex optimizationrevolution coneDC-optimizationconical separationproximal point techniques

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Related Items (9)

Spherical separation with infinitely far center ⋮ A Lagrangean relaxation approach to lifetime maximization of directional sensor networks ⋮ Ellipsoidal classification via semidefinite programming ⋮ Optimization approaches to supervised classification ⋮ An illumination problem: optimal apex and optimal orientation for a cone of light ⋮ Semisupervised spherical separation ⋮ Clustering based polyhedral conic functions algorithm in classification ⋮ Support vector machine polyhedral separability in semisupervised learning ⋮ Polyhedral separation via difference of convex (DC) programming

Uses Software

• UCI-ml
• LIBSVM

This page was built for publication: