Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4634251 | Applied Mathematics and Computation | 2008 | 15 Pages |
Abstract
In this paper, we present a general algorithm for nonlinear programming which uses a slanting filter criterion for accepting the new iterates. Independently of how these iterates are computed, we prove that all accumulation points of the sequence generated by the algorithm are feasible. Computing the new iterates by the inexact restoration method, we prove stationarity of all accumulation points of the sequence.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Elizabeth W. Karas, Ana P. Oening, Ademir A. Ribeiro,