Pages that link to "Item:Q5219700"
From MaRDI portal
The following pages link to Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700):
Displaying 14 items.
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning (Q2045021) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems (Q2301184) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization (Q3130749) (← links)
- Robust signal recovery for ℓ <sub>1–2</sub> minimization via prior support information (Q5860797) (← links)
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization (Q5882242) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
- Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
