Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Michael D. Grigoriadis"'
Autor:
Michael D. Grigoriadis, Giorgio Gallo
Publikováno v:
Mathematical Programming. 78:105-108
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ed275d8fa0aae62cd55292a01863610
https://doi.org/10.1007/bf02614364
https://doi.org/10.1007/bf02614364
Publikováno v:
Mathematical Programming. 75:477-482
We show that an e-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(ɛ −2+logGK) logGM log (Gɛ −1 GK)) single-commodity minimum-cost flow problems on the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a2e3b3c9129e1b70d1e2e67014109a7
https://doi.org/10.1007/bf02592195
https://doi.org/10.1007/bf02592195
Publikováno v:
SIAM Journal on Optimization. 6:913-932
This paper presents an interior point method for solving a bordered block-diagonal linear program which consists of a number of disjoint blocks coupled by a total of $p$ variables and constraints. This structure includes the well-known block-angular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::468328da4e843d59d41c329082b95bca
https://doi.org/10.1137/s1052623494263609
https://doi.org/10.1137/s1052623494263609
Publikováno v:
Mathematics of Operations Research. 21:321-340
The general block-angular convex resource sharing problem in K blocks and M nonnegative block-separable coupling constraints is considered. Applications of this model are in combinatorial optimization, network flows, scheduling, communication network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1be388f756ee518088d5e3dd2123ff57
https://doi.org/10.1287/moor.21.2.321
https://doi.org/10.1287/moor.21.2.321
Publikováno v:
Networks. 26:59-68
An exponential potential-function reduction algorithm for convex block-angular optimization problems is described. These problems are characterized by K disjoint convex compact sets called blocks and M non-negative-valued convex block-separable coupl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b1e8d44092a6c892ad47f5ab1a6e5d7
https://doi.org/10.1002/net.3230260202
https://doi.org/10.1002/net.3230260202
Publikováno v:
Operations Research Letters. 18:53-58
This paper presents a parallel randomized algorithm which computes a pair of @e-optimal strategies for a given (m,n)-matrix game A = [a"i"j] @e [-1, 1] in O(@e^-^2log^2(n+m)) expected time on an (n+m)/log(n+m)-processor EREW PRAM. For any fixed accur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95b2775223c848c52c810a7c2970d7fc
https://doi.org/10.1016/0167-6377(95)00032-0
https://doi.org/10.1016/0167-6377(95)00032-0
Publikováno v:
SIAM Journal on Optimization. 4:86-107
This paper presents block-coordinate descent algorithms for the approximate solution of large structured convex programming problems. The constraints of such problems consist of K disjoint convex compact sets $B^k $ called blocks, and M nonnegative-v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a99d2e0b43aeafd0affb76d636c33730
https://doi.org/10.1137/0804004
https://doi.org/10.1137/0804004
Publikováno v:
Mathematical Programming. 50:277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n 2 m) time. In this paper we describe how to extend the dynamic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10779d91df7daaf59dd500eb984413a7
https://doi.org/10.1007/bf01594940
https://doi.org/10.1007/bf01594940
Publikováno v:
SIAM JOURNAL ON OPTIMIZATION
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an $\varepsilon$-approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B. We s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b5776cd4af24a40b01e6e32f11f6d0c
Publikováno v:
Applied Mathematics and Parallel Computing ISBN: 9783642997914
A uniform randomized exponential-potential block-coordinate descent method for the approximate solution of block-angular convex resource-sharing programs was analyzed in [5] and for the linear case in [14]. The former method is rendered deterministic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b388483d5a6226d3f906655a1dec9142
https://doi.org/10.1007/978-3-642-99789-1_25
https://doi.org/10.1007/978-3-642-99789-1_25