Research graph
References from Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Local targets link to admitted publications; unresolved targets remain external evidence.
“Fast image recovery using variable splitting and constrained optimization”
10.1109/tip.2010.2047910 · 2010 · External reference
“An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems”
10.1109/tip.2010.2076294 · 2011 · External reference
Unresolved reference
1990 · External reference
“Existence of an equilibrium for a competitive economy”
10.2307/1907353 · 1954 · External reference
Unresolved reference
1958 · External reference
Unresolved reference
1958 · External reference
“Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data”
2008 · External reference
“Convexity, classification, and risk bounds”
10.1198/016214505000000907 · 2006 · External reference
“Dykstra’s alternating projection algorithm for two sets”
10.1006/jath.1994.1136 · 1994 · External reference
“On projection algorithms for solving convex feasibility problems”
10.1137/s0036144593251710 · 1996 · External reference
“A fast iterative shrinkage-thresholding algorithm for linear inverse problems”
10.1137/080716542 · 2009 · External reference
“NESTA: A fast and accurate first-order method for sparse recovery”
2009 · External reference
“Partitioning procedures for solving mixed-variables programming problems”
10.1007/bf01386316 · 1962 · External reference
“Sur les méthodes de décomposition, de décentralisation et de coordination et applications”
1976 · External reference
Unresolved reference
1982 · External reference
Unresolved reference
1999 · External reference
Unresolved reference
1989 · External reference
“Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing”
2010 · External reference
10.1007/978-1-4757-9859-3
10.1007/978-1-4757-9859-3 · 2000 · External reference
10.1017/cbo9780511804441
10.1017/cbo9780511804441 · 2004 · External reference
“Finding the common point of convex sets by the method of successive projections”
1965 · External reference
“The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming”
10.1016/0041-5553(67)90040-7 · 1967 · External reference
Unresolved reference
1973 · External reference
“From sparse solutions of systems of equations to sparse modeling of signals and images”
10.1137/060657704 · 2009 · External reference
“HaLoop: Efficient iterative data processing on large clusters”
2010 · External reference
“A limited memory algorithm for bound constrained optimization”
10.1137/0916069 · 1995 · External reference
“Near-ideal model selection by ℓ1 minimization”
10.1214/08-aos653 · 2009 · External reference
“Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information”
10.1109/tit.2005.862083 · 2006 · External reference
“Near-optimal signal recovery from random projections: Universal encoding strategies”
10.1109/tit.2006.885507 · 2006 · External reference
“Proximal minimization algorithm with D-functions”
10.1007/bf00940051 · 1992 · External reference
Unresolved reference
1997 · External reference
“BigTable: A distributed storage system for structured data”
10.1145/1365815.1365816 · 2008 · External reference
“A proximal-based decomposition method for convex minimization problems”
10.1007/bf01582566 · 1994 · External reference
“Atomic decomposition by basis pursuit”
10.1137/s003614450037906x · 2001 · External reference
“Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate”
10.1145/1391989.1391995 · 2008 · External reference
“Proximity maps for convex sets”
10.1090/s0002-9939-1959-0105008-8 · 1959 · External reference
“MapReduce for machine learning on multicore”
2007 · External reference
“Robust modeling with erratic data”
10.1190/1.1440378 · 1973 · External reference
“The convex feasibility problem in image recovery”
10.1016/s1076-5670(08)70157-5 · 1996 · External reference
“A Douglas–Rachford splitting approach to nonsmooth convex variational signal recovery”
10.1109/jstsp.2007.910264 · 2007 · External reference
“Proximal splitting methods in signal processing”
2009 · External reference
“Signal recovery by proximal forward-backward splitting”
10.1137/050626090 · 2006 · External reference
Unresolved reference
1963 · External reference
“Decomposition principle for linear programs”
10.1287/opre.8.1.101 · 1960 · External reference
“An iterative thresholding algorithm for linear inverse problems with a sparsity constraint”
10.1002/cpa.20042 · 2004 · External reference
“MapReduce: Simplified data processing on large clusters”
10.1145/1327452.1327492 · 2008 · External reference
10.1137/1.9781611971446
10.1137/1.9781611971446 · 1997 · External reference
“Covariance selection”
10.2307/2528966 · 1972 · External reference
“De-noising by soft-thresholding”
10.1109/18.382009 · 1995 · External reference
“Compressed sensing”
10.1109/tit.2006.871582 · 2006 · External reference
“Message-passing algorithms for compressed sensing”
10.1073/pnas.0909892106 · 2009 · External reference
Unresolved reference
2006 · External reference
“On the numerical solution of heat conduction problems in two and three space variables”
10.1090/s0002-9947-1956-0084194-4 · 1956 · External reference
“Distributed Dual Averaging in Networks”
2010 · External reference
“Projected subgradient methods for learning sparse Gaussians”
2008 · External reference
“An algorithm for restricted least squares regression”
10.1080/01621459.1983.10477029 · 1983 · External reference
Unresolved reference
1989 · External reference
“Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming”
10.1287/moor.18.1.202 · 1993 · External reference
“Parallel alternating direction multiplier decomposition of convex programs”
10.1007/bf02196592 · 1994 · External reference
“Some saddle-function splitting methods for convex programming”
10.1080/10556789408805578 · 1994 · External reference
“A practical general approximation criterion for methods of multipliers based on Bregman distances”
10.1007/s10107-003-0374-x · 2003 · External reference
Unresolved reference
1990 · External reference
“On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators”
10.1007/bf01581204 · 1992 · External reference
“Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control”
10.1287/ijoc.10.2.218 · 1998 · External reference
“Some reformulations and applications of the alternating direction method of multipliers”
1993 · External reference
“A family of projective splitting methods for the sum of two maximal monotone operators”
10.1007/s10107-006-0070-8 · 2008 · External reference
“General projective splitting methods for sums of maximal monotone operators”
10.1137/070698816 · 2009 · External reference
“Applications of Lagrangian-based alternating direction methods and connections to split Bregman”
2009 · External reference
“Generalized Lagrange multiplier method for solving problems of optimum allocation of resources”
10.1287/opre.11.3.399 · 1963 · External reference
“Monotone operator splitting for optimization problems in sparse recovery”
2009 · External reference
10.1137/1.9781611971316
10.1137/1.9781611971316 · 1990 · External reference
“Restoration of Poissonian Images Using Alternating Direction Optimization”
10.1109/tip.2010.2053941 · 2010 · External reference
“Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems”
10.1109/jstsp.2007.910281 · 2007 · External reference
“Consensus-based distributed support vector machines”
2010 · External reference
Unresolved reference
1983 · External reference
Unresolved reference
1983 · External reference
Unresolved reference
2009 · External reference
10.1007/3-540-59119-2_166
10.1007/3-540-59119-2_166 · 1995 · External reference
“Sparse inverse covariance estimation with the graphical lasso”
10.1093/biostatistics/kxm045 · 2008 · External reference
“Application of the alternating direction method of multipliers to separable convex programming problems”
10.1007/bf00247655 · 1992 · External reference
Unresolved reference
1983 · External reference
“A dual algorithm for the solution of nonlinear variational problems via finite element approximations”
10.1016/0898-1221(76)90003-1 · 1976 · External reference
Unresolved reference
2002 · External reference
“Generalized Benders decomposition”
10.1007/bf00934810 · 1972 · External reference
“The Google file system”
10.1145/1165389.945450 · 2003 · External reference
“Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité, d’une classe de problèmes de Dirichlet non linéaires”
10.1051/m2an/197509r200411 · 1975 · External reference
“Augmented Lagrangian methods for the solution of variational problems”
1987 · External reference
“The split Bregman method for ℓ1 regularized problems”
10.1137/080725891 · 2009 · External reference
“Modified Lagrangians in convex programming and their generalizations”
10.1007/bfb0120845 · 1979 · External reference
Unresolved reference
1996 · External reference
“The Parallel BGL: A generic library for distributed graph computations”
2005 · External reference
“The unreasonable effectiveness of data”
10.1109/mis.2009.36 · 2009 · External reference
“MapReduce/BigTable for distributed optimization”
2010 · External reference
Unresolved reference
1990 · External reference
10.1007/978-0-387-84858-7
10.1007/978-0-387-84858-7 · 2009 · External reference
“Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities”
10.1023/a:1004603514434 · 2000 · External reference
“Multiplier and gradient methods”
10.1007/bf00927673 · 1969 · External reference
Unresolved reference
1969 · External reference
10.1007/978-3-642-56468-0
10.1007/978-3-642-56468-0 · 2001 · External reference
“Robust estimation of a location parameter”
10.1214/aoms/1177703732 · 1964 · External reference
“ℓ1 trend filtering”
10.1137/070690274 · 2009 · External reference
“An interior-point method for large-scale ℓ1-regularized least squares”
10.1109/jstsp.2007.910971 · 2007 · External reference
“An interior-point method for large-scale ℓ1-regularized logistic regression”
2007 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
External reference
“A variable-penalty alternating directions method for convex optimization”
10.1007/bf02680549 · 1998 · External reference
Unresolved reference
1970 · External reference
“On fixed points of non-expansive piecewise isometric mappings”
10.1112/plms/s3-55.3.605 · 1987 · External reference
“Basic linear algebra subprograms for Fortran usage”
10.1145/355841.355847 · 1979 · External reference
“Algorithms for non-negative matrix factorization”
2001 · External reference
“Design patterns for efficient graph algorithms in MapReduce”
10.1145/1830252.1830263 · 2010 · External reference
“Splitting algorithms for the sum of two nonlinear operators”
10.1137/0716071 · 1979 · External reference
“On the limited memory method for large-scale optimization”
10.1007/bf01589116 · 1989 · External reference
“GraphLab: A new parallel framework for machine learning”
2010 · External reference
“Smooth optimization approach for sparse covariance selection”
10.1137/070695915 · 2009 · External reference
“An alternating direction method for finding Dantzig selectors”
2010 · External reference
Unresolved reference
1973 · External reference
“Network flow algorithms for structured sparsity”
2010 · External reference
“Pregel: A system for large-scale graph processing”
2010 · External reference
“An augmented Lagrangian approach to constrained MAP inference”
2011 · External reference
“Distributed sparse linear regression”
10.1109/tsp.2010.2055862 · 2010 · External reference
Unresolved reference
1991 · External reference
“High-dimensional graphs and variable selection with the lasso”
10.1214/009053606000000281 · 2006 · External reference
“Use of the augmented penalty function in mathematical programming problems, part 1”
10.1007/bf00928472 · 1971 · External reference
“Use of the augmented penalty function in mathematical programming problems, part 2”
10.1007/bf00928473 · 1971 · External reference
“On the method of multipliers for mathematical programming problems”
10.1007/bf00934960 · 1972 · External reference
“Fonctions convexes duales et points proximaux dans un espace Hilbertien”
1962 · External reference
“Fully distributed algorithms for convex optimization problems”
10.1007/978-3-540-75142-7_41 · 2007 · External reference
“Application of a smoothing technique to decomposition in convex optimization”
10.1109/tac.2008.2007159 · 2008 · External reference
“Distributed subgradient methods for multi-agent optimization”
10.1109/tac.2008.2009515 · 2009 · External reference
Unresolved reference
2010 · External reference
“A method of solving a convex programming problem with convergence rate O(1/k2)”
1983 · External reference
Unresolved reference
External reference
10.1137/090774823
10.1137/090774823 · External reference
10.1007/b98874
10.1007/b98874 · 1999 · External reference
“Segmentation of ARX-models using sum-of-norms regularization”
10.1016/j.automatica.2010.03.013 · 2010 · External reference
“The numerical solution of parabolic and elliptic differential equations”
10.1137/0103003 · 1955 · External reference
Unresolved reference
1969 · External reference
“Kalman filtering in wireless sensor networks—Incorporating communication cost in state estimation problems”
10.1109/mcs.2009.935569 · 2010 · External reference
10.1515/9781400873173
10.1515/9781400873173 · 1970 · External reference
“Augmented Lagrangians and applications of the proximal point algorithm in convex programming”
10.1287/moor.1.2.97 · 1976 · External reference
“Monotone operators and the proximal point algorithm”
10.1137/0314056 · 1976 · External reference
“Scenarios and policy aggregation in optimization under uncertainty”
10.1287/moor.16.1.119 · 1991 · External reference
10.1007/978-3-642-02431-3
10.1007/978-3-642-02431-3 · 1998 · External reference
“Nonlinear total variation based noise removal algorithms”
10.1016/0167-2789(92)90242-f · 1992 · External reference
“An augmented Lagrangian decomposition method for block diagonal linear programming problems”
10.1016/0167-6377(89)90055-2 · 1989 · External reference
“On convergence of an augmented Lagrangian decomposition method for sparse convex optimization”
10.1287/moor.20.3.634 · 1995 · External reference
“Sparse inverse covariance selection via alternating linearization methods”
2010 · External reference
“Consensus in ad hoc WSNs with noisy links—Part II: Distributed estimation and smoothing of random signals”
10.1109/tsp.2007.908943 · 2008 · External reference
“Consensus in ad hoc WSNs with noisy links—Part I: Distributed estimation of deterministic signals”
10.1109/tsp.2007.906734 · 2008 · External reference
Unresolved reference
2002 · External reference
10.1007/978-3-642-82118-9
10.1007/978-3-642-82118-9 · 1985 · External reference
“Applications of the method of partial inverses to convex programming: decomposition”
10.1007/bf01586091 · 1985 · External reference
“Removing multiplicative noise by Douglas-Rachford splitting methods”
10.1007/s10851-009-0179-5 · 2010 · External reference
“Bundle methods for regularized risk minimization”
2010 · External reference
“Regression shrinkage and selection via the lasso”
10.1111/j.2517-6161.1996.tb02080.x · 1996 · External reference
“Applications of a splitting algorithm to decomposition in convex programming and variational inequalities”
10.1137/0329006 · 1991 · External reference
“Alternating projection-proximal methods for convex programming and variational inequalities”
10.1137/s1052623495279797 · 1997 · External reference
“A modified forward-backward splitting method for maximal monotone mappings”
10.1137/s0363012998338806 · 2000 · External reference
Unresolved reference
External reference
“Distributed asynchronous deterministic and stochastic gradient optimization algorithms”
10.1109/tac.1986.1104412 · 1986 · External reference
“Market mechanisms and mathematical programming”
10.2307/1907569 · 1960 · External reference
“Walras’ tâtonnement in the theory of exchange”
10.2307/2296080 · 1960 · External reference
“A bridging model for parallel computation”
10.1145/79173.79181 · 1990 · External reference
10.1007/978-1-4757-3264-1
10.1007/978-1-4757-3264-1 · 2000 · External reference
10.1515/9781400881895
10.1515/9781400881895 · 1950 · External reference
10.1561/2200000001 · 2008 · Admitted local publication
Unresolved reference
1896 · External reference
“Decomposition method with a variable parameter for a class of monotone variational inequality problems”
10.1023/a:1017522623963 · 2001 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2009 · External reference
“Fast linear iterations for distributed averaging”
10.1016/j.sysconle.2004.02.022 · 2004 · External reference
10.21236/ada525384
10.21236/ada525384 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
“Bregman iterative algorithms for l1-minimization with applications to compressed sensing”
10.1137/070703983 · 2008 · External reference
“Model selection and estimation in regression with grouped variables”
10.1111/j.1467-9868.2005.00532.x · 2006 · External reference
Unresolved reference
External reference
“Spark: Cluster computing with working sets”
2010 · External reference
“Statistical behavior and consistency of classification methods based on convex risk minimization”
10.1214/aos/1079120130 · 2004 · External reference
“The composite absolute penalties family for grouped and hierarchical variable selection”
10.1214/07-aos584 · 2009 · External reference
“Distributed consensus-based demodulation: algorithms and error analysis”
10.1109/twc.2010.06.090890 · 2010 · External reference
“Distributed in-network channel decoding”
10.1109/tsp.2009.2023936 · 2009 · External reference
