Abstract
New conjugate directions algorithms are proposed, which are based on an orthogonalization procedure and do not perform line searches. The orthogonalization procedure prevents the conjugate vectors set from the degeneracy, eliminates high sensitivity to computation errors pertinent to methods of conjugate directions, and thus enable us to solve large-scale minimization problems without preconditioning. Numerical experiments have confirmed high efficiency of the algorithms for minimizing large-scale quadratic functions.
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.
