A sparse nonlinear optimization algorithm |
| |
Authors: | J T Betts P D Frank |
| |
Institution: | (1) Mathematics and Engineering Analysis Department, Research and Technology Division, Boeing Computer Services, Seattle, Washington |
| |
Abstract: | One of the most effective numerical techniques for solving nonlinear programming problems is the sequential quadratic programming approach. Many large nonlinear programming problems arise naturally in data fitting and when discretization techniques are applied to systems described by ordinary or partial differential equations. Problems of this type are characterized by matrices which are large and sparse. This paper describes a nonlinear programming algorithm which exploits the matrix sparsity produced by these applications. Numerical experience is reported for a collection of trajectory optimization problems with nonlinear equality and inequality constraints.The authors wish to acknowledge the insightful contributions of Dr. William Huffman. |
| |
Keywords: | Sparse nonlinear programming sequential quadratic programming trajectory optimization |
本文献已被 SpringerLink 等数据库收录! |