<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>
	「[原创] 再谈 梯度下降法/最速下降法/Gradient descent/Steepest Descent」的评论	</title>
	<atom:link href="https://www.codelast.com/%E5%8E%9F%E5%88%9B-%E5%86%8D%E8%B0%88-%E6%9C%80%E9%80%9F%E4%B8%8B%E9%99%8D%E6%B3%95%E6%A2%AF%E5%BA%A6%E6%B3%95steepest-descent/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/</link>
	<description>最优化之路</description>
	<lastBuildDate>Fri, 08 Oct 2021 13:25:08 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>
	<item>
		<title>
		评论者：realityTracer		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-10422</link>

		<dc:creator><![CDATA[realityTracer]]></dc:creator>
		<pubDate>Fri, 08 Oct 2021 13:25:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-10422</guid>

					<description><![CDATA[”在最优化算法中，精确的line search满足一个一阶必要条件“这里的措辞不对，您估计将梯度和切向量混淆了，在GD中任何情况下，搜索方向d总是与反梯度一致，因此d总是与梯度处的切线垂直。]]></description>
			<content:encoded><![CDATA[<p>”在最优化算法中，精确的line search满足一个一阶必要条件“这里的措辞不对，您估计将梯度和切向量混淆了，在GD中任何情况下，搜索方向d总是与反梯度一致，因此d总是与梯度处的切线垂直。</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：learnhard		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6687</link>

		<dc:creator><![CDATA[learnhard]]></dc:creator>
		<pubDate>Mon, 19 Aug 2019 15:52:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-6687</guid>

					<description><![CDATA[回复给 &lt;a href=&quot;https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6685&quot;&gt;吴蔓&lt;/a&gt;。

抱歉，这图我是从网上找来的，不是我用Python画的]]></description>
			<content:encoded><![CDATA[<p>回复给 <a href="https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6685">吴蔓</a>。</p>
<p>抱歉，这图我是从网上找来的，不是我用Python画的</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：吴蔓		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6685</link>

		<dc:creator><![CDATA[吴蔓]]></dc:creator>
		<pubDate>Mon, 19 Aug 2019 09:55:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-6685</guid>

					<description><![CDATA[请问博主画rosenbrock函数的图像时如何反转x,y坐标轴的方向呀，我用python画出来x,y轴方向和你是反的，可以我觉得你这样更易于观看]]></description>
			<content:encoded><![CDATA[<p>请问博主画rosenbrock函数的图像时如何反转x,y坐标轴的方向呀，我用python画出来x,y轴方向和你是反的，可以我觉得你这样更易于观看</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：吴蔓		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6684</link>

		<dc:creator><![CDATA[吴蔓]]></dc:creator>
		<pubDate>Mon, 19 Aug 2019 09:55:22 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-6684</guid>

					<description><![CDATA[请问博主画rosenbrock函数的图像时如何反转x,y坐标轴的方向呀，我用python画出来x,y轴方向和你是反的，可以我觉得你这样更易于观看]]></description>
			<content:encoded><![CDATA[<p>请问博主画rosenbrock函数的图像时如何反转x,y坐标轴的方向呀，我用python画出来x,y轴方向和你是反的，可以我觉得你这样更易于观看</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：learnhard		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6300</link>

		<dc:creator><![CDATA[learnhard]]></dc:creator>
		<pubDate>Tue, 11 Jun 2019 11:19:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-6300</guid>

					<description><![CDATA[回复给 &lt;a href=&quot;https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6289&quot;&gt;FatherSucker&lt;/a&gt;。

感谢提醒]]></description>
			<content:encoded><![CDATA[<p>回复给 <a href="https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6289">FatherSucker</a>。</p>
<p>感谢提醒</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：FatherSucker		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-6289</link>

		<dc:creator><![CDATA[FatherSucker]]></dc:creator>
		<pubDate>Mon, 10 Jun 2019 01:41:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-6289</guid>

					<description><![CDATA[你好大神,这两天公式都挂了,如果方便的话请您检查下]]></description>
			<content:encoded><![CDATA[<p>你好大神,这两天公式都挂了,如果方便的话请您检查下</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：陈一帆		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-3597</link>

		<dc:creator><![CDATA[陈一帆]]></dc:creator>
		<pubDate>Tue, 11 Oct 2016 19:08:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-3597</guid>

					<description><![CDATA[选修了optimization的课程，由于本来这方面的知识就比较晦涩加之英文难以理解。基本将博主的几片最优化的文章看了一遍，语言通俗，让我理解了许多上课看书无法理解的东西]]></description>
			<content:encoded><![CDATA[<p>选修了optimization的课程，由于本来这方面的知识就比较晦涩加之英文难以理解。基本将博主的几片最优化的文章看了一遍，语言通俗，让我理解了许多上课看书无法理解的东西</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：游客		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-3589</link>

		<dc:creator><![CDATA[游客]]></dc:creator>
		<pubDate>Sun, 18 Sep 2016 08:04:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-3589</guid>

					<description><![CDATA[回复给 &lt;a href=&quot;https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-2326&quot;&gt;梦幻超级者&lt;/a&gt;。

谢谢楼主，写得很详细，帮助了我这种初学者。]]></description>
			<content:encoded><![CDATA[<p>回复给 <a href="https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-2326">梦幻超级者</a>。</p>
<p>谢谢楼主，写得很详细，帮助了我这种初学者。</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		评论者：梦幻超级者		</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b-%e5%86%8d%e8%b0%88-%e6%9c%80%e9%80%9f%e4%b8%8b%e9%99%8d%e6%b3%95%e6%a2%af%e5%ba%a6%e6%b3%95steepest-descent/comment-page-1/#comment-2326</link>

		<dc:creator><![CDATA[梦幻超级者]]></dc:creator>
		<pubDate>Thu, 25 Dec 2014 12:18:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.codelast.com/?p=8006#comment-2326</guid>

					<description><![CDATA[博主写的很好，很清晰。]]></description>
			<content:encoded><![CDATA[<p>博主写的很好，很清晰。</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
