Gradient-based algorithms with applications to signal-recovery problems
From MaRDI portal
Recommendations
- Gradient-based methods for sparse recovery
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Signal Recovery by Proximal Forward-Backward Splitting
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
Cited in
(77)- A closer look at consistent operator splitting and its extensions for topology optimization
- A scaled gradient method for digital tomographic image reconstruction
- Functional response regression analysis
- Templates for convex cone problems with applications to sparse signal recovery
- Proximal algorithms in statistics and machine learning
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- Asymptotic properties on high-dimensional multivariate regression M-estimation
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Fast selection of nonlinear mixed effect models using penalized likelihood
- The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data
- Non-convex split Feasibility problems: models, algorithms and theory
- Three new iterative methods for solving inclusion problems and related problems
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Fused Lasso approach in portfolio selection
- Performance of first-order methods for smooth convex minimization: a novel approach
- Sensitivity analysis for inference with partially identifiable covariance matrices
- Signal modeling using the gradient search
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images
- Adaptive l₁-regularization for short-selling control in portfolio selection
- Split Bregman iteration for multi-period mean variance portfolio optimization
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- On FISTA with a relative error rule
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- On some steplength approaches for proximal algorithms
- Gradient-based methods for sparse recovery
- An Iterative Sparse-Group Lasso
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Planar quintic G^2 Hermite interpolation with minimum strain energy
- Independent component analysis based on fast proximal gradient
- Sensitivity analysis for mirror-stratifiable convex functions
- Computational spectral and ultrafast imaging via convex optimization
- Variational Gram functions: convex analysis and optimization
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Operator-valued kernel-based vector autoregressive models for network inference
- A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space.
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Integrative generalized convex clustering optimization and feature selection for mixed multi-view data
- A semi-alternating algorithm for solving nonconvex split equality problems
- Combining approximation and exact penalty in hierarchical programming
- A fast homotopy algorithm for gridless sparse recovery
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
- A first order method for solving convex bilevel optimization problems
- A primal-dual flow for affine constrained convex optimization
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- Practical perspectives on symplectic accelerated optimization
- First-order methods for convex optimization
- Convex approximations to sparse PCA via Lagrangian duality
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- The geometry of monotone operator splitting methods
- Convex Bidirectional Large Margin Classifiers
- Oracle-net for nonlinear compressed sensing in electrical impedance tomography reconstruction problems
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
- Robust and sparse pca for high-dimensional data via Huber loss and non-convex regularization
- Simultaneous incremental gradient method for inconsistent convex optimization problem
- Accelerated first-order optimization under nonlinear constraints
- Sequential sample average majorization-minimization
- A multi-step inertial extragradient algorithm for nonsmooth and nonconvex composite optimization problems
- Online inference in high-dimensional regression with streaming clustered data
- Homogeneity and sparsity pursuit using robust adaptive fused Lasso
- Proximal algorithms and temporal difference methods for solving fixed point problems
- An accelerated mirror descent algorithm for constrained nonconvex problems
- On the convergence and properties of a proximal-gradient method on Hadamard manifolds
- Dynamic fista for convex composite bilevel optimization
- Structured FISTA for l₁-regularized optimization model in image restoration
This page was built for publication: Gradient-based algorithms with applications to signal-recovery problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079664)
