Path-following gradient-based decomposition algorithms for separable convex optimization
暂无分享,去创建一个
[1] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[2] Stephen P. Boyd,et al. Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.
[3] Bingsheng He,et al. Alternating directions based contraction method for generally separable linearly constrained convex programming problems , 2009 .
[4] Martin J. Wainwright,et al. Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling , 2010, IEEE Transactions on Automatic Control.
[5] Yurii Nesterov,et al. Optimizing the Spectral Radius , 2013, SIAM J. Matrix Anal. Appl..
[6] Daniel Pérez Palomar,et al. A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.
[7] Abdelouahed Hamdi,et al. Decomposition Methods Based on Augmented Lagrangians: A Survey , 2011 .
[8] Marc Teboulle,et al. A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..
[9] Yurii Nesterov,et al. Smooth minimization of non-smooth functions , 2005, Math. Program..
[10] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[11] Philippe Mahey,et al. Accelerating convergence of a Separable Augmented Lagrangian Algorithm , 2007 .
[12] Nimrod Megiddo,et al. Horizontal and vertical decomposition in interior point methods for linear programs , 1994 .
[13] J. Suykens,et al. An Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization , 2013, 1302.3136.
[14] Gongyun Zhao,et al. A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming , 2005, Math. Program..
[15] Dinh Quoc Tran,et al. Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems , 2011, Comput. Optim. Appl..
[16] Yurii Nesterov,et al. Barrier subgradient method , 2011, Math. Program..
[17] Asuman E. Ozdaglar,et al. Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.
[18] Andrzej Ruszczynski,et al. On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization , 1995, Math. Oper. Res..
[19] Dinh Quoc Tran,et al. An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization , 2011, SIAM J. Optim..
[20] Johan A. K. Suykens,et al. Application of a Smoothing Technique to Decomposition in Convex Optimization , 2008, IEEE Transactions on Automatic Control.
[21] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[22] Abdelouahed Hamdi,et al. Two-level primal-dual proximal decomposition technique to solve large scale optimization problems , 2005, Appl. Math. Comput..
[23] Yurii Nesterov,et al. Correlation between Two Projected Matrices Under Isometry Constraints , 2005 .
[24] Johan A. K. Suykens,et al. Distributed nonlinear optimal control using sequential convex programming and smoothing techniques , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.
[25] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[26] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.