Unsupervised classification via convex absolute value inequalities
From MaRDI portal
Recommendations
Cites work
- Absolute value equation solution via concave minimization
- Absolute value equations
- Absolute value programming
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- Minimum-support solutions of polyhedral concave programs*
- On unique solvability of the absolute value equation
- Systems of linear interval equations
Cited in
(8)- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Sufficient conditions for the unsolvability and solvability of the absolute value equation
- Unsupervised and semisupervised classification via absolute value inequalities
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- Algorithms and Fundamental Limits for Unlabeled Detection Using Types
- Convex Maximization via Adjustable Robust Optimization
- Absolute value linear programming
- Range of optimal values in absolute value linear programming with interval data
This page was built for publication: Unsupervised classification via convex absolute value inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981845)