Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Guzm��n, Crist��bal"'
We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answer is negative for both deterministic and randomized a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2f5b9119b5a35b55d8f04d9cb2aaac1
http://arxiv.org/abs/1811.01903
http://arxiv.org/abs/1811.01903
We formulate an affine invariant implementation of the accelerated first-order algorithm in Nesterov (1983). Its complexity bound is proportional to an affine invariant regularity constant defined with respect to the Minkowski gauge of the feasible s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::265c055abcec8e90142c5f5acac76828
https://hal.archives-ouvertes.fr/hal-00907547
https://hal.archives-ouvertes.fr/hal-00907547