Pages that link to "Item:Q2815550"
From MaRDI portal
The following pages link to A second-order method for convex<sub>1</sub>-regularized optimization with active-set prediction (Q2815550):
Displaying 21 items.
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization (Q2013139) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- An algorithm for quadratic ℓ<sub>1</sub>-regularized optimization with a flexible active-set strategy (Q3458840) (← links)
- Gradient-based method with active set strategy for $\ell _1$ optimization (Q4605700) (← links)
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (Q4606653) (← links)
- FaRSA for ℓ<sub>1</sub>-regularized convex optimization: local convergence and numerical experience (Q4638928) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
- A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering (Q5869815) (← links)
- An active-set proximal quasi-Newton algorithm for ℓ<sub>1</sub>-regularized minimization over a sphere constraint (Q5870141) (← links)
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints (Q6064946) (← links)
