Pattern separation by convex programming

DOI10.1016/0022-247X(65)90150-2MaRDI QIDQ2396115zbMATH OpenOpenAlexFDO

Authors J. R. Rosen

Publication date 1965

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247x(65)90150-2

zbMATH Keywords

information, communication

Cites work

• scientific article; zbMATH DE number 3114403 (Why is no real title available?)
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3176492 (Why is no real title available?)
• scientific article; zbMATH DE number 3200675 (Why is no real title available?)
• Minimum Ellipsoids
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

Cited in

(24)

• A mixed integer programming approach to multi-spectral image classification
• Applications of semidefinite programming
• Optimization approaches to supervised classification
• Polyhedral separation via difference of convex (DC) programming
• Clustering via minimum volume ellipsoids
• Binary classification via spherical separator by DC programming and DCA
• Construction and application of an ellipsoidal convex model using a semi-definite programming formulation from measured data
• A constraint generation algorithm for large scale linear programs using multiple-points separation
• Separation of convex sets by Clarke subdifferential
• On numerical solving the spherical separability problem
• Aplicabilidad de la programacion matematica en la estimacion de funciones discriminantes
• Optimal data fitting: a moment approach
• A generalization of Löwner-John's ellipsoid theorem
• Ellipsoidal separation for classification problems
• An optimal algorithm for pattern classification†
• Minimum Ellipsoids
• DC models for spherical separation
• The emergence of fuzzy sets in the decade of the perceptron -- Lotfi A. Zadeh's and Frank Rosenblatt's research work on pattern classification
• Difference of Convex programming in adversarial SVM
• Efficient certifying algorithms for linear classification
• Minimum volume covering ellipsoids
• A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
• A fixed-center spherical separation algorithm with kernel transformations for classification problems
• Scale-invariant clustering with minimum volume ellipsoids

This page was built for publication: Pattern separation by convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396115)