Abstract
Abstract In Part I, Miele et al. (1979) developed the sequential conjugate gradient-restoration algorithm for minimizing a functional subject to differential constraints, nondifferential constraints, and terminal constraints. In this paper, several numerical examples are presented, some pertaining to a quadratic functional subject to linear constraints and some pertaining to a nonquadratie functional subject to nonlinear constraints. These examples demonstrate the feasibility as well as the convergence characteristics of the sequential conjugate gradient-restoration algorithm.
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.
