Asynchronous gradient algorithms for a class of convex separable network flow problems

被引：0

|

作者：

LAAS du CNRS, Toulouse, France ^{[1
]}

机构：

来源：

Comput Optim Appl | / 3卷 / 187-205期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

32

引用

收藏

相关论文

共 50 条

[21] Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost
F. Guerriero
P. Tseng
Journal of Optimization Theory and Applications, 2002, 115 : 113 - 144
[22] Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
Guerriero, F
Tseng, P
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2002, 115 (01) : 113 - 144
[23] A survey of algorithms for convex multicommodity flow problems
Ouorou, A
Mahey, P
Vial, JP
MANAGEMENT SCIENCE, 2000, 46 (01) : 126 - 147
[24] A conic quadratic formulation for a class of convex congestion functions in network flow problems
Gurel, Sinan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) : 252 - 262
[25] Path-following gradient-based decomposition algorithms for separable convex optimization
Quoc Tran Dinh
Necoara, Ion
Diehl, Moritz
JOURNAL OF GLOBAL OPTIMIZATION, 2014, 59 (01) : 59 - 80
[26] Path-following gradient-based decomposition algorithms for separable convex optimization
Quoc Tran Dinh
Ion Necoara
Moritz Diehl
Journal of Global Optimization, 2014, 59 : 59 - 80
[27] On an optimal flow in a class of nilpotent convex problems
Lokutsievskiy, L. V.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2015, 291 (01) : 146 - 169
[28] On an optimal flow in a class of nilpotent convex problems
L. V. Lokutsievskiy
Proceedings of the Steklov Institute of Mathematics, 2015, 291 : 146 - 169
[29] A class of ADMM-based algorithms for three-block separable convex programming
He, Bingsheng
Yuan, Xiaoming
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 70 (03) : 791 - 826
[30] A class of ADMM-based algorithms for three-block separable convex programming
Bingsheng He
Xiaoming Yuan
Computational Optimization and Applications, 2018, 70 : 791 - 826

← 1 2 3 4 5 →