1992
DOI: 10.6028/nist.ir.4900
|View full text |Cite
|
Sign up to set email alerts
|

A truncated SQP algorithm for large scale nonlinear programming problems

Abstract: We consider the inequality constrained nonlinear programming problem and an SQP algorithm for its solution. We are primarily concerned with two aspects of the general procedure, namely, the approximate solution of the quadratic program, and the need for an appropriate merit function. We first describe an (iterative) interior-point method for the quadratic programming subproblem that, no matter when it its terminated, yields a descent direction for a suggested new merit function. An algorithm based on ideas fro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1993
1993
1993
1993

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 9 publications
0
0
0
Order By: Relevance