Abstract
Previous article Next article On Convergence of a Random Search Method in Convex Minimization ProblemsV. G. KarmanovV. G. Karmanovhttps://doi.org/10.1137/1119084PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] V. F. Dem'yanov and , A. M. Rubinov, Approximation Methods in Optimization Problems, American Elsevier, New York, 1970 0217.46203 Google Scholar[2] V. G. Karmanov, Estimates for the convergence of iteration methods of minimization, Ž. Vyčisl. Mat. i Mat. Fiz., 14 (1974), 3–14, 266, (Journal of Computational Mathematics and Mathematical Physics), (In Russian.) MR0341865 (49:6611) Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Stochastic Three Points Method for Unconstrained Smooth MinimizationEl Houcine Bergou, Eduard Gorbunov, and Peter Richtárik1 October 2020 | SIAM Journal on Optimization, Vol. 30, No. 4AbstractPDF (985 KB)Optimization of Convex Functions with Random PursuitS. U. Stich, C. L. Müller, and B. Gärtner27 June 2013 | SIAM Journal on Optimization, Vol. 23, No. 2AbstractPDF (523 KB)Line search algorithms for adaptive filteringIEEE Transactions on Signal Processing, Vol. 41, No. 7 Cross Ref Volume 19, Issue 4| 1975Theory of Probability & Its Applications History Submitted:20 December 1973Published online:28 July 2006 InformationCopyright © 1975 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1119084Article page range:pp. 788-794ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
