Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization

DOI10.1109/TAC.2015.2390551zbMath1360.90213MaRDI QIDQ2982665

Ion Necoara, Andrei T. Patrascu

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37)

Related Items (4)

Distributed Block Coordinate Descent for Minimizing Partially Separable Functions ⋮ MIP-BOOST: Efficient and Effective L₀ Feature Selection for Linear Regression ⋮ Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms ⋮ Unnamed Item

This page was built for publication: Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization