Numerical solution of huge-scale quasiseparable optimization problems

A. N. Andrianov; A. S. Anikin; I. V. Bychkov; A. Yu. Gornov

doi:10.1134/S1995080217050031

Numerical solution of huge-scale quasiseparable optimization problems

作者: Andrianov A.N.¹, Anikin A.S.², Bychkov I.V.², Gornov A.Y.²
隶属关系:
1. Keldysh Institute of Applied Mathematics of Russian Academy of Sciences
2. Matrosov Institute for System Dynamics and Control Theory, Siberian Branch
期: 卷 38, 编号 5 (2017)
页面: 870-873
栏目: Article
URL: https://bakhtiniada.ru/1995-0802/article/view/199906
DOI: https://doi.org/10.1134/S1995080217050031
ID: 199906

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

详细
作者简介
参考
补充文件
统计

详细

The paper studies approaches to numerical solving huge-scale quasiseparable optimization problems. The main idea is based on using gradient methods with simple iteration structure instead more intelligent techniques, which is widely used for solving traditional, small-sized problems. The results of numerical experiments for a number of test quasiseparable optimization problems with dimensions up to 10¹⁰ variables are presented.