{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T03:28:43Z","timestamp":1775964523055,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1007\/bf01198402","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:38:23Z","timestamp":1108726703000},"page":"355-400","source":"Crossref","is-referenced-by-count":108,"title":["A new technique for inconsistent QP problems in the SQP method"],"prefix":"10.1007","volume":"47","author":[{"given":"P.","family":"Spellucci","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-247X(89)90111-X","volume":"139","author":"JV Burke","year":"1989","unstructured":"Burke JV (1989) A sequential quadratic programming algorithm for potentially infeasible mathematical programs. J. Math. Anal. Applies 139:319?351","journal-title":"J. Math. Anal. Applies"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1137\/0802016","volume":"2","author":"JV Burke","year":"1992","unstructured":"Burke JV (1992) A robust trust region algorithm for constrained nonlinear programming problems. SIOPT 2:325?347","journal-title":"SIOPT"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0329054","volume":"29","author":"JV Burke","year":"1991","unstructured":"Burke JV (1991) An exact penalization viewpoint of constrained optimization. SIAM J. Control and Optimization 29:968?998","journal-title":"SIAM J. Control and Optimization"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01582294","volume":"43","author":"JV Burke","year":"1989","unstructured":"Burke JV, Han SP (1989) A robust sequential quadratic programming method. Math. Prog. 43:277?303","journal-title":"Math. Prog."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0802012","volume":"2","author":"RH Byrd","year":"1992","unstructured":"Byrd RH, Tapia RA, Zhang Y (1992) An SQP augmented Lagrangian BFGS algorithm for constrained optimization. SIOPT 2:210?241","journal-title":"SIOPT"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd RH, Nocedal J, Schnabel B (1994) Representations of quasi-Newton-matrices and their use in limited memory methods. Math. Prog. 63:129?156","journal-title":"Math. Prog."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BF01582123","volume":"16","author":"RM Chamberlain","year":"1979","unstructured":"Chamberlain RM (1979) Some examples of cycling in variable metric methods for constrained minimization. Math. Prog. 16:378?383","journal-title":"Math. Prog."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"RM Chamberlain","year":"1982","unstructured":"Chamberlain RM, Powell MDJ, Lemarechal C, Petersen HC (1982) The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Prog. Study 16:1?17","journal-title":"Math. Prog. Study"},{"key":"CR9","volume-title":"Optimization and nonsmooth analysis","author":"FH Clarke","year":"1987","unstructured":"Clarke FH (1987) Optimization and nonsmooth analysis, John Wiley, New York"},{"key":"CR10","unstructured":"Conn AR, Sinclair JW Quadratic programming via a non-differentiable penalty function. Univ. of Waterloo Dept. of Combinatorics and Optimization report CORR 75\/15"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01580110","volume":"5","author":"JW Daniel","year":"1973","unstructured":"Daniel JW (1973) Stability of definite quadratic programs. Math. Prog. 5:41?53","journal-title":"Math. Prog."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF01580667","volume":"10","author":"RS Dembo","year":"1976","unstructured":"Dembo RS (1976) A set of geometric programming test problems and their solutions. Math. Prog. 10:192?213","journal-title":"Math. Prog."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF02192134","volume":"87","author":"MM El-Alem","year":"1995","unstructured":"El-Alem MM (1995) Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization. J.O.T.A. 87:563?577","journal-title":"J.O.T.A."},{"key":"CR14","unstructured":"Felkel R (1996) An interior point method for large scale QP problems. THD Mathematics Department Report 1850"},{"key":"CR15","first-page":"67","volume":"17","author":"R Fletcher","year":"1982","unstructured":"Fletcher R (1982) A model algorithm for composite nondifferentiable optimization problems. Math. Prog. 17:67?76","journal-title":"Math. Prog."},{"key":"CR16","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical methods of optimization. 2nd ed, Wiley, Chicester-New York","edition":"2nd ed"},{"key":"CR17","volume-title":"85-114 in Lect. Notes on Math. 912","author":"R Fletcher","year":"1981","unstructured":"Fletcher R (1981) Second order correction for nondifferentiable optimization. 85-114 in Lect. Notes on Math. 912, Springer, Berlin Heidelberg New York"},{"key":"CR18","volume-title":"Numerical optimization","author":"R Fletcher","year":"1984","unstructured":"Fletcher R (1984) Al 1 penalty method for nonlinear constraints. In: Boggs PT, Byrd RH, Schnabel RB (eds.) Numerical optimization, SIAM Publications, Philadelphia"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0804018","volume":"4","author":"A Friedlander","year":"1994","unstructured":"Friedlander A, Martinez JM, Santos SA (1994) On the resolution of linearly constrained convex minimization problems. SIOPT 4:331?339","journal-title":"SIOPT"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"PhE Gill","year":"1978","unstructured":"Gill PhE, Murray W (1978) Numerically stable methods for quadratic programming. Math. Prog. 14:349?372","journal-title":"Math. Prog."},{"key":"CR21","volume-title":"Practical methods of optimization","author":"PhE Gill","year":"1980","unstructured":"Gill PhE, Murray W, Wright MH (1980) Practical methods of optimization. Acad. Press, New York"},{"key":"CR22","first-page":"101","volume-title":"Advances in optimization and parallel computing","author":"PhE Gill","year":"1992","unstructured":"Gill PhE, Murray W, Saunders M, Wright MH (1992) Some theoretical properties of an augmented Lagrangian merit function. In: Pardalos PM (ed.) Advances in optimization and parallel computing, North Holland, Amsterdam, pp. 101?128"},{"key":"CR23","unstructured":"Gill PhE, Hammarling S, Murray W, Saunders M, Wright, MH (1986) Users guide for NPSOL (Version 4.0). Dept. O.R. Stanford Univ. Rep. SOL 86-2"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D Goldfarb","year":"1983","unstructured":"Goldfarb D, Idnani A (1983) A numerically stable dual method for solving strictly convex quadratic programs. Math. Prog. 27:1?33","journal-title":"Math. Prog."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/imanum\/11.3.299","volume":"11","author":"NIM Gould","year":"1991","unstructured":"Gould NIM (1991) An algorithm for large scale quadratic programming. I.M.A.J. Numer. Anal. 11:299?323","journal-title":"I.M.A.J. Numer. Anal."},{"key":"CR26","volume-title":"Applied nonlinear programming","author":"DM Himmelblau","year":"1972","unstructured":"Himmelblau DM (1972) Applied nonlinear programming. McGraw-Hill, New York"},{"key":"CR27","volume-title":"Lect. Not. in Econ. and Math. Syst. 187","author":"W Hock","year":"1981","unstructured":"Hock W, Schittkowski K (1981) Test examples for nonlinear programming codes. Lect. Not. in Econ. and Math. Syst. 187, Springer, Berlin Heidelberg New York"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789408805575","volume":"4","author":"J Heinz","year":"1994","unstructured":"Heinz J, Spellucci P (1994) A successful implementation of the Pantoja-Mayne SQP- method. Optimization Methods and Software 4:1?28","journal-title":"Optimization Methods and Software"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02252984","volume":"53","author":"C Kanzow","year":"1994","unstructured":"Kanzow C (1994) An unconstrained optimization technique for large-scale linearly constrained convex minimization problems. Computing 53:101?117","journal-title":"Computing"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF00939685","volume":"58","author":"S Lucidi","year":"1988","unstructured":"Lucidi S (1988) New results on a class of exact augmented Lagrangians. J.O.T.A. 58:259?282","journal-title":"J.O.T.A."},{"key":"CR31","volume-title":"Introduction to linear and nonlinear programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger DG (1984) Introduction to linear and nonlinear programming. 2nd ed, Addison-Wesley, Menlo Park","edition":"2nd ed"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00938444","volume":"45","author":"DQ Mayne","year":"1985","unstructured":"Mayne DQ, Sahba M (1985) An efficient algorithm for solving inequalities. J.O.T.A. 45:407?423","journal-title":"J.O.T.A."},{"key":"CR33","volume-title":"Linear complementarity, linear and nonlinear programming","author":"KG Murty","year":"1988","unstructured":"Murty KG (1988) Linear complementarity, linear and nonlinear programming. Heldermann, Berlin"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1137\/0722050","volume":"22","author":"J Nocedal","year":"1985","unstructured":"Nocedal J, Overton M (1985) Projected Hessian updating alogorithms for nonlinearly constrained optimization. SINUM 22:821?850","journal-title":"SINUM"},{"key":"CR35","unstructured":"Nowak I (1988) Ein quadratisches Optimierungsproblem mit Schlupfvariablen f\u00fcr die SQP- Methode zur L\u00f6sung des allgemeinen nichtlinearen Optimierungsproblems. Diplomarbeit, TH Dannstadt"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF00940684","volume":"69","author":"DQ Mayne","year":"1991","unstructured":"Mayne DQ, Pantoja JFA (1991) Exact penalty function algorithm with simple updating of the penalty parameter J.O.T.A. 69:441?467","journal-title":"J.O.T.A."},{"key":"CR37","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/0728063","volume":"28","author":"ER Panier","year":"1991","unstructured":"Panier ER, Tits AL (1991) Avoiding the Maratos effect by means of a nonmonotone line search. I. general constrained problems. SINUM 28:1183?1195","journal-title":"SINUM"},{"key":"CR38","first-page":"144","volume-title":"Lecture Notes on Mathematics 630","author":"MJD Powell","year":"1978","unstructured":"Powell MJD (1978) A fast algorithm for nonlinearly constrained optimization calculations. Lecture Notes on Mathematics 630, Springer, Berlin Heidelberg New York, pp. 144?157"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF00941288","volume":"52","author":"M Sahba","year":"1987","unstructured":"Sahba M (1987) Globally convergent algorithm for nonlinearly constrained optimization problems. J.O.T.A. 52:291?309","journal-title":"J.O.T.A."},{"key":"CR40","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01395811","volume":"38","author":"K Schittkowski","year":"1981","unstructured":"Schittkowski K (1981) The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function II. An efficient implementation using linear least squares sub-problems. Num. Math. 38:115?127","journal-title":"Num. Math."},{"key":"CR41","first-page":"197","volume":"14","author":"K Schittkowski","year":"1983","unstructured":"Schittkowski K (1983) On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function. Optimization 14:197?216","journal-title":"Optimization"},{"key":"CR42","volume-title":"Lect. Not. in Econ. and Math. Syst. 282","author":"K Schittkowski","year":"1987","unstructured":"Schittkowski K (1987) More testexamples for nonlinear programming codes. Lect. Not. in Econ. and Math. Syst. 282, Springer, Berlin Heidelberg New York"},{"key":"CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7214-0","volume-title":"Numerische Verfahren der nichtlinearen Optimierung","author":"P Spellucci","year":"1993","unstructured":"Spellucci P (1993) Numerische Verfahren der nichtlinearen Optimierung. Birkh\u00e4user, Basel"},{"key":"CR44","unstructured":"Spellucci P (1993) A SQP method for general nonlinear programs using only equality constrained sub-problems. THD FB4 Preprint 1562, Submitted for publication"},{"key":"CR45","first-page":"183","volume-title":"Methods of Operation Research 53","author":"P Spellucci","year":"1985","unstructured":"Spellucci P (1985) Sequential quadratic programming: Theory, implementation, problems. In: Beckmann MJ, Gaede KW, Ritter K, Schneeweiss H (eds.) Methods of Operation Research 53, Anton Hain, Meisenheim, pp. 183?213"},{"key":"CR46","unstructured":"Spellucci P donlp2. Program and users guide available as donlp2.shar from netlib\/opt\/ donlp2"},{"key":"CR47","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF02592051","volume":"26","author":"K Tone","year":"1983","unstructured":"Tone K (1983) Revision of constraint approximations in the successive QP-method for nonlinear programming problems. Math. Prog. 26:144?152","journal-title":"Math. Prog."}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01198402.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01198402\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01198402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:13:15Z","timestamp":1734955995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01198402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["BF01198402"],"URL":"https:\/\/doi.org\/10.1007\/bf01198402","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}