{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T22:50:53Z","timestamp":1655765453342},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10107-012-0582-3","type":"journal-article","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T03:59:49Z","timestamp":1343707189000},"page":"349-369","source":"Crossref","is-referenced-by-count":3,"title":["A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results"],"prefix":"10.1007","volume":"142","author":[{"given":"Alfred","family":"Auslender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,1]]},"reference":[{"key":"582_CR1","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1137\/S1052623499365309","volume":"12","author":"M Anitescu","year":"2002","unstructured":"Anitescu, M.: A superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming. SIAM J. Optim. 12, 949\u2013978 (2002)","journal-title":"SIAM J. Optim."},{"key":"582_CR2","doi-asserted-by":"crossref","first-page":"3232","DOI":"10.1137\/090763317","volume":"20","author":"A Auslender","year":"2010","unstructured":"Auslender, A., Shefi, R., Teboulle, M.: A moving balls approximation method for a class of smooth constrained minimization problems. SIAM J. Optim. 20, 3232\u20133259 (2010)","journal-title":"SIAM J. Optim."},{"key":"582_CR3","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"582_CR4","unstructured":"Auslender, A.,Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. Springer, New-York (2003)"},{"key":"582_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-treshold algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"582_CR6","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1995","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont, Massachussetes (1995)"},{"key":"582_CR7","unstructured":"Dahl, J., Vandenberghe, L.: CVXOPT Python Software for Convex Optimization, Version 1.1.2 (2009). http:\/\/abel.ee.ucla.edu\/cvxopt"},{"key":"582_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Classics in Applied Mathematics","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Classics in Applied Mathematics. SIAM, Philadelphia (1990)"},{"key":"582_CR9","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/S1052623401398120","volume":"13","author":"M Fukushima","year":"2003","unstructured":"Fukushima, M., Luo, Z.-Q., Tseng, P.: A sequential quadratically constrained quadratic programming method for differentiable convex minimzation. SIAM J. Optim. 13, 1098\u20131119 (2003)","journal-title":"SIAM J. Optim."},{"key":"582_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with 0(1\/ $$\\epsilon $$ ) iteration-complexity for cone programming. Math. Program. Ser. A 126, 1\u201329 (2011)","journal-title":"Math. Program. Ser. A"},{"key":"582_CR11","unstructured":"Gonzaga, C.C., Karas, E.W.: Optimal steepest descent algorithms for unconstrained convex problems: fine tuning Nesterov\u2019s method. Technical report, Department of Mathematics, Federal University of Santa Catarina, Florianapolis, August (2008)"},{"key":"582_CR12","unstructured":"IMSL 32-bit Fortran Numerical Libraries. Visual Numerics Inc. http:\/\/www.vni.com"},{"key":"582_CR13","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonomika i Matem Metody 24, 509\u2013517 (1988)","journal-title":"Ekonomika i Matem Metody"},{"key":"582_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston (2004)"},{"key":"582_CR15","first-page":"129","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(\\frac{1}{k^2})$$ . Dokl. Akad. Nauk 269, 129\u2013144 (1983)","journal-title":"Dokl. Akad. Nauk"},{"key":"582_CR16","doi-asserted-by":"crossref","unstructured":"Panin, V.M.: A second-order method for the discrete min-max problem. USSR Comput. Math. Math. Phys. 19(N1), 90\u2013100 (1979) (Zh.Vychisl.Mat.i.Math.Fiz, Vol.19, N1, pp. 88\u201398, 1979)","DOI":"10.1016\/0041-5553(79)90069-7"},{"key":"582_CR17","doi-asserted-by":"crossref","unstructured":"Panin, V.M.: Some methods of solving convex programming problems. USSR Comput. Math. Math. Phys. 21( N2), pp. 57\u201372 (1981) (Zh.Vychisl.Mat.i.Math.Fiz, Vol.19, N1, pp. 315\u2013328, 1981)","DOI":"10.1016\/0041-5553(81)90007-0"},{"key":"582_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)"},{"key":"582_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-007-0180-y","volume":"118","author":"MV Solodov","year":"2009","unstructured":"Solodov, M.V.: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences. Math. Program. Ser. A 118, 1\u201312 (2009)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"582_CR20","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/moor.1030.0069","volume":"29","author":"MV Solodov","year":"2004","unstructured":"Solodov, M.V.: On the sequential quadratically constrained quadratic programming method. Math. Oper. Res. 29(1), 64\u201379 (2004)","journal-title":"Math. Oper. Res."},{"key":"582_CR21","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. Ser. B. 125, 263\u2013295 (2010)"},{"key":"582_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01371083","volume":"26","author":"EJ Wiest","year":"1992","unstructured":"Wiest, E.J., Polak, E.: A generalized quadratic programming-based phase-I-phase II method for inequality-constrained optimization. Appl. Math. Optim. 26, 223\u2013252 (1992)","journal-title":"Appl. Math. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0582-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0582-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0582-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T05:21:07Z","timestamp":1562044867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0582-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0582-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,1]]}}}