Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
From MaRDI portal
Publication:6572453
Recommendations
- An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Nonconvex sparse regularization and splitting algorithms
- Global convergence of splitting methods for nonconvex composite optimization
- Gradient-based methods for sparse recovery
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 7071986 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A filter method with unified step computation for nonlinear optimization
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- Convergence study of indefinite proximal ADMM with a relaxation factor
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Hankel matrix rank minimization with applications to system identification and realization
- Lectures on convex optimization
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
- Multiplier and gradient methods
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Self-adaptive projection-based prediction-correction method for constrained variational inequalities
- Solving large-scale least squares semidefinite programming by alternating direction methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- The multiplier method of Hestenes and Powell applied to convex programming
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
This page was built for publication: Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572453)
