Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Numerical solution of huge-scale quasiseparable optimization problems

From MaRDI portal
Publication:1682811
Jump to:navigation, search

DOI10.1134/S1995080217050031zbMath1397.90306OpenAlexW2754546476MaRDI QIDQ1682811

I. V. Bychkov, Anton S. Anikin, A. N. Andrianov, 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

parallel computingBarzilai-Borwein methodhuge-scale optimizationPolyak methodquasiseparable optimization problems


Mathematics Subject Classification ID

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


Related Items (1)

Modification of the confidence bar algorithm based on approximations of the main diagonal of the Hessian matrix for solving optimal control problems


Uses Software

  • MPI


Cites Work

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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1682811&oldid=13996992"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki