Pages that link to "Item:Q122993"

The following pages link to Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993):

Displaying 50 items.

• Learning a factor model via regularized PCA (Q399883) (← links)
• A distributed algorithm for fitting generalized additive models (Q402192) (← links)
• Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• Lasso penalized model selection criteria for high-dimensional multivariate linear regression analysis (Q458641) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• A sparse collocation method for solving time-dependent HJB equations using multivariate \(B\)-splines (Q466457) (← links)
• Variational image segmentation models involving non-smooth data-fidelity terms (Q474902) (← links)
• A phase model for point spread function estimation in ground-based astronomy (Q476541) (← links)
• Consensus proximal support vector machine for classification problems with sparse solutions (Q489099) (← links)
• An efficient nonconvex regularization for wavelet frame and total variation based image restoration (Q492121) (← links)
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
• An alternating direction method with increasing penalty for stable principal component pursuit (Q493688) (← links)
• An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
• An augmented Lagrangian method for distributed optimization (Q494348) (← links)
• Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
• A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints (Q496623) (← links)
• A note on augmented Lagrangian-based parallel splitting method (Q497450) (← links)
• Individual-specific, sparse inverse covariance estimation in generalized estimating equations (Q504468) (← links)
• On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
• Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
• Reducing spatially varying out-of-focus blur from natural image (Q507256) (← links)
• Exact augmented Lagrangian duality for mixed integer linear programming (Q507329) (← links)
• A note on the convergence of ADMM for linearly constrained convex optimization problems (Q513720) (← links)
• On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
• An inexact alternating direction method of multipliers with relative error criteria (Q519776) (← links)
• Decomposition methods for a spatial model for long-term energy pricing problem (Q522102) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
• Distributed learning for random vector functional-link networks (Q528749) (← links)
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
• A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) (← links)
• Sparse optimization of vibration signal by ADMM (Q670432) (← links)
• Fast algorithm for image denoising with different boundary conditions (Q682840) (← links)
• Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737) (← links)
• A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← links)
• A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
• Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization (Q723737) (← links)
• Regularized optimization with spatial coupling for robust decision making (Q723991) (← links)
• Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers (Q725878) (← links)
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
• A tensor-based dictionary learning approach to tomographic image reconstruction (Q727901) (← links)
• On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints (Q730628) (← links)
• An efficient weighted Lagrangian twin support vector machine for imbalanced data classification (Q736317) (← links)
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
• Block splitting for distributed optimization (Q744220) (← links)
• Theoretical guarantees for graph sparse coding (Q778037) (← links)
• Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs (Q778295) (← links)
• Group sparse optimization for learning predictive state representations (Q778374) (← links)
• A convex variational model for restoring SAR images corrupted by multiplicative noise (Q778643) (← links)