Lec13_Gradient_student.pdf

Lec13_Gradient_student.pdf

ID:35157468

大小:198.59 KB

页数:12页

时间:2019-03-20

Lec13_Gradient_student.pdf_第1页
Lec13_Gradient_student.pdf_第2页
Lec13_Gradient_student.pdf_第3页
Lec13_Gradient_student.pdf_第4页
Lec13_Gradient_student.pdf_第5页
资源描述:

《Lec13_Gradient_student.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、18-660:NumericalMethodsforEngineeringDesignandOptimizationXinLiDepartmentofECECarnegieMellonUniversityPittsburgh,PA15213Slide1Overview¢Lecture12:NonlinearEquationSolver{Newton-Raphsonmethod{BinarysearchBinarysearch¢Lecture13:UnconstrainedOptimization{Gradientmethod{NewtonmethodSlide2Unconstraine

2、dOptimization¢Linearregressionwithregularization2Aα=BminAα−B+λ⋅αα21¢Unconstrainedoptimization:minimizingacostfunctionwithoutanyconstraint{GoldensectionsearchNon-derivativemethod{Downhillsimplexmethod{GradientmethodRelyonderivatives(thislecture){NewtonmethodSlide3GradientMethod¢Ifacostfunctioniss

3、mooth,itsderivativeinformationcanbeusedtosearchoptimalsolutionf(x)minf(x)xxSlide4GradientMethod¢Forillustrationpurpose,westartfromaone-dimensionalcaseminf(x)xSlide5GradientMethod¢One-dimensionalcase(continued)()k(k+1)()k()kdf[()k+1][()k]df()kΔx=x−x=−λ⋅&fx≈fx+⋅Δxdxx()kdxx()kSlide6GradientMethod¢O

4、ne-dimensionalcase(continued)Derivativeiszeroatlocalopp(timum(ggradientΔx=−λ⋅dfdx=0methodconverges)f(()x)xSlide7GradientMethod¢Two-dimensionalcaseminf()x,x12x1,x2Slide8GradientMethod¢Two-dimensionalcase(continued)⎡(k)⎤Δx1()k[]()k()k⎢(k)⎥=−λ⋅∇fx1,x2Δx⎣Δ2⎦()k[]()()k+1k+1[]()k()k[]()k()kT⎡Δx1⎤fx1,x

5、2≈fx1,x2+∇fx1,x2⋅⎢()k⎥Δx⎣2⎦f[x(k+1)x(k+1)]f[x(k)x(k)](k)f[x(k)x(k)]Tf[x(k)x(k)]fx1,x2≈fx1,x2−λ⋅∇fx1,x2⋅∇fx1,x22f[x(k+1),x(k+1)]≈f[x(k),x(k)]−λ(k)⋅∇f[x(k),x(k)]λ(k)>01212122Thecostfunctionf(x1,x2))pkeepsdecreasinggifthegradientisnon-zeroSlide9GradientMethod¢N-dimensionalcaseminf()XXSlide10NewtonM

6、ethod¢Gradientmethodreliesonfirst-orderderivativeinformation{Eachiterationissimple,butitconvergestooptimumslowly{IerequirealargenumberofiterationstepsI.e.,requirealargenumberofiterationsteps(k)¢Thestepsizeλcanbeoptimizedbyone-dimensionalsearchforfastconvergence{(k)(k)[(k)]}minfX−λ⋅∇fX()kλ¢Altern

7、ativealgorithm:Newtonmethod{Relyonbothfirstonbothfirst-orderandsecondorderandsecond-orderderivativesorderderivatives{Eachiterationismoreexpensive{Butitconvergestooptimummorequickly,i.e.,requiresasmallernumberofiterationsmall

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
相关文章
更多
相关标签