Abstract.
This paper describes an active-set algorithm for large-scale nonlinear programming based on the successive linear programming method proposed by Fletcher and Sainz de la Maza [10]. The step computation is performed in two stages. In the first stage a linear program is solved to estimate the active set at the solution. The linear program is obtained by making a linear approximation to the ℓ1 penalty function inside a trust region. In the second stage, an equality constrained quadratic program (EQP) is solved involving only those constraints that are active at the solution of the linear program. The EQP incorporates a trust-region constraint and is solved (inexactly) by means of a projected conjugate gradient method. Numerical experiments are presented illustrating the performance of the algorithm on the CUTEr [1, 15] test set.
Similar content being viewed by others
References
Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: CUTE: Constrained and Unconstrained Testing Environment. ACM Transactions on Math. Softw. 21(1), 123–160 (1995)
Byrd, R.H., Gould, N.I.M., Nocedal, J., Waltz, R.A.: On the convergence of successive linear programming algorithms. Technical Report OTC 2002/5, Optimization Technology Center, Northwestern University, Evanston, IL, USA, 2002
Byrd, R.H., Hribar, M.E., Nocedal, J.: An interior point algorithm for large scale nonlinear programming. SIAM J. Optim. 9(4), 877–900 (1999)
Chin, C.M., Fletcher, R.: On the global convergence of an SLP-filter algorithm that takes EQP steps. Math. Program. Ser. A 96(1), 161–177 (2003)
Conn, A.R., Gould, N.I.M., Toint, Ph.: Trust-region methods. MPS-SIAM Series on Optimization. SIAM publications, Philadelphia, Pennsylvania, USA, 2000
Conn, A.R., Gould, N.I.M., Toint, Ph.L.: LANCELOT: a Fortran package for Large-scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics. Springer Verlag, Heidelberg, Berlin, New York, 1992
Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. Ser. A 91, 201–213 (2002)
Fletcher, R.: Practical Methods of Optimization. Volume 2: Constrained Optimization. J. Wiley and Sons, Chichester, England, 1981
Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239–269 (2002)
Fletcher, R., Sainz de~la Maza, E.: Nonlinear programming and nonsmooth optimization by successive linear programming. Math. Program. 43(3), 235–256 (1989)
Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM J. Optim. 12, 979–1006 (2002)
Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London, 1981
Gould, N.I.M., Hribar, M.E., Nocedal, J.: On the solution of equality constrained quadratic problems arising in optimization. SIAM J. Scientific Comput. 23(4), 1375–1394 (2001)
Gould, N.I.M., Lucidi, S., Roma, M., Toint, Ph.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504–525 (1999)
Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited. Technical Report TR/PA/01/04, CERFACS, Toulouse, France, 2003. To appear in Transactions on Mathematical Software
Harwell~Subroutine Library.: A catalogue of subroutines (HSL 2002). AEA Technology, Harwell, Oxfordshire, England, 2002
ILOG CPLEX 8.0.: User’s Manual. ILOG SA, Gentilly, France, 2002
Lin, C., Moré, J.J.: Newton’s method for large bound-constrained optimization problems. SIAM J. Optim. 9(4), 1100–1127 (1999)
Maratos, N.: Exact penalty function algorithms for finite-dimensional and control optimization problems. PhD thesis, University of London, London, England, 1978
Powell, M.J.D.: A Fortran subroutine for unconstrained minimization requiring first derivatives of the objective function. Technical Report R-6469, AERE Harwell Laboratory, Harwell, Oxfordshire, England, 1970
Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L. and Ritter, K. eds., Nonlinear Programming, London, Academic Press, 1970, pp. 31–65
Waltz, R.A.: Algorithms for large-scale nonlinear optimization. PhD thesis, Department of Electrical and Computer Engineering, Northwestern University, Evanston, Illinois, USA, http://www.ece.northwestern. edu/∼rwaltz/, 2002
Waltz, R.A., Nocedal, J.: KNITRO user’s manual. Technical Report OTC 2003/05, Optimization Technology Center, Northwestern University, Evanston, IL, USA, April 2003
Yuan, Y.: Conditions for convergence of trust region algorithms for nonsmooth optimization. Math. Program. 31(2), 220–228 (1985)
Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 78: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. ACM Transactions on Math. Softw. 23(4), 550–560 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
This author was supported by Air Force Office of Scientific Research grant F49620-00-1-0162, Army Research Office Grant DAAG55-98-1-0176, and National Science Foundation grant INT-9726199.
This author was supported in part by the EPSRC grant GR/R46641.
These authors were supported by National Science Foundation grants CCR-9987818, ATM-0086579 and CCR-0219438 and Department of Energy grant DE-FG02-87ER25047-A004.
Report OTC 2002/4, Optimization Technology Center
To Roger Fletcher, with respect and admiration
Rights and permissions
About this article
Cite this article
Byrd, R., Gould, N., Nocedal, J. et al. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program., Ser. B 100, 27–48 (2003). https://doi.org/10.1007/s10107-003-0485-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0485-4