Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions (2002)

by Hande Y. Benson , Arun Sen , David , F. Shanno
Venue:Computational Optimization and Applications
Citations:64 - 5 self

Document Versions

Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions –Hande Y. Benson, Arun Sen, David, F. Shanno — 2002 — Computational Optimization and Applications
Interior-Point Methods For Nonconvex Nonlinear Programming: Filter Methods And Merit Functions –Hande Y. Benson, David F. Shanno, Robert, Robert J. Vanderbei — 2000 — Math. Prog
Interior-Point Methods For Nonconvex Nonlinear Programming: Orderings And Higher-Order Methods –David F. Shanno, Robert J. Vanderbei — 1999 — MATH. PROG
Interior-Point Methods For Nonconvex Nonlinear Programming: Orderings And Higher-Order Methods –David F. Shanno, Robert J. Vanderbei — 1999 — MATH. PROG
Interior-Point Methods For Nonconvex Nonlinear Programming: Jamming And Comparative Numerical Testing –Hande Y. Benson, David F. Shanno, Robert, Robert J. Vanderbei — 2000 — Math. Prog
Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions –Hande Y. Benson, David F. Shanno, Robert, Robert J. Vanderbei — 2000 — Math. Prog
Interior-Point Methods for Nonconvex Nonlinear Programming: Complementarity Constraints –Hande Y. Benson, David F. Shanno, Robert, Robert J. Vanderbei — 2002 — Math. Prog
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods –Hande Y. Benson, David, F. Shanno — 2000 — Math. Prog
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods –Hande Y. Benson, David F. Shanno, Robert, J. Vanderbei — 2000 — Math. Prog