Abstract
This paper discusses and summarizes three topics that are of current interest in the theory of unconstrained optimization. It treats variable metric algorithms that minimize convex quadratics in a finite number of steps without performing linear searches, variable metric and conjugate direction algorithms that minimize nonquadratics in a finite number of steps, and numerically stable variable metric updating formulas.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
