<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Armijo Condition and Backtracking Algorithm</title><link>http://www.bing.com:80/search?q=Armijo+Condition+and+Backtracking+Algorithm</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Armijo Condition and Backtracking Algorithm</title><link>http://www.bing.com:80/search?q=Armijo+Condition+and+Backtracking+Algorithm</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>凸优化： 梯度下降、回溯线搜索（Backtracking line search）</title><link>https://zhuanlan.zhihu.com/p/590013413</link><description>梯度下降方法算法如下： 上述两个算法采用线搜索或回溯线搜索（Backtracking line search）来选择搜索的步长。 2 线搜索（Line search） 线搜索方法先找一个下降方向（沿此下降方向时目标函数f (x)的值减小），然后计算步长来决定x沿着下降方向移动多远。</description><pubDate>Thu, 02 Apr 2026 01:35:00 GMT</pubDate></item><item><title>Armijo Line-search Makes (Stochastic) Gradient Descent Go Fast</title><link>https://arxiv.org/html/2503.00229v1</link><description>Backtracking Armijo line-search (Armijo, 1966; Nocedal &amp; Wright, 2006) (referred to as Armijo-LS) is a standard method to set the step-size for gradient descent. Given an initial step-size, the simplest form of Armijo-LS “searches” for the largest step-size that guarantees a sufficient decrease in the function value.</description><pubDate>Thu, 12 Mar 2026 14:32:00 GMT</pubDate></item><item><title>GitHub - smrfeld/line_search_tutorial: Tutorial of Armijo backtracking ...</title><link>https://github.com/smrfeld/line_search_tutorial</link><description>Tutorial of Armijo backtracking line search for Newton method in Python You can read this story on Medium here.</description><pubDate>Wed, 01 Apr 2026 17:28:00 GMT</pubDate></item><item><title>Efficient solvers for Armijo's backtracking problem</title><link>https://arxiv.org/abs/2110.14072</link><description>Backtracking is an inexact line search procedure that selects the first value in a sequence x0,x0β,x0β2... that satisfies g(x) ≤ 0 on R+ with g(x) ≤ 0 iff x ≤ x∗. This procedure is widely used in descent direction optimization algorithms with Armijo-type conditions. It both returns an estimate in (βx∗,x∗] and enjoys an upper-bound ⌈logβ ϵ/x0⌉ on the number of function ...</description><pubDate>Mon, 01 Dec 2025 17:21:00 GMT</pubDate></item><item><title>Linear Search Optimization through the Armijo Rule Method</title><link>https://www.m-hikari.com/ces/ces2018/ces13-16-2018/p/cardenasCES13-16-2018-2.pdf</link><description>This paper shows the development of the minimization method in a variable called \Armijo Rule", a method that goes into the selected denomination of line search methods. The intermediate sections show the optimization methods based on direct search and search with de-scent directions in such a way that the reader has enough information to choose one method or another depending on their ...</description><pubDate>Wed, 01 Apr 2026 20:27:00 GMT</pubDate></item><item><title>最优化方法6——线搜索算法 - 知乎</title><link>https://zhuanlan.zhihu.com/p/651901246</link><description>Image 但是仅仅使用Armijo准则并不能保证迭代的收敛性，这是因为 \alpha=0 显然满足条件，而这意味着迭代序列中的点固定不变，研究这样的步长是没有意义的。 因此 Armijo准则需要配合其他准则共同使用。</description><pubDate>Thu, 02 Apr 2026 17:56:00 GMT</pubDate></item><item><title>optimization - Backtracking-Armijo Line Search Algorithm ...</title><link>https://scicomp.stackexchange.com/questions/26330/backtracking-armijo-line-search-algorithm</link><description>Backtracking-Armijo Line Search Algorithm Ask Question Asked 9 years ago Modified 9 years ago</description><pubDate>Thu, 02 Apr 2026 06:36:00 GMT</pubDate></item><item><title>最优化理论——线搜索技术·Armijo准则 - CSDN博客</title><link>https://blog.csdn.net/qq_47326711/article/details/118075514</link><description>最优化理论——线搜索技术·Armijo准则 算法思想 算法步骤 代码 示例</description><pubDate>Fri, 03 Apr 2026 00:29:00 GMT</pubDate></item><item><title>Backtracking Armijo-Type - File Exchange - MATLAB Central</title><link>https://www.mathworks.com/matlabcentral/fileexchange/45572-backtracking-armijo-type</link><description>In (unconstrained) optimization, the backtracking linesearch strategy is used as part of a line search method, to compute how far one should move along a given search direction. It's an advanced strategy with respect to classic Armijo method.</description><pubDate>Fri, 27 Mar 2026 15:47:00 GMT</pubDate></item><item><title>Inexact Line Search - fmin.xyz</title><link>https://fmin.xyz/docs/methods/line_search/inexact.html</link><description>4 Backtracking Line Search Backtracking line search is a technique to find a step size that satisfies the Armijo condition, Goldstein conditions, or other criteria of inexact line search.</description><pubDate>Thu, 13 Nov 2025 04:21:00 GMT</pubDate></item></channel></rss>