A New Algorithm Based on rSQP and AD

An efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem w...

Full description

Saved in:
Bibliographic Details
Main Author: Li, Jin (author)
Other Authors: Tan, Yuejin (author), Liao, Liangcai (author)
Format: article
Language:eng
Published: 2007
Subjects:
Online Access:http://bibdigital.epn.edu.ec/handle/15000/9322
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem was solved by improved rSQP solver. In the solving process, AD technology was used to obtain accurate gradient information. The numerical results show that the combined algorithm, which is suitable for large-scale process optimization problems, can calculate more efficiently than rSQP itself.