The following pages link to NESTA (Q18668):
Displaying 50 items.
- Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm (Q2201672) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- An accelerated Uzawa method for application to frictionless contact problem (Q2228370) (← links)
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
- A compressed-sensing approach for closed-loop optimal control of nonlinear systems (Q2249709) (← links)
- A significance test for the lasso (Q2249837) (← links)
- Discussion: ``A significance test for the lasso'' (Q2249838) (← links)
- Rejoinder: ``A significance test for the lasso'' (Q2249839) (← links)
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm (Q2279178) (← links)
- An accelerated version of alternating direction method of multipliers for TV minimization in EIT (Q2293764) (← links)
- MCEN: a method of simultaneous variable selection and clustering for high-dimensional multinomial regression (Q2302492) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems (Q2308941) (← links)
- Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
- Block matching video compression based on sparse representation and dictionary learning (Q2333095) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring (Q2353428) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step (Q2423277) (← links)
- Accelerated gradient boosting (Q2425242) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data (Q2440136) (← links)
- A relaxed-PPA contraction method for sparse signal recovery (Q2440190) (← links)
- A unified approach for minimizing composite norms (Q2452377) (← links)
- Nesterov's algorithm solving dual formulation for compressed sensing (Q2511178) (← links)
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing'' (Q2511274) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- The Moreau envelope based efficient first-order methods for sparse recovery (Q2628357) (← links)
- Proximal Markov chain Monte Carlo algorithms (Q2628880) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
- Robust Manhattan non-negative matrix factorization for image recovery and representation (Q2663487) (← links)
- Solvability of monotone tensor complementarity problems (Q2688135) (← links)
- NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems (Q2700171) (← links)
- A Nonlinear PDE-Based Method for Sparse Deconvolution (Q2786360) (← links)
- An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm (Q2807288) (← links)
- (Q2896161) (← links)
- A First-Order Augmented Lagrangian Method for Compressed Sensing (Q2910879) (← links)
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation (Q2998011) (← links)
- A First-Order Smoothed Penalty Method for Compressed Sensing (Q3004985) (← links)
- An Accelerated Proximal Gradient Algorithm for Frame-Based Image Restoration via the Balanced Approach (Q3012049) (← links)
- Analysis and Generalizations of the Linearized Bregman Method (Q3052954) (← links)
- Sparse channel separation using random probes (Q3061235) (← links)
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science (Q3064466) (← links)