当前位置：
X-MOL 学术
›
Optim. Methods Softw.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods
Optimization Methods & Software ( IF 2.2 ) Pub Date : 2024-02-05 , DOI: 10.1080/10556788.2023.2296443 Pavel Dvurechensky 1 , Petr Ostroukhov 2, 3, 4 , Alexander Gasnikov 2, 3, 5 , César A. Uribe 6 , Anastasiya Ivanova 7, 8
Optimization Methods & Software ( IF 2.2 ) Pub Date : 2024-02-05 , DOI: 10.1080/10556788.2023.2296443 Pavel Dvurechensky 1 , Petr Ostroukhov 2, 3, 4 , Alexander Gasnikov 2, 3, 5 , César A. Uribe 6 , Anastasiya Ivanova 7, 8
Affiliation
Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective has Lipschitz pth...
中文翻译：
用于最小化凸函数梯度范数的近最优张量方法和加速原对偶张量方法
特别是受熵正则化最优传输问题的推动，我们考虑具有线性等式约束的凸优化问题，其中双目标具有 Lipschitz pth...
更新日期：2024-02-05
中文翻译：
用于最小化凸函数梯度范数的近最优张量方法和加速原对偶张量方法
特别是受熵正则化最优传输问题的推动，我们考虑具有线性等式约束的凸优化问题，其中双目标具有 Lipschitz pth...
京公网安备 11010802027423号