Abstract
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps that do not lie exactly in the nullspace of the local Jacobian. Preliminary numerical experiments on CUTEr problems indicate that the method performs well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Biegler L.T., Nocedal J., Schmid C.: A reduced Hessian method for large-scale constrained optimization. SIAM J. Optim. 5(2), 314–347 (1995)
Bielschowsky, R.H., Gomes, F.A.M.: Dynamical control of infeasibility in nonlinearly constrained optimization. Technical Report 23/06, Department of Applied Mathematics, IMECC-UNICAMP, Campinas, Brazil. SIAM J. Optim. (2006, to appear)
Byrd R.H., Curtis F.E., Nocedal J.: An inexact SQP method for equality constrained optimization. SIAM J. Optim. 19(1), 351–369 (2008)
Byrd R.H., Gilbert J.Ch., Nocedal J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. Ser. A 89(1), 149–186 (2000a)
Byrd R.H., Gould N.I.M., Nocedal J., Waltz R.A.: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program. Ser. B 100(1), 27–48 (2004)
Byrd R.H., Hribar M.E., Nocedal J.: An interior point algorithm for large scale nonlinear programming. SIAM J. Optim. 9(4), 877–900 (2000b)
Coleman T.F., Conn A.R.: Nonlinear programming via an exact penalty function method: asymptotic analysis. Math. Program. 24(3), 123–136 (1982)
Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. Number 01. In: MPS-SIAM Series on Optimization. SIAM, Philadelphia, USA (2000)
El-Alem M.: Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization. J. Optim. Theory Appl. 87(3), 563–577 (1995)
El-Alem M.: A global convergence theory for a general class of trust-region-based algorithms for constrained optimization without assuming regularity. SIAM J. Optim. 9(4), 965–990 (1999)
Fletcher R., Leyffer S.: Nonlinear programming without a penalty function. Math. Program. 91(2), 239–269 (2002)
Fletcher R., Gould N.I.M., Leyffer S., Toint Ph.L., Wächter A.: Global convergence of trust-region SQP-filter algorithms for nonlinear programming. SIAM J. Optim. 13(3), 635–659 (2002a)
Fletcher R., Leyffer S., Toint Ph.L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13(1), 44–59 (2002b)
Gould, N.I.M., Toint, Ph.L.: Nonlinear programming without a penalty function or a filter. Technical Report 07/2, Department of Mathematics, FUNDP-University of Namur, Namur, Belgium (2007)
Gould N.I.M., Leyffer S., Toint Ph.L.: A multidimensional filter algorithm for nonlinear equations and nonlinear least-squares. SIAM J. Optim. 15(1), 17–38 (2005)
Heinkenschloss M., Vicente L.N.: Analysis of inexact trust region SQP algorithms. SIAM J. Optim. 12(2), 283–302 (2001)
Himmelblau D.M.: Applied Nonlinear Programming. McGraw-Hill, New York (1972)
Lalee M., Nocedal J., Plantenga T.D.: On the implementation of an algorithm for large-scale equality constrained optimization. SIAM J. Optim. 8(3), 682–706 (1998)
Liu X., Yuan Y.: A robust trust-region algorithm for solving general nonlinear programming problems. SIAM J. Scientific Comput. 22, 517–534 (2000)
Mayne D.Q., Polak E.: A superlinearly convergent algorithm for constrained optimization problems. Math. Program. Stud. 16, 45–61 (1982)
Omojokun, E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD thesis, University of Colorado, Boulder, Colorado, USA (1989)
Steihaug T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3), 626–637 (1983)
Toint Ph.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (eds) Sparse Matrices and Their Uses, pp. 57–88. Academic Press, London (1981)
Ulbrich S., Ulbrich M.: Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. Ser. B 95(1), 103–105 (2003)
Yamashita, H., Yabe, H.: A globally convergent trust-region SQP method without a penalty function for nonlinearly constrained optimization. Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan (2003)
Yamashita, N.: A globally convergent qusi-newton method for equality constrained optimization that does not use a penalty function. Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan, 1979. Revised in (1982)
Zoppke-Donaldson, C.: A tolerance-tube approach to sequential quadratic programming with applications. PhD thesis, Department of Mathematics and Computer Science, University of Dundee, Dundee, Scotland, UK (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article can be found at http://dx.doi.org/10.1007/s10107-011-0491-x
Rights and permissions
About this article
Cite this article
Gould, N.I.M., Toint, P.L. Nonlinear programming without a penalty function or a filter. Math. Program. 122, 155–196 (2010). https://doi.org/10.1007/s10107-008-0244-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-008-0244-7