{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T01:38:03Z","timestamp":1706146683075},"reference-count":311,"publisher":"Elsevier","isbn-type":[{"value":"9780444880963","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1016\/s0169-7161(05)80131-2","type":"book-chapter","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T19:58:53Z","timestamp":1113854333000},"page":"201-278","source":"Crossref","is-referenced-by-count":2,"title":["7 Mathematical programming \u2014 A computational perspective"],"prefix":"10.1016","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[]},{"given":"Reiner","family":"Horst","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0169-7161(05)80131-2_bib1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01587095","article-title":"An implementation of Karmarkar's algorithm for linear programming","volume":"44","author":"Adler","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0169-7161(05)80131-2_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01831719","article-title":"On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method","volume":"11","author":"Akaike","year":"1959","journal-title":"Ann. Inst. Statist. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib4","series-title":"Topics in Relaxation and Ellipsoidal Methods","author":"Akg\u00fcl","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib5","article-title":"A global convergence theory for the Celis-Dennis-Tapia trust region algorithm for constrained optimization","author":"Alem","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00941312","article-title":"Global optimization and stochastic differential equations","volume":"47","author":"Aluffi-Pentini","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","article-title":"Minimization of functions having Lipschitz continuous first-partial derivatives","volume":"16","author":"Armijo","year":"1966","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib8","series-title":"Studies in Linear and Nonlinear Programming","article-title":"Gradient methods for constrained maxima, with weakened assumptions","author":"Arrow","year":"1958"},{"key":"10.1016\/S0169-7161(05)80131-2_bib9","series-title":"Mathematical Programming in Statistics","author":"Arthanari","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01585110","article-title":"On the differential properties of the support function of the subdifferential of a convex function","volume":"24","author":"Auslender","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01404342","article-title":"On the relation between quadratic termination and convergence properties of minimization algorithms, Part II, Applications","volume":"28","author":"Baptis","year":"1977","journal-title":"Numer. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib12","series-title":"Statistical Inference under Order Restrictions","author":"Barlow","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib13","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","article-title":"A variation on Karmarkar's algorithm for solving linear programming problems","volume":"36","author":"Barnes","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib14","series-title":"Proc. 8th Allerton Conf. on Circuits and Systems Theory","article-title":"A global optimization algorithm","author":"Becker","year":"1970"},{"key":"10.1016\/S0169-7161(05)80131-2_bib15","series-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"Bertsekas","year":"1982"},{"key":"10.1016\/S0169-7161(05)80131-2_bib16","series-title":"Proc. 5th Ann. Princeton Conf. on Information Sciences and Systems","first-page":"347","article-title":"Steepest descent for optimization problems with nondifferentiable cost functionals","author":"Bertsekas","year":"1971"},{"key":"10.1016\/S0169-7161(05)80131-2_bib17","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/0311049","article-title":"A descent numerical method for optimization problems with nondifferentiable cost functionals","volume":"11","author":"Bertsekas","year":"1973","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0169-7161(05)80131-2_bib18","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib19","article-title":"An effective algorithm for quadratic minimization problems","author":"Best","year":"1976"},{"key":"10.1016\/S0169-7161(05)80131-2_bib20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02592015","article-title":"Sequential stopping rules for the multistart algorithm in global optimization","volume":"38","author":"Betro","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib21","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","article-title":"The ellipsoid method: A survey","volume":"29","author":"Bland","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02591684","article-title":"Bayesian stopping rules for multistart global optimization methods","volume":"32","author":"Boender","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01581033","article-title":"A stochastic method for global optimization","volume":"22","author":"Boender","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib24","article-title":"Avoiding the Maratos effect by means of a nonmonotone linear search: II. Inequality constrained problems \u2014 Feasible iterates","author":"Bonnans","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib25","series-title":"The Simplex Method: A Probabilistic Analysis","author":"Borgwardt","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib26","series-title":"Numerical Methods of Nonlinear Optimization","article-title":"A method for finding multiple extrema of a function of n variables","author":"Branin","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib27","series-title":"GAMS: A User's Guide","author":"Brooke","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib28_1","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","article-title":"The convergence of a class of double rank minimization algorithms: Parts I and II","volume":"6","author":"Broyden","year":"1970","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib28_2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","article-title":"The convergence of a class of double rank minimization algorithms: Parts I and II","volume":"6","author":"Broyden","year":"1970","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib29","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1093\/imamat\/12.3.223","article-title":"On the local and superlinear convergence of quasi-Newton methods","volume":"12","author":"Broyden","year":"1973","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib30","series-title":"Proc. IEEE Conf. on Decision and Control","first-page":"80","article-title":"A rapidly convergent method for equality constrained function minimization","author":"Brusch","year":"1973"},{"key":"10.1016\/S0169-7161(05)80131-2_bib31","article-title":"Indefinite quadratic programming","author":"Bunch","year":"1977"},{"key":"10.1016\/S0169-7161(05)80131-2_bib32","article-title":"A robust trust region method for constrained nonlinear programming problems","author":"Burke","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib33","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01582294","article-title":"A robust sequential quadratic programming method","volume":"43","author":"Burke","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib34","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01580867","article-title":"Convergence properties of trust region methods for linear and convex constraints","volume":"47","author":"Burke","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib35","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1137\/0724076","article-title":"A trust region algorithm for nonlinearly constrained optimization","volume":"24","author":"Byrd","year":"1987","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib36","article-title":"An SQP augmented Lagrangian BFGS algorithm for constrained optimization","author":"Byrd","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib37","series-title":"PhD dissertation","article-title":"An operations research approach to the economic optimization of a kraft pulping process","author":"Carroll","year":"1959"},{"key":"10.1016\/S0169-7161(05)80131-2_bib38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/opre.9.2.169","article-title":"The created response surface technique for optimizing nonlinear restrained systems","volume":"9","author":"Carroll","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib39","series-title":"Numerical Optimization 1984","first-page":"71","article-title":"A trust region strategy for equality constrained optimization","author":"Celis","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib40","series-title":"Algorithms for Constrained Minimization of Smooth Nonlinear Functions","first-page":"1","article-title":"The watchdog technique for forcing convergence in algorithms for constrained optimization","volume":"Vol. 16","author":"Chamberlain","year":"1982"},{"key":"10.1016\/S0169-7161(05)80131-2_bib41","first-page":"439","article-title":"Polynomially bounded ellipsoid algorithms for convex quadratic programming","volume":"Vol. 4","author":"Chung","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib42","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1090\/S0002-9947-1975-0367131-6","article-title":"Generalized gradients and applications","volume":"205","author":"Clarke","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0169-7161(05)80131-2_bib43","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/0709024","article-title":"Rate of convergence of several conjugate gradient algorithms","volume":"9","author":"Cohen","year":"1972","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib44","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01585100","article-title":"Nonlinear programming via an exact penalty function: Asymptotic analysis","volume":"24","author":"Coleman","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib45","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01585101","article-title":"Nonlinear programming via an exact penalty function: global analysis","volume":"24","author":"Coleman","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib46","article-title":"A comparative study of nonlinear programming codes","author":"Colville","year":"1968"},{"key":"10.1016\/S0169-7161(05)80131-2_bib47","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0710063","article-title":"Constrained optimization using a nondifferentiable penalty function","volume":"10","author":"Conn","year":"1973","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib48","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","article-title":"Global convergence of a class of trust region algorithms for optimization problems with simple bounds","volume":"25","author":"Conn","year":"1988","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib49","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","article-title":"Testing a class of methods for solving minimization problems with simple bounds on the variables","volume":"50","author":"Conn","year":"1988","journal-title":"Math. Comp."},{"key":"10.1016\/S0169-7161(05)80131-2_bib50","article-title":"A proposal for standard data input format for large-scale nonlinear programming problems","author":"Conn","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib51","article-title":"LANCELOT, A Fortran Package for Large-Scale Nonlinear Optimization (Release A)","volume":"Vol. 17","author":"Conn","year":"1992"},{"key":"10.1016\/S0169-7161(05)80131-2_bib52","series-title":"Proc. 3rd Ann. ACM Sympos. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0169-7161(05)80131-2_bib53","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the asymptotic complexity of matrix multiplications","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0169-7161(05)80131-2_bib54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9904-1943-07818-4","article-title":"Variational methods for the solution of problems of equilibrium and vibrations","volume":"49","author":"Courant","year":"1943","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0169-7161(05)80131-2_bib55","author":"Courant","year":"1953"},{"key":"10.1016\/S0169-7161(05)80131-2_bib56","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/BF01609036","article-title":"Reporting computational experiments with mathematical software","volume":"5","author":"Crowder","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib57","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0704002","article-title":"The conjugate gradient method for linear and nonlinear operator equations","volume":"4","author":"Daniel","year":"1967","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib58","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02174144","article-title":"Convergence of the conjugate gradient method with computationally convenient modifications","volume":"10","author":"Daniel","year":"1967","journal-title":"Numer. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib59","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0707020","article-title":"A correction concerning the convergence rate for the conjugate gradient method","volume":"7","author":"Daniel","year":"1970","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib60","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/S0169-7161(05)80131-2_bib61","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principles for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib62","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","article-title":"The decomposition algorithm for linear programs","volume":"29","author":"Dantzig","year":"1961","journal-title":"Econometrica"},{"key":"10.1016\/S0169-7161(05)80131-2_bib63","article-title":"Variable metric method for minimization","author":"Davidon","year":"1959"},{"key":"10.1016\/S0169-7161(05)80131-2_bib64","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0121178","article-title":"A primal truncated Newton algorithm with application to large scale nonlinear network optimization","volume":"31","author":"Dembo","year":"1987","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0169-7161(05)80131-2_bib65","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01442236","article-title":"Approximation to a set-valued mapping I: A proposal","volume":"14","author":"Demjanov","year":"1986","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib66","series-title":"Nondifferentiable Optimization","author":"Demjanov","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib67","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","article-title":"Quasi-Newton methods, motivation and theory","volume":"19","author":"Dennis","year":"1977","journal-title":"SIAM Rev."},{"key":"10.1016\/S0169-7161(05)80131-2_bib68","series-title":"Numerical Method for Unconstrained Optimization and Nonlinear Equations","author":"Dennis","year":"1983"},{"key":"10.1016\/S0169-7161(05)80131-2_bib69","article-title":"A bibliography on random search","author":"Devroye","year":"1979"},{"key":"10.1016\/S0169-7161(05)80131-2_bib70","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02592065","article-title":"Trajectory nets connecting all critical points of a smooth function","volume":"36","author":"Diener","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib71","first-page":"674","article-title":"Iterative solution of problems of linear and quadratic programming","volume":"8","author":"Dikin","year":"1967","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib72","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00941495","article-title":"A new three-term conjugate gradient method","volume":"47","author":"Dixon","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib73","series-title":"Towards Global Optimization","year":"1975"},{"key":"10.1016\/S0169-7161(05)80131-2_bib74","volume":"Vol. 2","year":"1978"},{"key":"10.1016\/S0169-7161(05)80131-2_bib75","series-title":"PhD dissertation","article-title":"Algorithmic equivalence in quadratic programming","author":"Djang","year":"1979"},{"key":"10.1016\/S0169-7161(05)80131-2_bib76","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/22899.22904","article-title":"Distribution of mathematical software via electronic mail","volume":"30","author":"Dongarra","year":"1987","journal-title":"Comm. ACM"},{"key":"10.1016\/S0169-7161(05)80131-2_bib77","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02592021","article-title":"A convergence theorem of Rosen's gradient projection method","volume":"36","author":"Du","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib78","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01587098","article-title":"Global convergence of Rosen's gradient projection method","volume":"44","author":"Du","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib79","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01582280","article-title":"A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming","volume":"43","author":"Ech-cherif","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib80","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0323042","article-title":"A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms","volume":"23","author":"Ecker","year":"1985","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib81","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0716006","article-title":"An algorithm for l1-norm-minimization with application to nonlinear l1-approximation","volume":"16","author":"El-Attar","year":"1975","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib82","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01580439","article-title":"A central cutting plane algorithm for the convex programming problem","volume":"8","author":"Elzinga","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib83","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","article-title":"Methods for solving nonlinear extremal problems","volume":"2","author":"Ermoliev","year":"1966","journal-title":"Cybernetics"},{"key":"10.1016\/S0169-7161(05)80131-2_bib84","series-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"Fiacco","year":"1968"},{"key":"10.1016\/S0169-7161(05)80131-2_bib85","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","article-title":"A new approach to variable metric methods","volume":"13","author":"Fletcher","year":"1970","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(05)80131-2_bib86","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/7.1.76","article-title":"A general quadratic programming algorithm","volume":"7","author":"Fletcher","year":"1971","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib87","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01584540","article-title":"An algorithm for solving linearly constrained optimization problems","volume":"2","author":"Fletcher","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib88","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1093\/imamat\/15.3.319","article-title":"An ideal penalty function for constrained optimization","volume":"15","author":"Fletcher","year":"1975","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib89","first-page":"99","article-title":"Numerical experiments with an l1 exact penalty function method","volume":"Vol. 4","author":"Fletcher","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib90","series-title":"Numerical Optimization 1984","first-page":"26","article-title":"An l1 penalty method for nonlinear constraints","author":"Fletcher","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib91","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","article-title":"A rapidly convergent descent method for minimization","volume":"6","author":"Fletcher","year":"1963","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(05)80131-2_bib92","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(05)80131-2_bib93","article-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","volume":"Vol. 455","author":"Floudas","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib94","series-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"Fortin","year":"1983"},{"key":"10.1016\/S0169-7161(05)80131-2_bib95","series-title":"Memorandum of October 18, 1954","article-title":"Principles of linear programming \u2014 with particular reference to the double gradient form of the logarithmic potential method","author":"Frisch","year":"1954"},{"key":"10.1016\/S0169-7161(05)80131-2_bib96","series-title":"Memorandum of May 13, 1955","article-title":"The logarithmic potential method of convex programming","author":"Frisch","year":"1955"},{"key":"10.1016\/S0169-7161(05)80131-2_bib97","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0169-7161(05)80131-2_bib98","article-title":"A trust region approach to linearly constrained optimization","volume":"Vol. 1066","author":"Gay","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib99","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585737","article-title":"A filled function method for finding a global minimizer of a function of several variables","volume":"46","author":"Ge","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib100","series-title":"Proc. 24th Conf. on Decision and Control","first-page":"779","article-title":"Analysis of simulated annealing for optimization","author":"Gelfand","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib101","article-title":"Global convergence properties of conjugate gradient methods for optimization","author":"Gilbert","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib102","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588976","article-title":"Numerically stable methods for quadratic programming","volume":"14","author":"Gill","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib103","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","article-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method","volume":"36","author":"Gill","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib104","doi-asserted-by":"crossref","DOI":"10.21236\/ADA169115","article-title":"User's guide for NPSOL (Version 4.0): A Fortran package for nonlinear programming","author":"Gill","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib105","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.8.1.135","article-title":"Convergence rates of the ellipsoid method on general convex functions","volume":"8","author":"Goffin","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib106","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib107","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","article-title":"A family of variable metric methods derived by variational means","volume":"24","author":"Goldfarb","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/S0169-7161(05)80131-2_bib108","first-page":"147","article-title":"On steepest descent","volume":"3","author":"Goldstein","year":"1965","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0169-7161(05)80131-2_bib109","series-title":"Towards Global Optimization","first-page":"96","article-title":"Two implementations of Branin's method: Numerical experiences","author":"Gomulka","year":"1975"},{"key":"10.1016\/S0169-7161(05)80131-2_bib110","series-title":"Progress in Mathematical Programming","first-page":"1","article-title":"An algorithm for solving linear programming problems in O(n3L) operations","author":"Gonzaga","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib111","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00933463","article-title":"Sequential gradient-restoration algorithm for optimal control problems with general boundary conditions","volume":"26","author":"Gonzalez","year":"1978","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib112","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0611026","article-title":"Affine pseudomonotone mappings and the linear complementarity problem","volume":"11","author":"Gowda","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib113","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00933356","article-title":"Generalized descent for global optimization","volume":"34","author":"Griewank","year":"1981","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib114","series-title":"Mathematical Programming: Recent Developments and Applications","first-page":"83","article-title":"On automatic differentiation","author":"Griewank","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib115","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","article-title":"A nonmonotone line search technique for Newton's method","volume":"23","author":"Grippo","year":"1986","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib116","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF00939336","article-title":"A note on a quadratic formulation for linear complementarity problems","volume":"57","author":"Gupta","year":"1988","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib117","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00939044","article-title":"Dual techniques for constrained optimization","volume":"55","author":"Hager","year":"1987","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib118","series-title":"Applied Numerical Linear Algebra","author":"Hager","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib119","series-title":"Proc. 28th IEEE Conf. on Decision and Control","first-page":"364","article-title":"Dual techniques for constrained optimization, II","author":"Hager","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib120","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/1031049","article-title":"Updating the inverse of a matrix","volume":"31","author":"Hager","year":"1989","journal-title":"SIAM Rev."},{"key":"10.1016\/S0169-7161(05)80131-2_bib121","series-title":"Dual techniques for constrained optimization, II","author":"Hager","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib122","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/0898-1221(89)90177-6","article-title":"A derivative-based bracketing scheme for univariate minimization","volume":"18","author":"Hager","year":"1990","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib123","series-title":"Advances in Optimization and Parallel Computing","first-page":"137","article-title":"The dual active set algorithm","author":"Hager","year":"1992"},{"key":"10.1016\/S0169-7161(05)80131-2_bib124","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00248762","article-title":"The dual active set algorithm and quadratic networks","volume":"1","author":"Hager","year":"1993","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib125","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF00940067","article-title":"Active constraints, indefinite quadratic test problems and complexity","volume":"68","author":"Hager","year":"1991","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib126","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1137\/0325037","article-title":"Dual techniques for minimax","volume":"25","author":"Hager","year":"1987","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib127","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","article-title":"Superlinearly convergent variable metric algorithms for general non-linear programming problems","volume":"11","author":"Han","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib128","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","article-title":"A globally convergent method for nonlinear programming","volume":"22","author":"Han","year":"1977","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib129","series-title":"Towards Global Optimization","article-title":"An implemented extension of Branin's method","author":"Hardy","year":"1975"},{"key":"10.1016\/S0169-7161(05)80131-2_bib130","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(89)90059-X","article-title":"Lagrangian dual ascent by generalized linear programming","volume":"8","author":"Hearn","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0169-7161(05)80131-2_bib131","series-title":"Proc. 28th IEEE Conf. on Decision and Control","article-title":"Generalized linear programming with line searches","author":"Hearn","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib132","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","article-title":"Multiplier and gradient methods","volume":"4","author":"Hestenes","year":"1969","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib133","series-title":"Conjugate-Direction Methods in Optimization","author":"Hestenes","year":"1980"},{"key":"10.1016\/S0169-7161(05)80131-2_bib134","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/S0169-7161(05)80131-2_bib135","series-title":"Applied Nonlinear Programming","author":"Himmelblau","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib136","first-page":"37","article-title":"Generalized differentiability, duality and optimization for problems dealing with differences of convex functions","volume":"Vol. 256","author":"Hiriart-Urruty","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib137","series-title":"Fermat Days 1985: Mathematics for Optimization","first-page":"157","article-title":"A new set-valued second order derivative for convex functions","author":"Hiriart-Urruty","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib138","article-title":"n-Step quadratic convergence in the conjugate gradient method","author":"Hirst","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib139","series-title":"Test Examples for Nonlinear Programming Codes","author":"Hock","year":"1980"},{"key":"10.1016\/S0169-7161(05)80131-2_bib140","series-title":"Parallel Computers: Architecture, Programming and Algorithms","author":"Hockney","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib141","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0169-7161(05)80131-2_bib142","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00939825","article-title":"A general class of branch and bound methods in global optimization with some new approaches for concave minimization","volume":"51","author":"Horst","year":"1986","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib143","series-title":"Application to concave minimization, reverse convex constraints, DC-programming and Lipschitzian optimization","first-page":"11","article-title":"Deterministic global optimization with partition sets whose feasibility is not known","volume":"58","author":"Horst","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib144","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2","article-title":"Deterministic methods in constrained global optimization: Some recent advances and new fields of application","volume":"37","author":"Horst","year":"1990","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0169-7161(05)80131-2_bib145","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02283684","article-title":"On solving general reverse convex programming problems by a sequence of linear programs and line searches","volume":"25","author":"Horst","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib146","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00119991","article-title":"On solving a D.C. programming problem by a sequence of linear programs","volume":"1","author":"Horst","year":"1991","journal-title":"J. Global Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib147","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00939776","article-title":"Branch and bound methods for solving systems of Lipschitzian equations and inequalities","volume":"58","author":"Horst","year":"1988","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib148","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02239754","article-title":"Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems","volume":"42","author":"Horst","year":"1989","journal-title":"Computing"},{"key":"10.1016\/S0169-7161(05)80131-2_bib149","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01594938","article-title":"Concave minimization via conical partitions and polyhedral outer approximation","volume":"50","author":"Horst","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib150","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/02331938908843440","article-title":"On an outer approximation concept in global optimization","volume":"20","author":"Horst","year":"1989","journal-title":"Optimization"},{"key":"10.1016\/S0169-7161(05)80131-2_bib151","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00939434","article-title":"On the convergence of global methods in multiextremal optimization","volume":"54","author":"Horst","year":"1987","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib152","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580762","article-title":"Convergence and restart in branch and bound algorithms for global optimization, application to concave minimization and D. C. optimization","volume":"41","author":"Horst","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib153","series-title":"Global Optimization \u2014 Deterministic Approaches","author":"Horst","year":"1992"},{"key":"10.1016\/S0169-7161(05)80131-2_bib154","article-title":"GRESS version 0.0 users manual","author":"Horwedel","year":"1988","journal-title":"Oak Ridge National Laboratory, Report ORNL\/TM 10835"},{"key":"10.1016\/S0169-7161(05)80131-2_bib155","article-title":"Methods of fast automatic differentiation and applications","author":"Iris","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib156","series-title":"The Characteristics of Parallel Algorithms","author":"Jamieson","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib157","series-title":"Nonlinear Optimization in \u211dn","author":"Jongen","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib158","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1978","journal-title":"Combinatorica"},{"key":"10.1016\/S0169-7161(05)80131-2_bib159","first-page":"703","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"SIAM J."},{"key":"10.1016\/S0169-7161(05)80131-2_bib160","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib161","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","article-title":"Polynomial algorithms in linear programming","volume":"20","author":"Khachian","year":"1980","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0169-7161(05)80131-2_bib162","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0169-7161(05)80131-2_bib163","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","article-title":"An aggregate subgradient method for nonsmooth convex minimization","volume":"27","author":"Kiwiel","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib164","article-title":"Methods of Descent for Nondifferentiable Optimization","volume":"Vol. 1133","author":"Kiwiel","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib165","series-title":"Mathematical Programming: Recent Developments and Applications","first-page":"263","article-title":"A survey of bundle methods for nondifferentiable optimization","author":"Kiwiel","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib166","series-title":"Inequalities III","first-page":"159","article-title":"How good is the simplex algorithm?","author":"Klee","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib167","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0310040","article-title":"Efficient implementations of the Polak-Ribi\u00e8re conjugate gradient algorithm","volume":"10","author":"Klessig","year":"1972","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0169-7161(05)80131-2_bib168","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib169","first-page":"1108","article-title":"Polynomial solvability of convex quadratic programming","volume":"20","author":"Kozlov","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib170","series-title":"Computational Complexity of Sequential and Parallel Algorithms","author":"Kronsjo","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib171","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00933349","article-title":"On the existence and nonexistence of Lagrange multipliers in Banach spaces","volume":"20","author":"Kurcyusz","year":"1976","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib172","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","article-title":"An extension of Davidon's methods to nondifferentiable problems","volume":"3","author":"Lemar\u00e9chal","year":"1975","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0169-7161(05)80131-2_bib173","series-title":"Abstracts, IX Internat. Sympos. on Mathematical Programming","first-page":"158","article-title":"Combining Kelley's and conjugate gradient methods","author":"Lemar\u00e9chal","year":"1976"},{"key":"10.1016\/S0169-7161(05)80131-2_bib174","article-title":"Nonsmooth optimization and descent methods","author":"Lemar\u00e9chal","year":"1978"},{"key":"10.1016\/S0169-7161(05)80131-2_bib175","series-title":"Optimization","first-page":"529","article-title":"Nondifferentiable optimization","volume":"Vol. 1","author":"Lemar\u00e9chal","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib176","series-title":"Nondifferentiable Optimization","first-page":"25","article-title":"Bundle methods, cutting plane algorithms and \u03c3-Newton directions","volume":"Vol. 255","author":"Lemar\u00e9chal","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib177","first-page":"245","article-title":"On a bundle algorithm for nonsmooth optimization","volume":"Vol. 4","author":"Lemar\u00e9chal","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib178","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01448379","article-title":"Some remarks on the construction of higher order algorithms for convex optimization","volume":"10","author":"Lemar\u00e9chal","year":"1983","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib179","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/mnsc.8.4.442","article-title":"A method of solution for quadratic programs","volume":"8","author":"Lemke","year":"1962","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib180","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01584673","article-title":"Practical convergence conditions for unconstrained minimization","volume":"4","author":"Lenard","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib181","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01580652","article-title":"Convergence conditions for restarted conjugate gradient methods with inaccurate line searches","volume":"10","author":"Lenard","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib182","first-page":"286","article-title":"On an algorithm for the minimization of convex functions","volume":"6","author":"Levin","year":"1965","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib183","series-title":"Modeling and Optimization with GINO","author":"Liebman","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib184","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0325023","article-title":"Iterative methods for large convex quadratic programs: A survey","volume":"25","author":"Lin","year":"1987","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib185","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-8191(88)90080-4","article-title":"State-of-the-art in parallel nonlinear programming","volume":"6","author":"Lootsma","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/S0169-7161(05)80131-2_bib186","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TAC.1970.1099557","article-title":"Control problems with kinks","volume":"15","author":"Luenberger","year":"1970","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0169-7161(05)80131-2_bib187","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00933591","article-title":"Convergence rate of a penalty-function scheme","volume":"7","author":"Luenberger","year":"1971","journal-title":"J Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib188","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1287\/mnsc.18.11.620","article-title":"The gradient projection method along geodesics","volume":"18","author":"Luenberger","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib189","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib190","series-title":"Nonlinear Programming","author":"Mangasarian","year":"1969"},{"key":"10.1016\/S0169-7161(05)80131-2_bib191","article-title":"Exact penalty function algorithms for finite dimensional and control optimization problems","author":"Maratos","year":"1978"},{"key":"10.1016\/S0169-7161(05)80131-2_bib192","series-title":"Mathematical Programming at Oberwolfach","first-page":"163","article-title":"First and second order sufficient optimality conditions in mathematical programming and optimal control","volume":"Vol. 14","author":"Maurer","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib193","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01582096","article-title":"First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems","volume":"16","author":"Maurer","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib194","series-title":"Algorithms for Constrained Minimization of Smooth Nonlinear Functions","first-page":"45","article-title":"A superlinearly convergent algorithm for constrained optimization problems","volume":"Vol. 16","author":"Mayne","year":"1982"},{"key":"10.1016\/S0169-7161(05)80131-2_bib195","series-title":"Nonlinear Programming: Theory, Algorithms, and Applications","author":"McCormick","year":"1983"},{"key":"10.1016\/S0169-7161(05)80131-2_bib196","series-title":"Advances in Economic Theory","first-page":"225","article-title":"On the complexity of linear programming","author":"Megiddo","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib197","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/BF00935541","article-title":"Sequential gradient-restoration algorithm for optimal control problems with nondifferential constraints","volume":"13","author":"Miele","year":"1974","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib198","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF00927913","article-title":"Sequential gradient-restoration algorithm for optimal control problems","volume":"5","author":"Miele","year":"1970","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib199","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0022-247X(86)90142-3","article-title":"Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems","volume":"119","author":"Miele","year":"1986","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib200","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0094-5765(86)90028-7","article-title":"Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems","volume":"13","author":"Miele","year":"1986","journal-title":"Acta Astronaut."},{"key":"10.1016\/S0169-7161(05)80131-2_bib201","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01582105","article-title":"A stable method for solving certain constrained least squares problems","volume":"16","author":"Mifflin","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib202","first-page":"77","article-title":"A modification and extension of Lemar\u00e9chal's algorithm for nonsmooth minimization","volume":"Vol. 17","author":"Mifflin","year":"1982"},{"key":"10.1016\/S0169-7161(05)80131-2_bib203","series-title":"Bayesian Approach to Global Optimization","author":"Mockus","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib204","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","article-title":"Testing unconstrained optimization software","volume":"7","author":"Mor\u00e9","year":"1981","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0169-7161(05)80131-2_bib205","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","article-title":"Computing a trust region step","volume":"4","author":"Mor\u00e9","year":"1983","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0169-7161(05)80131-2_bib206","series-title":"Studies in Numerical Analysis","first-page":"29","article-title":"Newton's method","author":"Mor\u00e9","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib207","article-title":"An algorithm for finding a local minimum of an indefinite quadratic program","author":"Murray","year":"1971"},{"key":"10.1016\/S0169-7161(05)80131-2_bib208","article-title":"MINOS 5.0 user's guide","author":"Murtagh","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib209","series-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"Murty","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib210","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","article-title":"Some NP-complete problems in quadratic and nonlinear programming","volume":"39","author":"Murty","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib211","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovskii","year":"1983"},{"key":"10.1016\/S0169-7161(05)80131-2_bib212","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1137\/0722050","article-title":"Projected Hessian updating algorithms for nonlinearly constrained optimization","volume":"22","author":"Nocedal","year":"1985","journal-title":"SIAM. J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib213","series-title":"Finite Algorithms in Optimization and Data Analysis","author":"Osborne","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib214","article-title":"Avoiding the Maratos effect by means of a nonmonotone linear search: I. General constrained problems","author":"Panier","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib215","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/328512.328516","article-title":"Generation of large-scale quadratic programs for use as global optimization test problems","volume":"13","author":"Pardalos","year":"1987","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0169-7161(05)80131-2_bib216","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02239972","article-title":"Global minimization of indefinite quadratic problems","volume":"39","author":"Pardalos","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0169-7161(05)80131-2_bib217","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","article-title":"An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds","volume":"46","author":"Pardalos","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib218","series-title":"Topics in Parallel Computing in Mathematical Programming","author":"Pardalos","year":"1993"},{"key":"10.1016\/S0169-7161(05)80131-2_bib219","article-title":"Constrained Global Optimization: Algorithms and Applications","volume":"Vol. 268","author":"Pardalos","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib220","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0909022","article-title":"Global optimization approach to the linear complementarity problem","volume":"9","author":"Pardalos","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0169-7161(05)80131-2_bib221","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","article-title":"Checking local optimality in constrained quadratic programming is NP-hard","volume":"7","author":"Pardalos","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0169-7161(05)80131-2_bib222","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","article-title":"Quadratic programming with one negative eigenvalue is NP-hard","volume":"1","author":"Pardalos","year":"1991","journal-title":"J. Global Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib223","series-title":"Analysis and Optimization of Systems","first-page":"413","article-title":"An interior-point algorithm for large-scale quadratic problems with box constraints","volume":"Vol. 144","author":"Pardalos","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib224","series-title":"Computer Architecture: A Quantitative Approach","author":"Patterson","year":"1990"},{"key":"10.1016\/S0169-7161(05)80131-2_bib225","article-title":"A parallel algorithm for constrained concave quadratic global minimization: Computational aspects","author":"Phillips","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib226","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0706028","article-title":"An exact potential method for constrained maxima","volume":"6","author":"Pietrzykowski","year":"1969","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib227","first-page":"35","article-title":"Note sur la convergence de methods de directions conjugres","volume":"16","author":"Polak","year":"1969","journal-title":"Rev. Franc. Inform. Rech. Op\u00e9r."},{"key":"10.1016\/S0169-7161(05)80131-2_bib228","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0041-5553(74)90004-4","article-title":"The method of penalty estimates for conditional extremum problems","volume":"13","author":"Polyak","year":"1973","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0169-7161(05)80131-2_bib229","first-page":"593","article-title":"A general method for solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Soviet Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib230","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(71)90094-2","article-title":"The convergence rate of the penalty function method","volume":"11","author":"Polyak","year":"1971","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0169-7161(05)80131-2_bib231","series-title":"Optimization","first-page":"283","article-title":"A method for nonlinear constraints in minimization problems","author":"Powell","year":"1969"},{"key":"10.1016\/S0169-7161(05)80131-2_bib232","series-title":"Nonlinear programming","article-title":"A new algorithm for unconstrained optimization","author":"Powell","year":"1970"},{"key":"10.1016\/S0169-7161(05)80131-2_bib233","first-page":"122","article-title":"Nonconvex minimization calculations and the conjugate gradient method","volume":"Vol. 1066","author":"Powell","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib234","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","article-title":"Convergence properties of algorithms for nonlinear optimization","volume":"28","author":"Powell","year":"1986","journal-title":"SIAM Rev."},{"key":"10.1016\/S0169-7161(05)80131-2_bib235","article-title":"A trust region algorithm for equality constrained optimization","author":"Powell","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib236","series-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib237","series-title":"New Computer Methods for Global Optimization","author":"Ratschek","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib238","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02592070","article-title":"Stochastic global optimization methods, part I: Clustering methods","volume":"39","author":"Rinnooy Kan","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib239","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02592071","article-title":"Stochastic global optimization methods, part II: Multi-level methods","volume":"39","author":"Rinnooy Kan","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib240","series-title":"Optimization","first-page":"631","article-title":"Global optimization","volume":"Vol. 1","author":"Rinnooy Kan","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib241","series-title":"Order Restricted Statistical Inference","author":"Robertson","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib242","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01584986","article-title":"A quadrically-convergent algorithm for general nonlinear programming problems","volume":"3","author":"Robinson","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib243","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01585500","article-title":"Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms","volume":"7","author":"Robinson","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib244","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/S0169-7161(05)80131-2_bib245","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0312021","article-title":"Augmented Lagrange multiplier functions and duality in nonconvex programming","volume":"12","author":"Rockafellar","year":"1974","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0169-7161(05)80131-2_bib246","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","article-title":"The gradient projection method for nonlinear programming, Part 1: Linear constraints","volume":"8","author":"Rosen","year":"1960","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib247","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0109044","article-title":"The gradient projection method for nonlinear programming, Part 2: Nonlinear constraints","volume":"9","author":"Rosen","year":"1961","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib248","series-title":"Numerical Methods for Non-linear Optimization","first-page":"297","article-title":"A gradient projection algorithm for non-linear constraints","author":"Rosen","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib249","article-title":"A quadratically convergent Lagrangian algorithm for nonlinear constraints","author":"Rosen","year":"1972"},{"key":"10.1016\/S0169-7161(05)80131-2_bib250","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01580581","article-title":"Global minimization of large-scale constrained concave quadratic problems by separable programming","volume":"34","author":"Rosen","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib251","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/mnsc.32.3.360","article-title":"Extending planning languages to include optimization capabilities","volume":"32","author":"Roy","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib252","series-title":"Simulation and the Monte Carlo Method","author":"Rubinstein","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib253","series-title":"Introduction to Numerical Methods for Parallel Computers","author":"Schendel","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib254","series-title":"Computational Mathematical Programming","first-page":"383","article-title":"Software for mathematical programming","volume":"Vol. F15","author":"Schittkowski","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib255","first-page":"19","article-title":"EMP: An expert system for mathematical programming","volume":"13","author":"Schittkowski","year":"1985","journal-title":"COAL Newslett."},{"key":"10.1016\/S0169-7161(05)80131-2_bib256","series-title":"More Test Examples for Nonlinear Programming Codes","author":"Schittkowski","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib257","series-title":"Linear, Integer and Quadratic Programming with LINDO","author":"Schrage","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib258","series-title":"PhD. dissertation","article-title":"Analyse du second ordre de probl\u00e8mes non diff\u00e8rentiables","author":"Seeger","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib259","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/mnsc.33.3.301","article-title":"The efficiency of the simplex method: A survey","volume":"33","author":"Sharmir","year":"1987","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib260","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","article-title":"Conditioning of quasi-Newton methods for function minimization","volume":"24","author":"Shanno","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/S0169-7161(05)80131-2_bib261","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","article-title":"Conjugate gradient methods with inexact searches","volume":"3","author":"Shanno","year":"1978","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib262","article-title":"Optimization with Disjunctive Constraints","volume":"Vol. 181","author":"Sherali","year":"1980"},{"key":"10.1016\/S0169-7161(05)80131-2_bib263","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF02341816","article-title":"Utilization of the operation of space dilatation in the minimization of convex functions","volume":"6","author":"Shor","year":"1970","journal-title":"Cybernetics"},{"key":"10.1016\/S0169-7161(05)80131-2_bib264","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BF01070506","article-title":"Convergence rate of the gradient descent method with dilatation of the space","volume":"6","author":"Shor","year":"1970","journal-title":"Cybernetics"},{"key":"10.1016\/S0169-7161(05)80131-2_bib265","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","article-title":"Cut-off method with space extension in convex programming problems","volume":"13","author":"Shor","year":"1977","journal-title":"Cybernetics"},{"key":"10.1016\/S0169-7161(05)80131-2_bib266","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1007\/BF01068854","article-title":"New development trends in nondifferentiable optimization","volume":"13","author":"Shor","year":"1977","journal-title":"Cybernetics"},{"key":"10.1016\/S0169-7161(05)80131-2_bib267","series-title":"Minimization Methods for Nondifferentiable Functions","author":"Shor","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib268","series-title":"PhD. dissertation","article-title":"Compiling fast partial derivatives of functions given by algorithms","author":"Speelpenning","year":"1980"},{"key":"10.1016\/S0169-7161(05)80131-2_bib269","first-page":"1","article-title":"Kernel polynomials in linear algebra and their numerical applications","volume":"49","author":"Stiefel","year":"1958","journal-title":"Nat. Bur. Standards Appl. Math. Ser."},{"key":"10.1016\/S0169-7161(05)80131-2_bib270","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/0708038","article-title":"On the numerical solution of constrained least-squares problems","volume":"8","author":"Stoer","year":"1971","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib271","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01389973","article-title":"On the relation between quadratic termination and convergence properties of minimization algorithms, Part I","volume":"28","author":"Stoer","year":"1977","journal-title":"Numer. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib272","series-title":"Linear Algebra and Its Applications","author":"Strang","year":"1980"},{"key":"10.1016\/S0169-7161(05)80131-2_bib273","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib274","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00933161","article-title":"Diagonalized multiplier methods and quasi-Newton methods for constrained optimization","volume":"22","author":"Tapia","year":"1977","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib275","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/S0025-5718-1988-0942149-3","article-title":"On secant updates for use in general constrained optimization","volume":"51","author":"Tapia","year":"1988","journal-title":"Math. Comp."},{"key":"10.1016\/S0169-7161(05)80131-2_bib276","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"35","author":"Tardos","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib277","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF03167774","article-title":"Global optimization under Lipschitzian constraints","volume":"4","author":"Thach","year":"1987","journal-title":"Japan. J. Appl. Math."},{"key":"10.1016\/S0169-7161(05)80131-2_bib278","series-title":"PhD. dissertation","article-title":"Global Optimization: A Stochastic Approach","author":"Timmer","year":"1984"},{"key":"10.1016\/S0169-7161(05)80131-2_bib279","first-page":"49","article-title":"A search clustering approach to global optimization","volume":"Vol. 2","author":"Toern","year":"1978"},{"key":"10.1016\/S0169-7161(05)80131-2_bib280","article-title":"Global Optimization","volume":"Vol. 350","author":"Toern","year":"1989"},{"key":"10.1016\/S0169-7161(05)80131-2_bib281","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1093\/imanum\/8.2.231","article-title":"Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space","volume":"8","author":"Toint","year":"1988","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib282","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01582254","article-title":"On large scale nonlinear network optimization","volume":"48","author":"Toint","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib283","series-title":"Fermat Days 1985: Mathematics for Optimization","article-title":"A general deterministic approach to global optimization via D. C. programming","author":"Tuy","year":"1986"},{"key":"10.1016\/S0169-7161(05)80131-2_bib284","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF00938217","article-title":"Convex programs with an additional reverse convex constraint","volume":"52","author":"Tuy","year":"1987","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0169-7161(05)80131-2_bib285","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","article-title":"An algorithm for linear programming which requires O(((m + n)n2 + (m + n)1.5n)L) arithmetic operations","volume":"47","author":"Vaidya","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib286","series-title":"Contributions to the Calculus of Variations","first-page":"407","article-title":"The problem of Lagrange with differential inequalities as added side conditions","author":"Valentine","year":"1937"},{"key":"10.1016\/S0169-7161(05)80131-2_bib287","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1057\/jors.1964.60","article-title":"The simplex and dual method for quadratic programming","volume":"15","author":"Van de Panne","year":"1964","journal-title":"Oper. Res. Quart."},{"key":"10.1016\/S0169-7161(05)80131-2_bib288","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","article-title":"A modification of Karmarkar's linear programming algorithm","volume":"1","author":"Vanderbei","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0169-7161(05)80131-2_bib289","series-title":"Theoretical and Computational Aspects of Simulated Annealing","author":"Van Laarhoven","year":"1988"},{"key":"10.1016\/S0169-7161(05)80131-2_bib290","series-title":"Simulated Annealing: Theory and Applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/S0169-7161(05)80131-2_bib291","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0722035","article-title":"A trust region algorithm for equality constrained minimization: Convergence properties and implementation","volume":"22","author":"Vardi","year":"1985","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0169-7161(05)80131-2_bib292","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1287\/opre.35.4.489","article-title":"The status of nonlinear programming software: An update","volume":"35","author":"Waren","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80131-2_bib293","series-title":"PhD dissertation","article-title":"A simplicial algorithm for concave programming","author":"Wilson","year":"1963"},{"key":"10.1016\/S0169-7161(05)80131-2_bib294","series-title":"Nonlinear Programming","first-page":"97","article-title":"Methods of nonlinear programming","author":"Wolfe","year":"1967"},{"key":"10.1016\/S0169-7161(05)80131-2_bib295","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","article-title":"Convergence conditions for ascent methods","volume":"11","author":"Wolfe","year":"1969","journal-title":"SIAM Rev."},{"key":"10.1016\/S0169-7161(05)80131-2_bib296","series-title":"Integer and Nonlinear Programming","first-page":"1","article-title":"Convergence theory in nonlinear programming","author":"Wolfe","year":"1970"},{"key":"10.1016\/S0169-7161(05)80131-2_bib297","series-title":"Nondifferentiable Optimization","first-page":"145","article-title":"A method of conjugate subgradients for minimizing nondifferentiable functions","volume":"Vol. 3","author":"Wolfe","year":"1975"},{"key":"10.1016\/S0169-7161(05)80131-2_bib298","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/356012.356013","article-title":"Checking the calculation of gradients","volume":"8","author":"Wolfe","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0169-7161(05)80131-2_bib299","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction algorithm for linear programming","volume":"50","author":"Ye","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib300","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","article-title":"An extension of Karmarkar's algorithm for convex quadratic programming","volume":"44","author":"Ye","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80131-2_bib301","first-page":"3","article-title":"Estimation of the informational complexity of mathematical programming problems","volume":"13","author":"Yudin","year":"1977","journal-title":"Matekon"},{"key":"10.1016\/S0169-7161(05)80131-2_bib302","first-page":"25","article-title":"Informational complexity and efficient methods for the solution of convex extremal problems","volume":"13","author":"Yudin","year":"1977","journal-title":"Matekon"},{"key":"10.1016\/S0169-7161(05)80131-2_bib303","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","article-title":"Non-linear programming via penalty functions","volume":"13","author":"Zangwill","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80131-2_bib304","series-title":"Nonlinear Programming: A Unified Approach","author":"Zangwill","year":"1969"},{"key":"10.1016\/S0169-7161(05)80131-2_bib305","series-title":"Pathways to Solutions, Fixed Points and Equilibria","author":"Zangwill","year":"1981"},{"key":"10.1016\/S0169-7161(05)80131-2_bib306","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/ijoc.1.1.20","article-title":"Parallel numerical optimization: Current status and an annotated bibliography","volume":"1","author":"Zenios","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0169-7161(05)80131-2_bib307","series-title":"Integer and Nonlinear Programming","first-page":"37","article-title":"Nonlinear programming, computational methods","author":"Zoutendijk","year":"1970"},{"key":"10.1016\/S0169-7161(05)80131-2_bib308","series-title":"Computational Mathematical Programming","first-page":"323","article-title":"Nondifferentiable Optimization","author":"Zowe","year":"1985"},{"key":"10.1016\/S0169-7161(05)80131-2_bib309","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01442543","article-title":"Regularity and stability for the mathematical programming problem in Banach spaces","volume":"5","author":"Zowe","year":"1979","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/S0169-7161(05)80131-2_bib310","series-title":"Numerical Optimization, Algorithm and Software Guide","author":"Mor\u00e9","year":"1992"}],"container-title":["Handbook of Statistics","Computational Statistics"],"original-title":[],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T00:31:27Z","timestamp":1706142687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169716105801312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9780444880963"],"references-count":311,"URL":"https:\/\/doi.org\/10.1016\/s0169-7161(05)80131-2","relation":{},"ISSN":["0169-7161"],"issn-type":[{"value":"0169-7161","type":"print"}],"subject":[],"published":{"date-parts":[[1993]]}}}