{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:00:30Z","timestamp":1777118430413,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T00:00:00Z","timestamp":1361491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11075-012-9692-5","type":"journal-article","created":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T08:18:08Z","timestamp":1361434688000},"page":"1-22","source":"Crossref","is-referenced-by-count":19,"title":["A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization"],"prefix":"10.1007","volume":"65","author":[{"given":"Chun-ming","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-bao","family":"Jian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-ling","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,22]]},"reference":[{"key":"9692_CR1","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. SIAM J. Optim. 22, 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"key":"9692_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0024-3795(02)00260-4","volume":"351\/352","author":"JV Burke","year":"2002","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: Two numerical methods for optimizing matrix stability. Linear Algebra Appl. 351\/352, 147\u2013184 (2002)","journal-title":"Linear Algebra Appl."},{"key":"9692_CR3","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15, 751\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"key":"9692_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"AA Goldstein","year":"1977","unstructured":"Goldstein, A.A.: Optimization of Lipschitz continuous functions. Math. Program 13, 14\u201322 (1977)","journal-title":"Math. Program"},{"key":"9692_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics. Springer-Verlag, Berlin (1985)"},{"key":"9692_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"CA Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C.A., Solodov, M.V.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16, 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"9692_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 18, 379\u2013388 (2007)","journal-title":"SIAM J. Optim."},{"key":"9692_CR8","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1137\/090748408","volume":"20","author":"KC Kiwiel","year":"2010","unstructured":"Kiwiel, K.C.: A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 20, 1983\u20131994 (2010)","journal-title":"SIAM J. Optim."},{"key":"9692_CR9","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Que, X.: An adaptive gradient sampling algorithm for nonsmooth optimization. Optim. Method Softw. (2012). doi: 10.1080\/10556788.2012.714781","journal-title":"Optim. Method Softw."},{"key":"9692_CR10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/S0895479803433313","volume":"26","author":"JV Burke","year":"2004","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: Pseudospectral components and the distance to uncontrollability. SIAM J. Matrix Anal. Appl. 26, 350\u2013361 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9692_CR11","unstructured":"Lewis, A.S.: Local structure and algorithms in nonsmooth optimization. Optimization and Applications, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany (2005)"},{"key":"9692_CR12","first-page":"1","volume-title":"Sequential quadratic programming. Acta Numerica","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numerica, pp. 1\u201351. Cambridge University Press, Cambridge (1995)"},{"key":"9692_CR13","doi-asserted-by":"crossref","unstructured":"Schittkowski, K., Yuan, Y.X.: Sequential quadratic programming methods. Wiley encyclopedia of operations research and management science. (2011). doi: 10.1002\/9780470400531.eorms0984","DOI":"10.1002\/9780470400531.eorms0984"},{"key":"9692_CR14","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/s10957-010-9766-2","volume":"148","author":"N Karmitsa","year":"2011","unstructured":"Karmitsa, N., Tanaka Filho, M., Herskovits, J.: Globally convergent cutting plane method for nonconvex nonsmooth minimization. J. Optim. Theory Appl. 148, 528\u2013549 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"9692_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00158-011-0634-y","volume":"44","author":"J Herskovits","year":"2011","unstructured":"Herskovits, J., Freire, W.P., Tanaka Filho, M., Canelas, A.: A feasible directions method for nonsmooth convex optimization. Struct. Multidisc. Optim. 44, 363\u2013377 (2011)","journal-title":"Struct. Multidisc. Optim."},{"key":"9692_CR16","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/0325051","volume":"25","author":"ER Panier","year":"1987","unstructured":"Panier, E.R., Tits, A.L.: A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM J. Control Optim. 25, 934\u2013950 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"9692_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01581247","volume":"59","author":"ER Panier","year":"1993","unstructured":"Panier, E.R., Tits, A.L.: On combining feasibility, descent and superlinear convergence in inequality constrained optimization.Math. Program. 59, 261\u2013276 (1993)","journal-title":"Math. Program."},{"key":"9692_CR18","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1137\/S1052623498344562","volume":"11","author":"CT Lawarence","year":"2001","unstructured":"Lawarence, C.T., Tits, A.L.: A computationally efficient feasible sequential quadratic programming algorithm. SIAM J. Optim. 11, 1092\u20131118 (2001)","journal-title":"SIAM J. Optim."},{"key":"9692_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10957-006-9042-7","volume":"129","author":"JB Jian","year":"2006","unstructured":"Jian, J.B.: New sequential quadratically constrained quadratic programming norm-relaxed method of feasible directions. J. Optim. Theory Appl. 129, 109\u2013130 (2006)","journal-title":"J. Optim. Theory Appl."},{"key":"9692_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1080\/01630560802000918","volume":"29","author":"JB Jian","year":"2008","unstructured":"Jian, J.B., Tang, C.M., Hu, Q.J., Zheng, H.Y.: A new superlinearly convergent strongly sub-feasible sequential quadratic programming algorithm for inequality-constrained optimization. Numer. Funct. Anal. Optim. 29, 376\u2013409 (2008)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9692_CR21","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.ejor.2009.01.052","volume":"200","author":"JB Jian","year":"2010","unstructured":"Jian, J.B., Tang, C.M., Zheng, H.Y.: Sequential quadratically constrained quadratic programming algorithm of strongly sub-feasible directions. Eur. J. Oper. Res. 200, 645\u2013657 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9692_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ejor.2011.10.055","volume":"218","author":"CM Tang","year":"2012","unstructured":"Tang, C.M., Jian, J.B.: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions. Eur. J. Oper. Res. 218, 28\u201337 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9692_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01588225","volume":"17","author":"E Polak","year":"1979","unstructured":"Polak, E., Trahan, R., Mayne, D.Q.: Combined phase I-phase II methods of feasible directions. Math. Program. 17, 61\u201373 (1979)","journal-title":"Math. Program."},{"key":"9692_CR24","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Willey, New York (1983)"},{"key":"9692_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-010-0408-0","volume":"133","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Lopez-Calva, G., Nocedal, J.: A line search exact penalty method using steering rules. Math. Program. 133, 39\u201373 (2012)","journal-title":"Math. Program."},{"key":"9692_CR26","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"SP Han","year":"1979","unstructured":"Han, S.P., Mangasarian, O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251\u2013269 (1979)","journal-title":"Math. Program."},{"key":"9692_CR27","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF01584657","volume":"4","author":"J Asaadi","year":"1973","unstructured":"Asaadi, J.: A computational comparison of nonlinear programs. Math. Program. 4, 144\u2013154 (1973)","journal-title":"Math. Program."},{"key":"9692_CR28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/S1056263493260386","volume":"8","author":"B Rustem","year":"1998","unstructured":"Rustem, B., Nguyen, Q.: An algorithm for the inequality-constrained discrete minimax problem. SIAM J. Optim. 8, 265\u2013283 (1998)","journal-title":"SIAM J. Optim."},{"key":"9692_CR29","unstructured":"Karmitsa, N.: Test problems for large-scale nonsmooth minimization. Reports of the Department of Mathematical Information Technology, Series B, Scientific computing, No. B 4\/2007. University of Jyv\u00e4skyl\u00e4. Jyv\u00e4skyl\u00e4 (2007)"},{"key":"9692_CR30","unstructured":"Mosek ApS: The MOSEK optimization toolbox for MATLAB manual. Version 6.0, http:\/\/www.mosek.com\/"},{"key":"9692_CR31","unstructured":"Kuntsevich, A., Kappel, F.: SolvOpt\u2014The solver for local nonlinear optimization problems: Matlab, C and Fortran source codes. Institute for Mathematics, Karl-Franzens University of Graz. http:\/\/www.uni-graz.at\/imawww\/kuntsevich\/solvopt\/ (1997)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9692-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9692-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9692-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:21Z","timestamp":1559365701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9692-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,22]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9692"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9692-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,22]]}}}