The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/29784
Record Status Checked
Record Id 29784
Title An active-set algorithm for nonlinear programming using linear programming and equality constained subproblems
Abstract This paper describes an active-set algorithm for large-scale nonlinear programming based on the successive linear programming method proposed by Fletcher and Sainz de la Maza [9]. The step computation is performed in two stages. In the first stage a linear program is solved to estimate the active set at the solution. The linear program is obtained by making a linear approximation to the l(subscript 1)penalty function inside a trust region. In the second stage, an equality constrained quadratic program (EQP) is solved involving only those constraints that are active at the solution of the linear program. The EQP incorporates a trust-region constraint and is solved (inexactly) by means of a projected conjugate gradient method. Numerical experiments are presented illustrating the performance of the algorithm on the CUTEr [1] test set.
Organisation CCLRC , CSE
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2002-032. 2003. raltr-2002032.pdf 2003
Journal Article Math Program 100, no. 1 (2004): 27-48. 2004