Pages that link to "Item:Q122993"
From MaRDI portal
The following pages link to Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993):
Displaying 50 items.
- Sparse approximate solution of fitting surface to scattered points by MLASSO model (Q1656898) (← links)
- Homogeneity detection for the high-dimensional generalized linear model (Q1658352) (← links)
- Trace regression model with simultaneously low rank and row(column) sparse parameter (Q1658399) (← links)
- Tracking concept drift using a constrained penalized regression combiner (Q1658462) (← links)
- A relative error-based approach for variable selection (Q1659002) (← links)
- Structured variable selection via prior-induced hierarchical penalty functions (Q1659467) (← links)
- A SAEM algorithm for fused Lasso penalized nonlinear mixed effect models: application to group comparison in pharmacokinetics (Q1659496) (← links)
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM (Q1659676) (← links)
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso (Q1662870) (← links)
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables (Q1664611) (← links)
- A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162) (← links)
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems (Q1668709) (← links)
- On the information-adaptive variants of the ADMM: an iteration complexity perspective (Q1668725) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms (Q1669617) (← links)
- Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis (Q1669702) (← links)
- A partially isochronous splitting algorithm for three-block separable convex minimization problems (Q1670406) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm (Q1675933) (← links)
- An oracle inequality for quasi-Bayesian nonnegative matrix factorization (Q1678528) (← links)
- Generalized Kalman smoothing: modeling and algorithms (Q1678609) (← links)
- Variational image segmentation model coupled with image restoration achievements (Q1678702) (← links)
- Exponential convergence of a distributed algorithm for solving linear algebraic equations (Q1679072) (← links)
- On the emergence of oscillations in distributed resource allocation (Q1679826) (← links)
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach (Q1680667) (← links)
- Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
- A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization (Q1682919) (← links)
- Tight global linear convergence rate bounds for Douglas-Rachford splitting (Q1684840) (← links)
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem (Q1685585) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- Approximate ADMM algorithms derived from Lagrangian splitting (Q1687316) (← links)
- A partially parallel prediction-correction splitting method for convex optimization problems with separable structure (Q1689069) (← links)
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication (Q1689381) (← links)
- Sparse and low-rank matrix regularization for learning time-varying Markov networks (Q1689602) (← links)
- Cluster analysis of longitudinal profiles with subgroups (Q1697471) (← links)
- A study on off-grid issue in DOA and frequency estimations (Q1698433) (← links)
- Sparse probit linear mixed model (Q1698863) (← links)
- Joint hydrogeophysical inversion: state estimation for seawater intrusion models in 3D (Q1702335) (← links)
- Improved susceptibility artifact correction of echo-planar MRI using the alternating direction method of multipliers (Q1703174) (← links)
- Multiple penalized principal curves: analysis and computation (Q1703949) (← links)
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences (Q1704003) (← links)
- Hierarchical sparse modeling: a choice of two group Lasso formulations (Q1704702) (← links)
- A flexible ADMM algorithm for big data applications (Q1704789) (← links)
- Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845) (← links)
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (Q1706414) (← links)
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints (Q1706676) (← links)
- Image denoising using combined higher order non-convex total variation with overlapping group sparsity (Q1710972) (← links)
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression (Q1713210) (← links)