Pages that link to "Item:Q3004985"
From MaRDI portal
The following pages link to A First-Order Smoothed Penalty Method for Compressed Sensing (Q3004985):
Displaying 15 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares (Q2422134) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- Gradient-based method with active set strategy for $\ell _1$ optimization (Q4605700) (← links)
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function (Q5883320) (← links)
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems (Q6053022) (← links)
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems (Q6097764) (← links)
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems (Q6596342) (← links)
