Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
Open accessThe DOI matches its Crossref record; 108 of the 109 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“This is achieved by automatically transforming the original problem instances into standard conic programming forms, followed by calling the advanced off-theshelf conic solvers, e.g., MOSEK [296] and SCS [113].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [113]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationRegression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 1×
“This problem, known as the lasso [98], is widely studied in high-dimensional statistics, machine learning, and compressed sensing.”
BackgroundGolub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Self-citationIterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790 · cited 1×
“This system is then solved with the conjugate gradient method (CG) [72, 75, 76].”
Method(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Self-citationRockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149 · cited 1×
“jl [89], and YALMIP [90].”
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958 · cited 1×
“It has been observed that first-order methods can perform very well on lasso-type problems when the solution is sparse [99,100].”
MethodA First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336 · cited 1×
“’ There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodInterior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodParikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102 · cited 2×
“See Esser et al. [63] for a detailed discussion of various first-order methods and the relationships between them, and Parikh and Boyd [64] for a survey of proximal algorithms in particular.”
MethodSelf-citationMonotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559 · cited 2×
“Another variation replaces the subspace projection update with a suitable approximation [21,30,68].”
BackgroundMethodEckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791 · cited 4×
“Another variation replaces the subspace projection update with a suitable approximation [21,30,68].”
BackgroundMethodInfluentialSignal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodA dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514 · cited 1×
“Operator splitting techniques go back to the 1950s; ADMM itself was developed in the mid1970s [4,5].”
BackgroundApplications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Self-citationProximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodSplitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972 · cited 1×
“It was shown in [6] that ADMM is equivalent to the variant of Douglas-Rachford splitting presented in [26] (the original, more restrictive, form of Douglas-Rachford splitting was presented in [29]) applied to the dual problem, which itself is equivalent to Rockafellar’s proximal point algorithm [21,30].”
MethodSDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894 · cited 8×
“In the largest case, SCS takes less than 4 minutes compared to nearly 3 days for SDPT3 and Sedumi.”
ResultInfluentialOn the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Numerical Methods for Nonlinear Variational Problems
Glowinski, R. (1984) · Springer eBooks · doi:10.1007/978-3-662-12613-4 · Cited by 1,728
Nickolls, J., Buck, I., Garland, M., & Skadron, K. (2008) · Queue · doi:10.1145/1365490.1365500 · Cited by 1,610
(2008) · doi:10.1145/1401132.1401152 · Cited by 1,575 · cited 1×
“The GPU version uses the sparse CUDA BLAS library [94].”
MethodNumerical Methods for Nonlinear Variational Problems
Glowinski, R., & Oden, J. T. (1985) · Journal of Applied Mechanics · doi:10.1115/1.3169136 · Cited by 1,541 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundDirect Methods for Sparse Linear Systems
Davis, T. A. (2006) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718881 · Cited by 1,443 · cited 2×
“The direct implementation uses a single-threaded sparse permuted LDL decomposition from the SuiteSparse package [73, 91, 92].”
MethodA multiprojection algorithm using Bregman projections in a product space
Censor, Y., & Elfving, T. (1994) · Numerical Algorithms · doi:10.1007/bf02142692 · Cited by 1,392 · cited 1×
“There are many projection algorithms that could be used to solve this kind of problem, such as the classical alternating directions method or Dykstra’s alternating projections method [16,17], amongst others [18,19].”
MethodAlternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodGlowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105 · cited 1×
“Operator splitting techniques go back to the 1950s; ADMM itself was developed in the mid1970s [4,5].”
BackgroundIterative oblique projection onto convex sets and the split feasibility problem
Byrne, C. L. (2002) · Inverse Problems · doi:10.1088/0266-5611/18/2/310 · Cited by 1,057 · cited 1×
“There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodAugmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics
Glowinski, R., & Tallec, P. L. (1989) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970838 · Cited by 1,015 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundAugmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics.
Oden, J. T., Glowinski, R., & Tallec, P. L. (1992) · Mathematics of Computation · doi:10.2307/2153048 · Cited by 972
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881 · cited 1×
“(It may not be suitable if high accuracy is required, due to the slow ‘tail convergence’ of first order methods in general, and ADMM in particular [9].”
BackgroundAugmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
(1983) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(08)x7003-1 · Cited by 760 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundEsser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695 · cited 1×
“[63] for a detailed discussion of various first-order methods and the relationships between them, and Parikh and Boyd [64] for a survey of proximal algorithms in particular.”
MethodSDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
Adaptive Restart for Accelerated Gradient Schemes
O’Donoghue, B., & Candès, E. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9150-3 · Cited by 642 · cited 1×
“’ There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodSelf-citationTemplates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608 · cited 1×
“’ There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodA Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodThe Convex Feasibility Problem in Image Recovery
Combettes, P. L. (1996) · Advances in Imaging and Electron Physics · doi:10.1016/s1076-5670(08)70157-5 · Cited by 490 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodCVXPY: A Python-Embedded Modeling Language for Convex Optimization
Diamond, S., & Boyd, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.00943 · Cited by 462 · cited 3×
“It is now the default solver for CVXPY and Convex.jl for problems that cannot be expressed using the standard symmetric cones.”
MethodSelf-citation1Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Lin, F., Fardad, M., & Jovanović, M. R. (2016) · Cited by 447
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
Gabay, D. (1983) · Studies in mathematics and its applications · doi:10.1016/s0168-2024(08)70034-1 · Cited by 422 · cited 1×
“It was shown in [6] that ADMM is equivalent to the variant of Douglas-Rachford splitting presented in [26] (the original, more restrictive, form of Douglas-Rachford splitting was presented in [29]) applied to the dual problem, which itself is equivalent to Rockafellar’s proximal point algorithm [21,30].”
MethodKomodakis, N., & Pesquet, J.-C. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2377273 · Cited by 419 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundA Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Boyle, J. P., & Dykstra, R. L. (1986) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-9940-7_3 · Cited by 415 · cited 1×
“There are many projection algorithms that could be used to solve this kind of problem, such as the classical alternating directions method or Dykstra’s alternating projections method [16,17], amongst others [18,19].”
MethodA NEWTON-CG AUGMENTED LAGRANGIAN METHOD FOR SEMIDEFINITE PROGRAMMING
Toh, K. C., Zhao, X., & Sun, D. (2008) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 401
Diagonal preconditioning for first order primal-dual algorithms in convex optimization
Pock, T., & Chambolle, A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126441 · Cited by 393 · cited 1×
“The scaling parameters E, D, σ, and ρ can be chosen to (approximately) achieve this [64,68,71], though the question of whether there is an optimal scaling remains open.”
BackgroundDesign of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Lin, F., Fardad, M., & Jovanovic, M. R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2257618 · Cited by 385 · cited 1×
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodCombettes, P. L., & Pesquet, J.-C. (2011) · Set-Valued and Variational Analysis · doi:10.1007/s11228-011-0191-y · Cited by 371 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundAlternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359 · cited 1×
“There are several different ways to apply ADMM to solve cone programs [8,13].”
MethodAn O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Ye, Y., Todd, M. J., & Mizuno, S. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.1.53 · Cited by 354 · cited 2×
“The idea of homogeneous self-dual embedding is due to Ye and others [10, 11].”
BackgroundCondition numbers and equilibration of matrices
van der Sluis, A. (1969) · Numerische Mathematik · doi:10.1007/bf02165096 · Cited by 347 · cited 1×
“, scaled to have better conditioning, admits better convergence [77–80].”
BackgroundAlgorithm 837: AMD, an approximate minimum degree ordering algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024081 · Cited by 311
An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems
Wahlberg, B., Boyd, S., Annergren, M., & Wang, Y. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120711-3-be-2027.00310 · Cited by 256 · cited 1×
“These techniques have been used in a broad range of applications including imaging [39–41], control [42–46], estimation [47], signal processing [48–51], finance [52], distributed optimization [53,54], and many others.”
BackgroundSelf-citationSplitting methods for monotone operators with applications to parallel optimization
Eckstein, J. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 250
Dynamic Network Energy Management via Proximal Message Passing
Kraning, M. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601987150 · Cited by 247
Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
Censor, Y., Motova, A., & Segal, A. (2006) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2006.05.010 · Cited by 239
Bauer, F. L. (1963) · Numerische Mathematik · doi:10.1007/bf01385880 · Cited by 237 · cited 1×
“, scaled to have better conditioning, admits better convergence [77–80].”
BackgroundSymmetric Quasidefinite Matrices
Vanderbei, R. J. (1995) · SIAM Journal on Optimization · doi:10.1137/0805005 · Cited by 202
Partial inverse of a monotone operator
Spingarn, J. E. (1983) · Applied Mathematics & Optimization · doi:10.1007/bf01448388 · Cited by 185 · cited 1×
“Douglas–Rachford splitting is also equivalent to Spingarn’s ‘method of partial inverses’ [31–33] when one of the operators is the normal cone map of a linear subspace [7,34].”
MethodDykstra′s Alternating Projection Algorithm for Two Sets
Bauschke, H. H., & Borwein, J. M. (1994) · Journal of Approximation Theory · doi:10.1006/jath.1994.1136 · Cited by 181 · cited 1×
“There are many projection algorithms that could be used to solve this kind of problem, such as the classical alternating directions method or Dykstra’s alternating projections method [16,17], amongst others [18,19].”
MethodOn Pre-Conditioning of Matrices
Osborne, E. E. (1960) · Journal of the ACM · doi:10.1145/321043.321048 · Cited by 181
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Davis, T. A. (2006) · Society for Industrial and Applied Mathematics eBooks · Cited by 180
An independent benchmarking of SDP and SOCP solvers
Mittelmann, H. D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0355-5 · Cited by 175 · cited 2×
“These stopping criteria are identical to those used by many other cone solvers and similar to those used by DIMACS [70] [71] and the SeDuMi solver [2].”
MethodA Splitting Method for Optimal Control
O'Donoghue, B., Stathopoulos, G., & Boyd, S. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2231960 · Cited by 172 · cited 1×
“5 can improve convergence, in practice [44,69].”
Self-citationCensor, Y., Chen, W., Combettes, P. L., Davidi, R., & Herman, G. T. (2012) · Computational Optimization and Applications · doi:10.1007/s10589-011-9401-7 · Cited by 159 · cited 1×
“There are many projection algorithms that could be used to solve this kind of problem, such as the classical alternating directions method or Dykstra’s alternating projections method [16,17], amongst others [18,19].”
MethodUdell, M. R., Mohan, K., Zeng, D., Hong, J., Diamond, S., & Boyd, S. (2014) · doi:10.1109/hptcdl.2014.5 · Cited by 158 · cited 1×
“jl [89], and YALMIP [90].”
Self-citationParallel alternating direction multiplier decomposition of convex programs
Eckstein, J. (1994) · Journal of Optimization Theory and Applications · doi:10.1007/bf02196592 · Cited by 152 · cited 1×
“5 can improve convergence, in practice [44,69].”
Applications of the method of partial inverses to convex programming: Decomposition
Spingarn, J. E. (1985) · Mathematical Programming · doi:10.1007/bf01586091 · Cited by 151 · cited 1×
“A similar technique to the algorithm we develop in this paper is Spingarn’s ‘method of partial inverses’ [75]; the difference being that we seek a pair of points in a cone and its dual cone rather than in a linear subspace and its orthogonal complement.”
MethodLan, G., Lu, Z., & Monteiro, R. D. C. (2009) · Mathematical Programming · doi:10.1007/s10107-008-0261-6 · Cited by 147
Block splitting for distributed optimization
Parikh, N., & Boyd, S. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0061-8 · Cited by 132 · cited 1×
“These techniques have been used in a broad range of applications including imaging [39–41], control [42–46], estimation [47], signal processing [48–51], finance [52], distributed optimization [53,54], and many others.”
BackgroundSelf-citationA simplified homogeneous and self-dual linear programming algorithm and its implementation
Xu, X., Hung, P.-F., & Yinyu Ye, Y. (1996) · Annals of Operations Research · doi:10.1007/bf02206815 · Cited by 118 · cited 1×
“The idea of homogeneous self-dual embedding is due to Ye and others [10, 11].”
BackgroundDavis, T. A. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1114268.1114277 · Cited by 109
Feedback Control of Dynamic Systems (6th edition)
Franklin, G. F., Powell, J. D., & Emami-Naeini, A. (2010) · Cited by 104
Diagonal scaling in Douglas-Rachford splitting and ADMM
Giselsson, P., & Boyd, S. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040175 · Cited by 103 · cited 1×
“There has recently been much work devoted to the question of choosing an optimal, or at least good diagonal scaling; see [83,84].”
BackgroundSelf-citationBauschke, H. H., & Koch, V. (2015) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/636/12726 · Cited by 85 · cited 1×
“For a further discussion of these and many other projection methods, see Bauschke and Koch [20].”
MethodMatrix-free interior point method
Gondzio, J. (2010) · Computational Optimization and Applications · doi:10.1007/s10589-010-9361-3 · Cited by 84 · cited 1×
“’ There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodModified Lagrangians in convex programming and their generalizations
Golʹshteĭn, E. G., & Tret’yakov, N. V. (1979) · Mathematical programming studies · doi:10.1007/bfb0120845 · Cited by 79 · cited 2×
“Another variation replaces the subspace projection update with a suitable approximation [21,30,68].”
BackgroundPrimal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
O'Connor, D., & Vandenberghe, L. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/13094671x · Cited by 78
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
Skajaa, A., & Yinyu Ye, Y. (2014) · Mathematical Programming · doi:10.1007/s10107-014-0773-1 · Cited by 74 · cited 1×
“4], Kexp = {(x, y, z) | y > 0, ye x/y ≤ z} ∪ {(x, y, z) | x ≤ 0, y = 0, z ≥ 0}, K exp = {(u, v, w) | u < 0, − ue v/u ≤ ew} ∪ {(0, v, w) | v ≥ 0, w ≥ 0}, and the power cone and its dual [45, 58,74], defined as K pwr = {(x, y, z) | x y ≥ |z|, x ≥ 0, y ≥ 0}, (K pwr) ∗ = {(u, v, w) | (−u/a)(−v/(1− a)) ≥ |w|, u ≤ 0, v ≤ 0}…”
Sparse feedback synthesis via the alternating direction method of multipliers
Lin, F., Fardad, M., & Jovanović, M. R. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315694 · Cited by 71
A Scaling Algorithm to Equilibrate Both Rows and Columns Norms in Matrices 1
Ruiz, D. (2001) · Cited by 68
Metric selection in fast dual forward–backward splitting
Giselsson, P., & Boyd, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.09.010 · Cited by 66 · cited 1×
“There has recently been much work devoted to the question of choosing an optimal, or at least good diagonal scaling; see [83,84].”
BackgroundSelf-citationDistributed ADMM for model predictive control and congestion control
Mota, J. F. C., Xavier, J., Aguiar, P. M. Q., & Püschel, M. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426141 · Cited by 64
Performance Bounds and Suboptimal Policies for Multi-Period Investment
Boyd, S., O’Donoghue, B., Mueller, M. T., & Wang, Y. (2013) · Foundations and Trends® in Optimization · doi:10.1561/2400000001 · Cited by 61 · cited 2×
“Consider a simple long-only portfolio optimization problem [52,102], [65, Sect.”
BackgroundSelf-citationSystems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
Combettes, P. L. (2013) · SIAM Journal on Optimization · doi:10.1137/130904160 · Cited by 59 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundEventual linear convergence of the Douglas-Rachford iteration for basis pursuit
Demanet, L., & Zhang, X. (2015) · Mathematics of Computation · doi:10.1090/mcom/2965 · Cited by 59 · cited 1×
“It has been observed that first-order methods can perform very well on lasso-type problems when the solution is sparse [99,100].”
MethodSelf Equivalence of the Alternating Direction Method of Multipliers
Yan, M., & Yin, W. (2016) · Scientific computation · doi:10.1007/978-3-319-41589-5_5 · Cited by 54 · cited 1×
“In [7] and [38] it was shown that equivalences exist between ADMM applied to the primal problem, the dual problem, and a saddle point formulation of the problem; in other words, ADMM is (in a sense) itself self-dual.”
BackgroundNikos Komodakis, A., & Pesquet, J.-C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.5429 · Cited by 37 · cited 1×
“Since then a rich literature has developed around ADMM and related methods [21, 24, 30, 32, 34, 36, 38, 39, 46, 50].”
BackgroundAn ADMM algorithm for solving ℓ1 regularized MPC
Annergren, M., Hansson, A., & Wahlberg, B. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426429 · Cited by 37
A primal-dual projection method for solving systems of linear inequalities
Spingarn, J. E. (1985) · Linear Algebra and its Applications · doi:10.1016/0024-3795(85)90086-2 · Cited by 29 · cited 1×
“Douglas–Rachford splitting is also equivalent to Spingarn’s ‘method of partial inverses’ [31–33] when one of the operators is the normal cone map of a linear subspace [7,34].”
MethodAn ADMM Algorithm for Solving l_1 Regularized MPCPreprint
Annergren, M., Hansson, A., & Wahlberg, B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.4070 · Cited by 24
Monteiro, R. D. C., Ortiz, C., & Svaiter, B. F. (2013) · Computational Optimization and Applications · doi:10.1007/s10589-013-9590-3 · Cited by 21 · cited 1×
“’ There are several other methods that share similar characteristics, such as [55–62], as well as some techniques for solving the split-feasibility problem [35].”
MethodTowards Nonsymmetric Conic OptimizationPreprint
Nesterov, Y. E. (2006) · SSRN Electronic Journal · doi:10.2139/ssrn.921788 · Cited by 19
An Augmented Lagrangian Method for Conic Convex ProgrammingPreprint
Aybat, N. S., & Iyengar, G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.6322 · Cited by 17 · cited 1×
“ual embeddings have generally been solved via interior-point methods, while the literature on other algorithms has generally yielded methods that cannot return certificates of infeasibility see, e.g., [3,18,37]. Second, there are different ways to apply ADMM to solve cone programs; see Boyd et al. [6] for more backgroun…”
MethodDifferential properties of Euclidean projection onto power cone
Hien, L. T. K. (2015) · Mathematical Methods of Operations Research · doi:10.1007/s00186-015-0514-0 · Cited by 17 · cited 1×
“4], Kexp = {(x, y, z) | y > 0, ye x/y ≤ z} ∪ {(x, y, z) | x ≤ 0, y = 0, z ≥ 0}, K exp = {(u, v, w) | u < 0, − ue v/u ≤ ew} ∪ {(0, v, w) | v ≥ 0, w ≥ 0}, and the power cone and its dual [45, 58,74], defined as K pwr = {(x, y, z) | x y ≥ |z|, x ≥ 0, y ≥ 0}, (K pwr) ∗ = {(u, v, w) | (−u/a)(−v/(1− a)) ≥ |w|, u ≤ 0, v ≤ 0}…”
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
Monteiro, R. D. C., Ortiz, C., & Svaiter, B. F. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0062-7 · Cited by 16
Remarks on optimally scaled matrices
Bauer, F. L. (1969) · Numerische Mathematik · doi:10.1007/bf02165268 · Cited by 15 · cited 1×
“, scaled to have better conditioning, admits better convergence [77–80].”
BackgroundSequential and parallel projection algorithms for feasibility and optimization
Censor, Y. (2001) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.441550 · Cited by 9 · cited 1×
“Also closely related is the ‘split-feasibility problem’, which seeks two points related by a linear mapping, each of which is constrained to be in a convex set [13, 15,17,18].”
BackgroundEckstein, J., & Systems., D. (1988) · Cited by 9
Self Equivalence of the Alternating Direction Method of Multipliers
Yan, M., & Yin, W. (2014) · doi:10.21236/ada610274 · Cited by 8
Bauschke, H. H., & Koch, V. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.4506 · Cited by 4 · cited 1×
“For a further discussion of these and many other projection methods, see Bauschke and Koch [20].”
Method(2015) · The Dictionary of Genomics, Transcriptomics and Proteomics · doi:10.1002/9783527678679.dg11558 · Cited by 2
Research works printed but not linked: 5
- O’Donoghue, B.: Suboptimal control policies via convex optimization. Ph.D. thesis, Stanford University (2012)
- Monteiro, R., Ortiz, C., Svaiter, B.: An inexact block-decomposition method for extra large-scale conic semidefinite programming. Optimization-online preprint 4158, 1–21 (2013)
- Franklin, G., Powell, J., Emami-Naeini, A.: Feedback Control of Dynamic Systems, vol. 3. Addison-Wesley, Reading, MA (1994)
- OpenMP Architecture Review Board: OpenMP application program interface version 3.0. http://www.openmp.org/mp-documents/spec30.pdf (2008)
- Markowitz, H.: Portfolio selection. J. Finance 7(1), 77–91 (1952)
Cited by
CVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, S., & Boyd, S. (2016) · PubMed · Cited by 1,648
Self-citationCVXPY: A Python-Embedded Modeling Language for Convex Optimization
Diamond, S., & Boyd, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.00943 · Cited by 462
“CVXPY interfaces with the open-source cone solvers CVX-OPT (Andersen et al., 2015), ECOS (Domahidi et al., 2013), and SCS (O’Donoghue et al., 2016), which are implemented in combinations of Python and C.”
MethodSelf-citationOSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
Self-citationLattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“This is achieved by automatically transforming the original problem instances into standard conic programming forms, followed by calling the advanced off-the-shelf conic solvers, e.g., MOSEK [296] and SCS [113].”
Method
Metadata
- Authors
- O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S.
- Affiliations
- Stanford University (US)
- Corresponding author
- O’Donoghue, Brendan
- Venue
- Journal of Optimization Theory and Applications
- Published
- 2016-02-22
- Volume
- 169
- Issue
- 3
- Pages
- 1042-1068
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2288174618
- Cited by
- 664
- References
- 109
- Citations by year
- 2026: 50 · 2025: 68 · 2024: 65 · 2023: 58 · 2022: 66 · 2021: 65 · 2020: 122 · 2019: 60 · 2018: 41 · 2017: 35 · 2016: 28
- FWCI
- 59.04
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Journal of Optimization Theory and Applications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- Defense Advanced Research Projects Agency (FA8750-12-2-0306)
- National Science Foundation (DGE-0645962)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- conic optimization, operator splitting, alternating direction method of multipliers, first-order methods, feasibility problem, subspace projection, parameter-free method, second-order cone, large-scale optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.