Numerical solution of huge-scale quasiseparable optimization problems


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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 1010 variables are presented.

About the authors

A. N. Andrianov

Keldysh Institute of Applied Mathematics of Russian Academy of Sciences

Author for correspondence.
Email: and@a5.kiam.ru
Russian Federation, Moscow, 125047

A. S. Anikin

Matrosov Institute for System Dynamics and Control Theory, Siberian Branch

Email: and@a5.kiam.ru
Russian Federation, Irkutsk, 664033

I. V. Bychkov

Matrosov Institute for System Dynamics and Control Theory, Siberian Branch

Email: and@a5.kiam.ru
Russian Federation, Irkutsk, 664033

A. Yu. Gornov

Matrosov Institute for System Dynamics and Control Theory, Siberian Branch

Email: and@a5.kiam.ru
Russian Federation, Irkutsk, 664033


Copyright (c) 2017 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies