Numerical solution of huge-scale quasiseparable optimization problems

DOI10.1134/S1995080217050031MaRDI QIDQ1682811zbMATHOpenAlexFDO

Authors A. N. Andrianov, Anton S. Anikin, I. V. Bychkov, Alexander Yu. Gornov

Publication date 6 December 2017

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995080217050031

zbMATH Keywords

Barzilai-Borwein methodparallel computinghuge-scale optimizationPolyak methodquasiseparable optimization problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 3843081
• scientific article; zbMATH DE number 1069181
• Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization
• Numerical study of high-dimensional optimization problems using a modification of Polyak's method
• scientific article; zbMATH DE number 2202887

Cites work

• Introductory lectures on convex optimization. A basic course.
• Minimization of unsmooth functionals
• Two-Point Step Size Gradient Methods

Cited in

(3)

• An interior point method and Sherman-Morrison formula for solving large scale convex quadratic problems with diagonal Hessians
• Modification of the confidence bar algorithm based on approximations of the main diagonal of the Hessian matrix for solving optimal control problems
• Numerical study of high-dimensional optimization problems using a modification of Polyak's method

Describes a project that uses

Uses Software

• MPI

This page was built for publication: Numerical solution of huge-scale quasiseparable optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682811)