A Douglas-Rachford method for sparse extreme learning machine

DOI10.4310/MAA.2019.V26.N3.A1zbMATH Open1441.90126OpenAlexW3014602583MaRDI QIDQ1985705FDOQ1985705

Tommi Kärkkäinen, Roland Glowinski

Publication date: 7 April 2020

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

Full work available at URL: https://doi.org/10.4310/maa.2019.v26.n3.a1

Recommendations

• Operator splitting methods in compressive sensing and sparse approximation
• A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning
• Proximal alternating method for dictionary learning
• Monotone operator theory and splitting methods
• A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression

zbMATH Keywords

extreme learning machinesparse regularizationoperator-splittingDouglas-Rachford

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (1)

• Machine learning algorithms of relaxation subgradient method with space extension

This page was built for publication: A Douglas-Rachford method for sparse extreme learning machine

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