Fetching the paper…
Reading the bibliography…
We employ chordal decomposition to reformulate a large and sparse semidefinite program (SDP), either in primal or dual standard form, into an equivalent SDP with smaller positive semidefinite (PSD) constraints.
Revue française d’automatique, informatique, recherche opérationnelle. Analyse numérique 9
Glowinski, R., Marroco, A.: 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 · 1975
Earlier work this paper cites.
Comput. Math. Appl. 2
Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation · 1976
Earlier work this paper cites.
SIAM J. Algebraic Discrete Methods 2
Yannakakis, M.: Computing the minimum fill-in is NP-complete · 1981
Earlier work this paper cites.
Math. Program. 28
Griewank, A., Toint, P.L.: On the existence of convex decompositions of partially separable functions · 1984
Earlier work this paper cites.
Linear Algebra Appl. 58
Grone, R., Johnson, C.R., Sá, E.M., Wolkowicz, H.: Positive definite completions of partial hermitian matrices · 1984
Earlier work this paper cites.
SIAM J. Comput. 13
Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs · 1984
Earlier work this paper cites.
Linear Algebra Appl. 107
Agler, J., Helton, W., McCullough, S., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern · 1988
Earlier work this paper cites.
In: Graph theory and sparse matrix computation, pp. 1–29. Springer (1993)
Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees · 1993
Earlier work this paper cites.
SIAM (1994)
Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory · 1994
Earlier work this paper cites.
Math. Oper. Res. 19
Ye, Y., Todd, M.J., Mizuno, S.: An 𝒪 n l \mathcal{O}\sqrt{n}l -iteration homogeneous and self-dual linear programming algorithm · 1994
Earlier work this paper cites.
SIAM J. Optim. 6
Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming · 1996
Earlier work this paper cites.
SIAM Review 38
Vandenberghe, L., Boyd, S.: Semidefinite programming · 1996
Earlier work this paper cites.
SIAM J. Optim. 8
Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results · 1998
Earlier work this paper cites.
Optim. Methods Softw. 11
Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems · 1999
Earlier work this paper cites.
Optim. Methods Softw. 11
Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones · 1999
Earlier work this paper cites.
SIAM J. Optim. 11
Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: General framework · 2001
Earlier work this paper cites.
SIAM J. Optim. 14
Burer, S.: Semidefinite programming in the space of partial positive semidefinite matrices · 2003
Earlier work this paper cites.
SIAM (2003)
Saad, Y.: Iterative methods for sparse linear systems · 2003
Earlier work this paper cites.
Cambridge University Press (2004)
Boyd, S., Vandenberghe, L.: Convex optimization · 2004
Cited alongside, same era.
In: IEEE Int. Symp. Comput. Aided Control Sys. Des., pp. 284–289. IEEE (2004)
Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB · 2004
Cited alongside, same era.
SIAM (2006)
Davis, T.: Direct Methods for Sparse Linear Systems · 2006
Cited alongside, same era.
Tech. rep., Research Report B-453, Tokyo Institute of Technology, Tokyo 152-8552, Japan (2009)
Fujisawa, K., Kim, S., Kojima, M., Okamoto, Y., Yamashita, M.: User’s manual for SparseCoLO: Conversion methods for sparse conic-form linear optimization problems · 2009
Cited alongside, same era.
SIAM J. Optim. 20
Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming · 2009
Cited alongside, same era.
Math. Program. Comput. 2
Andersen, M.S., Dahl, J., Vandenberghe, L.: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones · 2010
In: Proc. American Control Conf., pp. 4324–4329. IEEE (2014)
Raghunathan, A.U., Di Cairano, S.: Alternating direction method of multipliers for strictly convex quadratic programs: Optimal parameter selection · 2014
Later among the works it cites.
SIAM J. Optim. 24
Sun, Y., Andersen, M.S., Vandenberghe, L.: Decomposition in conic optimization with partially separable structure · 2014
Later among the works it cites.
Found. Trends® Optim. 1
Vandenberghe, L., Andersen, M.S.: Chordal graphs and semidefinite optimization · 2014
Later among the works it cites.
IEEE Trans. Automat. Contr. 60
Ghadimi, E., Teixeira, A., Shames, I., Johansson, M.: Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems · 2015
Later among the works it cites.
In: Proc. 54th IEEE Conf. Decis. Control, pp. 1742–1749 (2015)
Kalbat, A., Lavaei, J.: A fast distributed algorithm for decomposable semidefinite programs · 2015
Later among the works it cites.
In: Proc. 54th IEEE Conf. Decis. Control, pp. 5932–5939 (2015)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Linear Algebra Appl. 433
Kakimura, N.: A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices · 2010
Cited alongside, same era.
Math. Program. Comput. 2
Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented lagrangian methods for semidefinite programming · 2010
Cited alongside, same era.
SIAM J. Optim. 20
Zhao, X.Y., Sun, D., Toh, K.C.: A newton-cg augmented lagrangian method for semidefinite programming · 2010
Cited alongside, same era.
In: Optimization for machine learning, pp. 55–83. MIT Press (2011)
Andersen, M., Dahl, J., Liu, Z., Vandenberghe, L.: Interior-point methods for large-scale cone programming · 2011
Cited alongside, same era.
Found. Trends® Mach. Learn. 3
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers · 2011
Cited alongside, same era.
ACM Trans. Math. Softw. 38
Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection · 2011
Cited alongside, same era.
Madani, R., Kalbat, A., Lavaei, J.: ADMM for sparse semidefinite programming with applications to optimal power flow problem · 2015
Later among the works it cites.
SIAM J. Matrix Anal. Appl. 36
Sun, Y., Vandenberghe, L.: Decomposition methods for sparse matrix nearness problems · 2015
Later among the works it cites.
arXiv preprint arXiv:1609.05920 (2016)
Fält, M., Giselsson, P.: Line search for generalized alternating projections · 2016
Later among the works it cites.
J. Optim. Theory Appl. 169
O’Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding · 2016
Later among the works it cites.
https://github.com/cvxgrp/scs (2016)
O’Donoghue, B., Chu, E., Parikh, N., Boyd, S.: SCS: Splitting conic solver, version 1.2.6 · 2016
Later among the works it cites.
arXiv preprint arXiv:1609.06955 (2016)
Themelis, A., Patrinos, P.: SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators · 2016
Later among the works it cites.
In: Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 165–194. Springer (2016)
Yan, M., Yin, W.: Self equivalence of the alternating direction method of multipliers · 2016
Later among the works it cites.
optimization-online.org (2017)
Banjac, G., Goulart, P., Stellato, B., Boyd, S.: Infeasibility detection in the alternating direction method of multipliers for convex optimization · 2017
Closest in time.
arXiv preprint arXiv:1706.02374 (2017)
Liu, Y., Ryu, E.K., Yin, W.: A new use of douglas-rachford splitting and ADMM for identifying infeasible, unbounded, and pathological conic programs · 2017
Closest in time.
IEEE Control Systems Letters 1
Zheng, Y., Fantuzzi, G., Papachristodoulou, A.: Exploiting sparsity in the coefficient matching conditions in Sum-of-Squares programming using ADMM · 2017
Closest in time.
IFAC PapersOnLine 50
Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Fast ADMM for homogeneous self-dual embedding of sparse SDPs · 2017
Closest in time.
In: Proc. American Control Conf., pp. 3335–3340. IEEE (2017)
Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Fast ADMM for semidefinite programs with chordal sparsity · 2017
Closest in time.