Abstract
AbstractAn optimization method is developed based on ellipsoidal trust regions that are defined by conic functions. It provides a powerful unifying theory from which can be derived a variety of interesting and potentially useful optimization algorithms, in particular, conjugate‐gradient‐like algorithms for nonlinear minimization and Karmarkar‐like interior‐point algorithms for linear programming.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.