Method of conjugate subgradients with constrained memory

E. A. Nurminskii, David Tien

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A method to solve the convex problems of nondifferentiable optimization relying on the basic philosophy of the method of conjugate gradients and coinciding with it in the case of quadratic functions was presented. Its basic distinction from the earlier counterparts lies in the a priori fixed constraint on the memory size which is independent of the accuracy of the resulting solution. Numerical experiments suggest practically linear rate of convergence of this algorithm.
Original languageEnglish
Pages (from-to)646-656
Number of pages11
JournalAutomation and Remote Control
Volume75
Issue number4
DOIs
Publication statusPublished - Apr 2014

Fingerprint Dive into the research topics of 'Method of conjugate subgradients with constrained memory'. Together they form a unique fingerprint.

  • Cite this