×

zbMATH — the first resource for mathematics

A secant algorithm with line search filter method for nonlinear optimization. (English) Zbl 1205.90007
Summary: Filter methods were initially designed for nonlinear programming problems by Fletcher and Leyffer. In this paper we propose a secant algorithm with line search filter method for nonlinear equality constrained optimization. The algorithm yields the global convergence under some reasonable conditions. By using the Lagrangian function value in the filter we establish that the proposed algorithm can overcome the Maratos effect without using second order correction step, so that fast local superlinear convergence to second order sufficient local solution is achieved. The primary numerical results are presented to confirm the robustness and efficiency of our approach.

MSC:
90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
90C30 Nonlinear programming
Software:
Ipopt
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Coleman, T.F.; Conn, A.R., On the local convergence of a quasi-Newton method for the nonlinear programming problem, SIAM J. numer. anal., 21, 755-769, (1984) · Zbl 0566.65046
[2] Nocedal, J.; Overton, M.L., Projected Hessian updating algorithms for nonlinearly constrained optimization, SIAM J. numer. anal., 22, 821-850, (1985) · Zbl 0593.65043
[3] Fontecilla, R., Local convergence of secant methods for nonlinear constrained optimization, SIAM J. numer. anal., 25, 692-712, (1988) · Zbl 0698.65042
[4] Byrd, R.H.; Schnabel, R.B., Continuity of the null space basis and constrained optimization, Math. program., 35, 32-41, (1986) · Zbl 0598.90072
[5] Fletcher, R.; Leyffer, S., Nonlinear programming without a penalty function, Math. program., 91, 239-269, (2002) · Zbl 1049.90088
[6] A. Wächter, L.T. Biegler, Global and local convergence of line search filter methods for nonlinear programming, CAPD Technical Report B-01-09, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, 2001 (Revised 2002).
[7] Wächter, A.; Biegler, L.T., Line search filter methods for nonlinear programming: local convergence, SIAM J. optim., 6, 32-48, (2005) · Zbl 1115.90056
[8] Wächter, A.; Biegler, L.T., Line search filter methods for nonlinear programming: motivation and global convergence, SIAM J. comput., 16, 1-31, (2005) · Zbl 1114.90128
[9] Wächter, A.; Biegler, L.T., On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. program., 106, 25-57, (2006) · Zbl 1134.90542
[10] Gu, C.; Zhu, D., A filter interior point algorithm with projected Hessian updating for nonlinear optimization, J. appl. math. comput., 29, 67-80, (2009) · Zbl 1172.49019
[11] Nocedal, J.; Wright, S., Numerical optimization, (1999), Springer-Verlag New York, NY · Zbl 0930.65067
[12] Hock, W.; Schittkowski, K., Test examples for nonlinear programming codes, Lecture notes in economics and mathematics system, vol. 187, (1981), Springer-Verlag · Zbl 0452.90038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.