Pages that link to "Item:Q4606653"

The following pages link to A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (Q4606653):

Displaying 50 items.

• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• Double fused Lasso penalized LAD for matrix regression (Q2009580) (← links)
• A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems (Q2033078) (← links)
• A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299) (← links)
• An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
• Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem (Q2072164) (← links)
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
• High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems (Q2095559) (← links)
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
• An investigation on semismooth Newton based augmented Lagrangian method for image restoration (Q2162237) (← links)
• An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
• tSSNALM: a fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA (Q2189837) (← 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)
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
• A semismooth Newton method for support vector classification and regression (Q2419554) (← links)
• An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation (Q2697370) (← links)
• Composite Difference-Max Programs for Modern Statistical Estimation Problems (Q4562249) (← links)
• On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems (Q4571884) (← links)
• A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications (Q4960078) (← links)
• (Q4998873) (← links)
• An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems (Q4999369) (← links)
• Calibrated zero-norm regularized LS estimator for high-dimensional error-in-variables regression (Q5004050) (← links)
• Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector (Q5021412) (← links)
• Sparse Approximations with Interior Point Methods (Q5044994) (← links)
• A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
• Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
• An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
• An efficient augmented Lagrangian method for support vector machine (Q5135259) (← links)
• (Q5149020) (← links)
• The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion (Q5149515) (← links)
• Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction (Q5161735) (← links)
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519) (← links)
• Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method (Q5214191) (← links)
• An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
• On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
• Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem (Q5231697) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← 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 ℓ₁-regularized minimization over a sphere constraint (Q5870141) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• An efficient semismooth Newton method for adaptive sparse signal recovery problems (Q5882234) (← links)
• A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
• Transformed primal-dual methods for nonlinear saddle point systems (Q6087387) (← links)
• An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications (Q6098964) (← links)