Global convergence of slanting filter methods for nonlinear programming

@article{Karas2008GlobalCO,
  title={Global convergence of slanting filter methods for nonlinear programming},
  author={Elizabeth W. Karas and Ana P. Oening and Ademir A. Ribeiro},
  journal={Applied Mathematics and Computation},
  year={2008},
  volume={200},
  pages={486-500}
}
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. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

On the Global Convergence of a Filter--SQP Algorithm

  • SIAM Journal on Optimization
  • 2002
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A new trust region filter algorithm

  • Applied Mathematics and Computation
  • 2008
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Pilotta, Inexact restoration methods for nonlinear programming: advances and perspectives

E.A.J.M. Martı́nez
  • Optimization and Control with Applications,
  • 2005

Pilotta, Inexact restoration algorithm for constrained optimization

E.A.J.M. Martı́nez
  • Journal of Optimization Theory and Applications
  • 2000
VIEW 3 EXCERPTS