Solving the L1 regularized least square problem via a box-constrained smooth minimization
In this paper, an equivalent smooth minimization for the L1 regularized least square problem is proposed. The proposed problem is a convex box-constrained smooth minimization which allows applying fast optimization methods to find its solution. Further, it is investigated that the property "the dual of dual is primal" holds for the L1 regularized least square problem. A solver for the smooth problem is proposed, and its affinity to the proximal gradient is shown. Finally, the experiments on L1 and total variation regularized problems are performed, and the corresponding results are reported.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Safe Peeling for L0-Regularized Least-Squares with supplementary material
We introduce a new methodology dubbed ``safe peeling'' to accelerate the resolution of L0-regularized least-squares problems via a Branch-and-Bound (BnB) algorithm. Our procedure enables to tighten the convex relaxation …
Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization
We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching. We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized…
Two-Layer Neural Networks for Partial Differential Equations: Optimization and Generalization Theory
The problem of solving partial differential equations (PDEs) can be formulated into a least-squares minimization problem, where neural networks are used to parametrize PDE solutions. A global minimizer corresponds to a n…
Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees
Randomized algorithms are important for solving large-scale optimization problems. In this paper, we propose a fast sketching algorithm for least square problems regularized by convex or nonconvex regularization function…
Sparse LearningError bound of critical points and KL property of exponent $1/2$ for squared F-norm regularized factorization
This paper is concerned with the squared F(robenius)-norm regularized factorization form for noisy low-rank matrix recovery problems. Under a suitable assumption on the restricted condition number of the Hessian for the …