An efficient algorithm for steepest descent method for unconstrained optimization
Exact line searches along each steepest descent direction converge very slowly. Barzilai and Borwein suggested two stepsizes that ensures superlinear convergence and performs quite well. Barzilai-Borwein method is not monotone, thus it is not easy to be generalized for general nonlinear functions. A...
à®®à¯à®´à¯ விளகà¯à®•à®®à¯
Saved in:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯à®•ளà¯: | , , |
|---|---|
| வடிவமà¯: | கடà¯à®Ÿà¯à®°à¯ˆ |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
Penerbit UTHM
2009
|
| பகà¯à®¤à®¿à®•ளà¯: | |
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•லà¯: | http://eprints.uthm.edu.my/543/ http://eprints.uthm.edu.my/543/1/JST_Vol12_F2.pdf |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ளà¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ள௠இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•ளà¯!
|
இணையமà¯
http://eprints.uthm.edu.my/543/http://eprints.uthm.edu.my/543/1/JST_Vol12_F2.pdf