<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>算法 &#8211; 编码无悔 /  Intent &amp; Focused</title>
	<atom:link href="https://www.codelast.com/tag/%E7%AE%97%E6%B3%95/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.codelast.com</link>
	<description>最优化之路</description>
	<lastBuildDate>Mon, 27 Apr 2020 17:13:16 +0000</lastBuildDate>
	<language>zh-Hans</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>
	<item>
		<title>[原创]最优化/Optimization文章合集</title>
		<link>https://www.codelast.com/%e5%8e%9f%e5%88%9b%e6%9c%80%e4%bc%98%e5%8c%96optimization%e6%96%87%e7%ab%a0%e5%90%88%e9%9b%86/</link>
					<comments>https://www.codelast.com/%e5%8e%9f%e5%88%9b%e6%9c%80%e4%bc%98%e5%8c%96optimization%e6%96%87%e7%ab%a0%e5%90%88%e9%9b%86/#respond</comments>
		
		<dc:creator><![CDATA[learnhard]]></dc:creator>
		<pubDate>Sat, 26 Oct 2013 05:11:40 +0000</pubDate>
				<category><![CDATA[Algorithm]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[原创]]></category>
		<category><![CDATA[optimization]]></category>
		<category><![CDATA[最优化]]></category>
		<category><![CDATA[算法]]></category>
		<guid isPermaLink="false">http://www.codelast.com/?p=7364</guid>

					<description><![CDATA[<p>
<a href="http://zh.wikipedia.org/wiki/%E6%9C%80%E4%BC%98%E5%8C%96" rel="noopener noreferrer" target="_blank"><span style="background-color:#ffa07a;">最优化</span></a>（Optimization）是应用数学的一个分支，它是研究在给定约束之下如何寻求某些因素(的量)，以使某一(或某些)指标达到最优的一些学科的总称。我一直对最优化比较感兴趣，所以写过一些相关的笔记，可能有不正确的地方，但请学术派、技术流们多多包涵。</p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=2780" rel="noopener noreferrer" target="_blank">拟牛顿法/Quasi-Newton，DFP算法/Davidon-Fletcher-Powell，及BFGS算法/Broyden-Fletcher-Goldfarb-Shanno</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=2573" rel="noopener noreferrer" target="_blank">最速下降法/steepest descent，牛顿法/newton，共轭方向法/conjugate direction，共轭梯度法/conjugate gradient 及其他</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=1419" rel="noopener noreferrer" target="_blank">Ridders求导算法</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=1288" rel="noopener noreferrer" target="_blank">选主元的高斯-约当（Gauss-Jordan）消元法解线性方程组/求逆矩阵</a><br />
<span style="color: rgb(255, 255, 255);">文章来源：</span><a href="http://www.codelast.com/" rel="noopener noreferrer" target="_blank"><span style="color: rgb(255, 255, 255);">http://www.codelast.com/</span></a><br />
<span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=2348" rel="noopener noreferrer" target="_blank">关于 最优化/Optimization 的一些概念解释</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=1027" rel="noopener noreferrer" target="_blank">最小二乘的理论依据</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=388" rel="noopener noreferrer" target="_blank">Powell共轭方向集方法(Powell&#39;s Conjugate Direction Method)的实现</a><br />
<span id="more-7364"></span><br />
<span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=434" rel="noopener noreferrer" target="_blank">黄金比例搜索算法（Golden Section Search）的实现</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=29" rel="noopener noreferrer" target="_blank">LM(Levenberg-Marquard)算法的实现</a><br />
<span style="color: rgb(255, 255, 255);">文章来源：</span><a href="http://www.codelast.com/" rel="noopener noreferrer" target="_blank"><span style="color: rgb(255, 255, 255);">http://www.codelast.com/</span></a><br />
<span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7360" rel="noopener noreferrer" target="_blank">一维搜索中的划界(Bracket)算法</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7446" rel="noopener noreferrer" target="_blank">漫谈line search中的Fibonacci搜索与黄金比例搜索</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7320" rel="noopener noreferrer" target="_blank">用&#8220;人话&#8221;解释不精确线搜索中的Armijo-Goldstein准则及Wolfe-Powell准则</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7488" rel="noopener noreferrer" target="_blank">信赖域(Trust Region)算法是怎么一回事</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7514" rel="noopener noreferrer" target="_blank">使用一维搜索(line search)的算法的收敛性</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=7838" rel="noopener noreferrer" target="_blank">line search中的重要定理 - 梯度与方向的点积为零</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=8022" rel="noopener noreferrer" target="_blank">Cauchy-Schwartz(柯西-许瓦兹)不等式复习</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=8006" rel="noopener noreferrer" target="_blank">再谈 最速下降法/梯度法/Steepest Descent/Gradient descent</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=8052" rel="noopener noreferrer" target="_blank">再谈 牛顿法/Newton&#39;s Method In Optimization</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span><a href="https://www.codelast.com/?p=8095" rel="noopener noreferrer" target="_blank">再谈 共轭方向法/Conjugate Direction Method In Optimization</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&#160;</span>To be added...&#8230; <a href="https://www.codelast.com/%e5%8e%9f%e5%88%9b%e6%9c%80%e4%bc%98%e5%8c%96optimization%e6%96%87%e7%ab%a0%e5%90%88%e9%9b%86/" class="read-more">Read More </a></p>]]></description>
										<content:encoded><![CDATA[<p>
<a href="http://zh.wikipedia.org/wiki/%E6%9C%80%E4%BC%98%E5%8C%96" rel="noopener noreferrer" target="_blank"><span style="background-color:#ffa07a;">最优化</span></a>（Optimization）是应用数学的一个分支，它是研究在给定约束之下如何寻求某些因素(的量)，以使某一(或某些)指标达到最优的一些学科的总称。我一直对最优化比较感兴趣，所以写过一些相关的笔记，可能有不正确的地方，但请学术派、技术流们多多包涵。</p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=2780" rel="noopener noreferrer" target="_blank">拟牛顿法/Quasi-Newton，DFP算法/Davidon-Fletcher-Powell，及BFGS算法/Broyden-Fletcher-Goldfarb-Shanno</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=2573" rel="noopener noreferrer" target="_blank">最速下降法/steepest descent，牛顿法/newton，共轭方向法/conjugate direction，共轭梯度法/conjugate gradient 及其他</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=1419" rel="noopener noreferrer" target="_blank">Ridders求导算法</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=1288" rel="noopener noreferrer" target="_blank">选主元的高斯-约当（Gauss-Jordan）消元法解线性方程组/求逆矩阵</a><br />
<span style="color: rgb(255, 255, 255);">文章来源：</span><a href="http://www.codelast.com/" rel="noopener noreferrer" target="_blank"><span style="color: rgb(255, 255, 255);">http://www.codelast.com/</span></a><br />
<span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=2348" rel="noopener noreferrer" target="_blank">关于 最优化/Optimization 的一些概念解释</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=1027" rel="noopener noreferrer" target="_blank">最小二乘的理论依据</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=388" rel="noopener noreferrer" target="_blank">Powell共轭方向集方法(Powell&#39;s Conjugate Direction Method)的实现</a><br />
<span id="more-7364"></span><br />
<span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=434" rel="noopener noreferrer" target="_blank">黄金比例搜索算法（Golden Section Search）的实现</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=29" rel="noopener noreferrer" target="_blank">LM(Levenberg-Marquard)算法的实现</a><br />
<span style="color: rgb(255, 255, 255);">文章来源：</span><a href="http://www.codelast.com/" rel="noopener noreferrer" target="_blank"><span style="color: rgb(255, 255, 255);">http://www.codelast.com/</span></a><br />
<span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7360" rel="noopener noreferrer" target="_blank">一维搜索中的划界(Bracket)算法</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7446" rel="noopener noreferrer" target="_blank">漫谈line search中的Fibonacci搜索与黄金比例搜索</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7320" rel="noopener noreferrer" target="_blank">用&ldquo;人话&rdquo;解释不精确线搜索中的Armijo-Goldstein准则及Wolfe-Powell准则</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7488" rel="noopener noreferrer" target="_blank">信赖域(Trust Region)算法是怎么一回事</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7514" rel="noopener noreferrer" target="_blank">使用一维搜索(line search)的算法的收敛性</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=7838" rel="noopener noreferrer" target="_blank">line search中的重要定理 - 梯度与方向的点积为零</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=8022" rel="noopener noreferrer" target="_blank">Cauchy-Schwartz(柯西-许瓦兹)不等式复习</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=8006" rel="noopener noreferrer" target="_blank">再谈 最速下降法/梯度法/Steepest Descent/Gradient descent</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=8052" rel="noopener noreferrer" target="_blank">再谈 牛顿法/Newton&#39;s Method In Optimization</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span><a href="https://www.codelast.com/?p=8095" rel="noopener noreferrer" target="_blank">再谈 共轭方向法/Conjugate Direction Method In Optimization</a></p>
<p><span style="background-color: rgb(0, 255, 0);">➤&nbsp;</span>To be added...</p>
<p><span style="color: rgb(255, 255, 255);">文章来源：</span><a href="https://www.codelast.com/" rel="noopener noreferrer" target="_blank"><span style="color: rgb(255, 255, 255);">https://www.codelast.com/</span></a><br />
<span style="color: rgb(255, 0, 0);">➤➤</span>&nbsp;版权声明&nbsp;<span style="color: rgb(255, 0, 0);">➤➤</span>&nbsp;<br />
转载需注明出处：<u><a href="https://www.codelast.com/" rel="noopener noreferrer" target="_blank"><em><span style="color: rgb(0, 0, 255);"><strong style="font-size: 16px;"><span style="font-family: arial, helvetica, sans-serif;">codelast.com</span></strong></span></em></a></u>&nbsp;<br />
感谢关注我的微信公众号（微信扫一扫）：</p>
<p style="border: 0px; font-size: 13px; margin: 0px 0px 9px; outline: 0px; padding: 0px; color: rgb(77, 77, 77);">
	<img decoding="async" alt="wechat qrcode of codelast" src="https://www.codelast.com/codelast_wechat_qr_code.jpg" style="width: 200px; height: 200px;" /></p>
]]></content:encoded>
					
					<wfw:commentRss>https://www.codelast.com/%e5%8e%9f%e5%88%9b%e6%9c%80%e4%bc%98%e5%8c%96optimization%e6%96%87%e7%ab%a0%e5%90%88%e9%9b%86/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
