Pages that link to "Item:Q312690"
From MaRDI portal
The following pages link to A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690):
Displaying 26 items.
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization (Q2013139) (← links)
- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← 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)
- Optimization Methods for Large-Scale Machine Learning (Q4641709) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
- Inexact proximal stochastic second-order methods for nonconvex composite optimization (Q5135256) (← links)
- Stochastic proximal quasi-Newton methods for non-convex composite optimization (Q5198046) (← links)
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation (Q5232118) (← 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)
- An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising (Q5860376) (← links)
- An active-set proximal quasi-Newton algorithm for ℓ<sub>1</sub>-regularized minimization over a sphere constraint (Q5870141) (← links)
