Numerical study of high-dimensional optimization problems using a modification of Polyak's method

DOI10.1134/S0965542521070034zbMATH Open1476.90236OpenAlexW3194202758MaRDI QIDQ2048784FDOQ2048784

Authors: Alexander Yu. Gornov, A. N. Andrianov, Anton S. Anikin 

Publication date: 24 August 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

Recommendations

• Numerical solution of huge-scale quasiseparable optimization problems
• scientific article; zbMATH DE number 704195
• scientific article; zbMATH DE number 3843081
• Method of orthogonal simplexes and its applications to convex programming
• scientific article; zbMATH DE number 2102650

zbMATH Keywords

convex optimizationhigh-dimensional problemsPolyak's method

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Title not available (Why is that?)
• Subgradient methods for huge-scale optimization problems
• Minimization of unsmooth functionals
• Numerical methods for solving terminal optimal control problems

Cited In (1)

• Numerical solution of huge-scale quasiseparable optimization problems

This page was built for publication: Numerical study of high-dimensional optimization problems using a modification of Polyak's method

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