Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
From MaRDI portal
Publication:122993
DOI10.1561/2200000016zbMath1229.90122DBLPjournals/ftml/BoydPCPE11OpenAlexW4292363360WikidataQ55213954 ScholiaQ55213954MaRDI QIDQ122993
Publication date: 2010
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/2200000016
Convex programming (90C25) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
A hybrid optimization method for multiplicative noise and blur removal ⋮ Pansharpening image fusion using cross-channel correlation: a framelet-based approach ⋮ Higher-degree eigenvalue complementarity problems for tensors ⋮ A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions ⋮ Bounding duality gap for separable problems with linear constraints ⋮ Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ On structural decompositions of finite frames ⋮ A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Joint estimation of precision matrices in heterogeneous populations ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ An algorithm twisted from generalized ADMM for multi-block separable convex minimization models ⋮ On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models ⋮ A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ The non-convex sparse problem with nonnegative constraint for signal reconstruction ⋮ An improved robust ADMM algorithm for quantum state tomography ⋮ Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization ⋮ Convex image denoising via non-convex regularization with parameter selection ⋮ A variational aggregation framework for patch-based optical flow estimation ⋮ Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity ⋮ A multiphase image segmentation based on fuzzy membership functions and L1-norm fidelity ⋮ Tomographic image reconstruction using training images ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ A lasso for hierarchical interactions ⋮ Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness ⋮ Parallel Uzawa method for large-scale minimization of partially separable functions ⋮ On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities ⋮ The geometry of least squares in the 21st century ⋮ Learning with infinitely many features ⋮ On an inequality of C. Sundberg: a computational investigation via nonlinear programming ⋮ A parallel splitting method for separable convex programs ⋮ Alternating projections on nontangential manifolds ⋮ Learning a factor model via regularized PCA ⋮ A distributed algorithm for fitting generalized additive models ⋮ Fast first-order methods for composite convex optimization with backtracking ⋮ Alternating direction method of multipliers for sparse principal component analysis ⋮ Lasso penalized model selection criteria for high-dimensional multivariate linear regression analysis ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ A sparse collocation method for solving time-dependent HJB equations using multivariate \(B\)-splines ⋮ Variational image segmentation models involving non-smooth data-fidelity terms ⋮ A phase model for point spread function estimation in ground-based astronomy ⋮ Consensus proximal support vector machine for classification problems with sparse solutions ⋮ An efficient nonconvex regularization for wavelet frame and total variation based image restoration ⋮ Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) ⋮ An alternating direction method with increasing penalty for stable principal component pursuit ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ An augmented Lagrangian method for distributed optimization ⋮ Sparse optimization of vibration signal by ADMM ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints ⋮ A note on augmented Lagrangian-based parallel splitting method ⋮ Individual-specific, sparse inverse covariance estimation in generalized estimating equations ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R ⋮ Reducing spatially varying out-of-focus blur from natural image ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ A note on the convergence of ADMM for linearly constrained convex optimization problems ⋮ Fast algorithm for image denoising with different boundary conditions ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ A computation study on an integrated alternating direction method of multipliers for large scale optimization ⋮ On the linear convergence of the alternating direction method of multipliers ⋮ An inexact alternating direction method of multipliers with relative error criteria ⋮ Decomposition methods for a spatial model for long-term energy pricing problem ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ An extragradient-based alternating direction method for convex minimization ⋮ Distributed learning for random vector functional-link networks ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ ADMM ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis ⋮ Alternating direction method of multipliers for penalized zero-variance discriminant analysis ⋮ Rare Feature Selection in High Dimensions ⋮ A class of ADMM-based algorithms for three-block separable convex programming ⋮ Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization ⋮ Regularized optimization with spatial coupling for robust decision making ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints ⋮ A tensor-based dictionary learning approach to tomographic image reconstruction ⋮ On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints ⋮ Log-Contrast Regression with Functional Compositional Predictors: Linking Preterm Infant's Gut Microbiome Trajectories to Neurobehavioral Outcome ⋮ An efficient weighted Lagrangian twin support vector machine for imbalanced data classification ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ The Little Engine that Could: Regularization by Denoising (RED) ⋮ A Penalized Likelihood Method for Classification With Matrix-Valued Predictors ⋮ ADMMsigma ⋮ Factor-Adjusted Regularized Model Selection ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ Estimation of multiple networks in Gaussian mixture models ⋮ Block splitting for distributed optimization ⋮ Theoretical guarantees for graph sparse coding ⋮ Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs ⋮ Group sparse optimization for learning predictive state representations ⋮ A convex variational model for restoring SAR images corrupted by multiplicative noise ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints ⋮ Hyperspectral unmixing by the alternating direction method of multipliers ⋮ Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm ⋮ Online learning over a decentralized network through ADMM
Uses Software
This page was built for publication: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
