Abstract
The Symmetric Rank One (SR1) update formula is studied for its use in numerically accumulating second order derivative information for optimization. The unique advantage of the SR1 formula is that it does not require specific search directions for development of the Hessian matrix. This is an attractive feature for optimization applications where arbitrary search directions may be necessary. This paper explores the use of the SR1 formula within a procedure based on recursive quadratic programming (RQP) for solving a class of mixed discrete constrained nonlinear programming (MDCNP) problems. Theoretical considerations are presented along with numerical examples which illustrate the procedure and the utility of SR1.
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.
