{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:37:31Z","timestamp":1787341051422,"version":"build-2736575974"},"reference-count":52,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/18711-3"],"award-info":[{"award-number":["2014\/18711-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303750\/2014-6"],"award-info":[{"award-number":["303750\/2014-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>The main objective of this research is to introduce a practical method for smooth bound-constrained optimization that possesses worst-case evaluation complexity $O(\\varepsilon^{-3\/2})$ for finding an $\\varepsilon$-approximate first-order stationary point when the Hessian of the objective function is Lipschitz continuous. As other well-established algorithms for optimization with box constraints, the algorithm proceeds visiting the different faces of the domain aiming to reduce the norm of an internal projected gradient and abandoning active constraints when no additional progress is expected in the current face. The introduced method emerges as a particular case of a method for minimization with linear constraints. Moreover, the linearly constrained minimization algorithm is an instance of a minimization algorithm with general constraints whose implementation may be unaffordable when the constraints are complicated. As a procedure for leaving faces, a different method is employed that may be regarded as an independent device for constrained optimization. Such an independent algorithm may be employed to solve linearly constrained optimization problems on its own, without relying on the active-set strategy. A careful implementation and numerical experiments show that the algorithm that combines active sets with leaving-face iterations is more effective than the independent algorithm on which leaving-face iterations are based, although both exhibit similar complexities $O(\\varepsilon^{-3\/2})$.<\/jats:p>","DOI":"10.1137\/17m1127107","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T11:53:02Z","timestamp":1525780382000},"page":"1367-1395","source":"Crossref","is-referenced-by-count":19,"title":["On Regularization and Active-set Methods with Complexity for Constrained Optimization"],"prefix":"10.1137","volume":"28","author":[{"given":"E. G.","family":"Birgin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drh020"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1080\/02331930903578700"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1080\/02331930500100270"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-009-9289-9"},{"key":"atypb5","unstructured":"D. P. Bertsekas,\n                      Nonlinear Programming\n                      , 2nd ed., Athena Scientific, Belmont, MA, 1999."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9672-x"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1155213"},{"key":"atypb8","unstructured":"E. G. Birgin, J. L. Gardenghi, J. M. Marti\u0301nez, and S. A. Santos,\n                      Is it Worth Using Third-Order Models with Fourth-Order Regularization for Unconstrained Optimization?\n                      , Technical report MCDO131017, Institute of Mathematics, Statistics, and Scientific Computing, University of Campinas, Brazil, 2017."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/15M1031631"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1065-8"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9466-y"},{"key":"atypb12","first-page":"49","author":"Birgin E. G.","year":"2001","journal-title":"Vienna"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019928808826"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"E. G. Birgin and J. M. Marti\u0301nez,\n                      Practical Augmented Lagrangian Methods for Constrained Optimization\n                      , Fundam. Algorithms 10, SIAM, Philadelphia, PA, 2014,https:\/\/doi.org\/10.1137\/1.9781611973365.","DOI":"10.1137\/1.9781611973365"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/16M110280X"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497330963"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1145\/502800.502803"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/23.4.539"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v060.i03"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/090774100"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0286-5"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0337-y"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drr035"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2011.06.001"},{"key":"atypb25","unstructured":"C. Cartis, N. I. M. Gould, and P. L. Toint,\n                      Optimal Newton-Type Methods for Nonconvex Optimization\n                      , Technical report naXys-17-2011, Namur Center for Complex Systems (naXys), University of Namur, Belgium, 2012."},{"key":"atypb26","unstructured":"C. Cartis, N. I. M. Gould, and P. L. Toint,\n                      Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization using Scaled KKT Conditions and High-Order Models\n                      , Technical report naXys-11-2015(R1), Namur Center for Complex Systems (naXys), University of Namur, Belgium, 2015."},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/0725029"},{"key":"atypb29","doi-asserted-by":"crossref","unstructured":"A. R. Conn, N. I. M. Gould, and P. L. Toint,\n                      Trust Region Methods\n                      , Society for Industral and Applied Mathematics, Philadelphia, PA, 2000,https:\/\/doi.org\/10.1137\/1.9780898719857.","DOI":"10.1137\/1.9780898719857"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"F. E. Curtis, D. P. Robinson, and M. Samadi,\n                      An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $o(\\epsilon^{-3\/2})$ for Nonconvex Optimization\n                      , preprint, arXiv:1708.00475, 2017.","DOI":"10.1093\/imanum\/dry022"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1026-2"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1002\/nla.555"},{"key":"atypb33","unstructured":"Z. Dosta\u0301l,\n                      Directions of Large Decrease and Quadratic Programming\n                      , Technical report, Department of Applied Mathematics, Technical University of Ostrava, Czech Republic, 1994."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494266250"},{"key":"atypb35","doi-asserted-by":"crossref","unstructured":"Z. Dosta\u0301l,\n                      Optimal Quadratic Programming Algorithms\n                      , Springer Optim. Appl. 23, Springer, Heidelberg, Berlin, New York, 2009,https:\/\/doi.org\/10.1007\/b138610.","DOI":"10.1007\/b138610"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/0318050"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/0319022"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939081"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1322080"},{"key":"atypb40","doi-asserted-by":"crossref","unstructured":"R. Fletcher,\n                      Practical Methods of Optimization\n                      , 2nd ed., John Wiley and Sons, London, 1987,https:\/\/doi.org\/10.1002\/9781118723203.","DOI":"10.1002\/9781118723203"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1989230403191"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9687-3"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1137\/16M1087801"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0794-9"},{"key":"atypb45","unstructured":"A. Griewank,\n                      The Modification of Newton's Method for Unconstrained Optimization by Bounding Cubic Terms\n                      , Technical report NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, England, 1981."},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1137\/17M1115472"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0475-8"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024791525441"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049669"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588950"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"atypb52","doi-asserted-by":"crossref","unstructured":"J. Nocedal and S. J. Wright,\n                      Numerical Optimization\n                      , 2nd ed., Springer Ser. Oper. Res. Financ. Eng., Springer, New York, 2006,https:\/\/doi.org\/10.1007\/978-0-387-40065-5.","DOI":"10.1007\/978-0-387-40065-5"},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1080\/10556780600605129"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1127107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:03:19Z","timestamp":1787338999000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1127107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1127107"],"URL":"https:\/\/doi.org\/10.1137\/17m1127107","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}