Learning sparse classifiers with difference of convex functions algorithms

Author： Ong Cheng Soon   An Le Thi Hoai  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.28, Iss.4, 2013-08, pp. : 830-854

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Characterization of Lipschitz Continuous Difference of Convex Functions

By Hantoute A.   Martínez-Legaz J.  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 3, 2013-12 ,pp. : 673-680

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for learning functions with bounded variation

By Long P.M.  

Information and Computation, Vol. 188, Iss. 1, 2004-01 ,pp. : 99-115

Elsevier

Access to resources Recommend Favorite

Deterministic sparse FFT algorithms

By  

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS (ELECTRONIC), Vol. 15, Iss. 1, 2015-10 ,pp. : 667-668

John Wiley & Sons Inc

Access to resources Recommend Favorite

Analysis of Matrix-Convex Functions

By Amirgalieva S. N.   Ostapenko V. V.   Ostapenko E. V.  

Cybernetics and Systems Analysis, Vol. 40, Iss. 4, 2004-07 ,pp. : 547-555

Springer Publishing Company

Access to resources Recommend Favorite

On convex representatives of polyconvex functions

By Bevan Jonathan  

Proceedings Section A: Mathematics - Royal Society of Edinburgh, Vol. 136, Iss. 1, 2006-02 ,pp. : 23-51

Royal Society of Edinburgh

Access to resources Recommend Favorite