Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2014, Issue 4, Pages 67–80 (Mi at7532)  
This article is cited in 11 scientific papers (total in 11 papers)

Mathematical programming problems

Method of conjugate subgradients with constrained memory

E. A. Nurminskiiab, D. Tienc

a Institute of Automation and Control Processes, Far-Eastern Branch, Russian Academy of Sciences, Vladivostok, Russia
b Far-Eastern Federal University, Vladivostok, Russia
c Charles Stuart University, Bathurst, Australia
Full-text PDF (518 kB) Citations (11)
References:
PDF
HTML
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.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 14.11.2013
English version:
Automation and Remote Control, 2014, Volume 75, Issue 4, Pages 646–656
DOI: https://doi.org/10.1134/S0005117914040055
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: E. A. Nurminskii, D. Tien, “Method of conjugate subgradients with constrained memory”, Avtomat. i Telemekh., 2014, no. 4, 67–80; Autom. Remote Control, 75:4 (2014), 646–656
Citation in format AMSBIB
\Bibitem{NurTie14}
\by E.~A.~Nurminskii, D.~Tien
\paper Method of conjugate subgradients with constrained memory
\jour Avtomat. i Telemekh.
\yr 2014
\issue 4
\pages 67--80
\mathnet{http://mi.mathnet.ru/at7532}
\transl
\jour Autom. Remote Control
\yr 2014
\vol 75
\issue 4
\pages 646--656
\crossref{https://doi.org/10.1134/S0005117914040055}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000334423100005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84899550452}
Linking options:
  • https://www.mathnet.ru/eng/at7532
  • https://www.mathnet.ru/eng/at/y2014/i4/p67
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:243
    Full-text PDF :65
    References:42
    First page:21
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024