New Inexact Line Search Method for Unconstrained Optimization
dc.contributor.author | Shi, Zhen-Jun | en_US |
dc.contributor.author | Shen, Jie | en_US |
dc.date.accessioned | 2006-09-11T15:46:52Z | |
dc.date.available | 2006-09-11T15:46:52Z | |
dc.date.issued | 2005-11 | en_US |
dc.identifier.citation | Shi, Z. J.; Shen, J.; (2005). "New Inexact Line Search Method for Unconstrained Optimization." Journal of Optimization Theory and Applications 127(2): 425-446. <http://hdl.handle.net/2027.42/45195> | en_US |
dc.identifier.issn | 0022-3239 | en_US |
dc.identifier.issn | 1573-2878 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45195 | |
dc.description.abstract | We propose a new inexact line search rule and analyze the global convergence and convergence rate of related descent methods. The new line search rule is similar to the Armijo line-search rule and contains it as a special case. We can choose a larger stepsize in each line-search procedure and maintain the global convergence of related line-search methods. This idea can make us design new line-search methods in some wider sense. In some special cases, the new descent method can reduce to the Barzilai and Borewein method. Numerical results show that the new line-search methods are efficient for solving unconstrained optimization problems. | en_US |
dc.format.extent | 149659 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Springer Science+Business Media, Inc. | en_US |
dc.subject.other | Unconstrained Optimization | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Applications of Mathematics | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Theory of Computation | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Engineering, General | en_US |
dc.subject.other | Operations Research/Decision Theory | en_US |
dc.subject.other | Inexact Line Search | en_US |
dc.subject.other | Global Convergence | en_US |
dc.subject.other | Convergence Rate | en_US |
dc.title | New Inexact Line Search Method for Unconstrained Optimization | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Computer and Information Science, University of Michigan, Dearborn, Michigan | en_US |
dc.contributor.affiliationother | College of Operations Research and Management, Qufu Normal University, Rizhao, Shandong, PRC; Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Rizhao, Beijing, Shandong, PRC | en_US |
dc.contributor.affiliationumcampus | Dearborn | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45195/1/10957_2005_Article_6553.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s10957-005-6553-6 | en_US |
dc.identifier.source | Journal of Optimization Theory and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.