{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:59:59Z","timestamp":1776869999656,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0928-x","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T14:56:29Z","timestamp":1438354589000},"page":"1315-1325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization"],"prefix":"10.1007","volume":"10","author":[{"given":"L. F.","family":"Bueno","sequence":"first","affiliation":[]},{"given":"G.","family":"Haeser","sequence":"additional","affiliation":[]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"928_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10589-007-9147-4","volume":"43","author":"R Andreani","year":"2009","unstructured":"Andreani, R., Castro, S.L., Chela, J.L., Friedlander, A., Santos, S.A.: An inexact-restoration method for nonlinear bilevel programming problems. Comput. Optim. Appl. 43, 307\u2013328 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"928_CR2","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/02331930903578700","volume":"60","author":"R Andreani","year":"2011","unstructured":"Andreani, R., Haeser, G., Mart\u00ednez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60, 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"928_CR3","doi-asserted-by":"crossref","unstructured":"Arrow, K., Barankin, E., Blackwell, D.: Admissible points of convex sets. In: Kuhn, H. W., Tucker A.W (eds.) Contributions to the Theory of Games. Princeton University Press, Princeton, NJ (1953)","DOI":"10.1515\/9781400881970-006"},{"key":"928_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10957-010-9709-y","volume":"147","author":"H Bonnel","year":"2010","unstructured":"Bonnel, H., Kaya, C.Y.: Optimization over the efficient set of multi-objective convex optimal control problems. J. Optim. Theory Appl. 147, 93\u2013112 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"928_CR5","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/s10957-014-0572-0","volume":"165","author":"LF Bueno","year":"2015","unstructured":"Bueno, L.F., Haeser, G., Mart\u00ednez, J.M.: A flexible inexact-restoration method for constrained optimization. J. Optim. Theory Appl. 165(1), 188\u2013208 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"928_CR6","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/s10957-013-0346-0","volume":"162","author":"RS Burachik","year":"2014","unstructured":"Burachik, R.S., Kaya, C.Y., Rizvi, M.M.: A new scalarization technique to approximate Pareto fronts on problems with disconnected feasible sets. J. Optim. Theory Appl. 162(2), 428\u2013446 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"928_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01279451","volume":"7","author":"JP Dauer","year":"1995","unstructured":"Dauer, J.P., Fosnaugh, T.A.: Optimization over the efficient set. J. Glob. Optim. 7, 261\u2013277 (1995)","journal-title":"J. Glob. Optim."},{"key":"928_CR8","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"928_CR9","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1080\/02331934.2011.587006","volume":"60","author":"J Dutta","year":"2011","unstructured":"Dutta, J., Kaya, C.Y.: A new scalarization and numerical method for constructing weak Pareto front of multi-objective optimization problems. Optimization 60, 1091\u20131104 (2011)","journal-title":"Optimization"},{"key":"928_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-79159-1","volume-title":"Adaptive Scalarization Methods in Multiobjective Optimization","author":"G Eichfelder","year":"2008","unstructured":"Eichfelder, G.: Adaptive Scalarization Methods in Multiobjective Optimization. Springer, Berlin, Heidelberg (2008)"},{"key":"928_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10589-009-9267-0","volume":"46","author":"A Fischer","year":"2010","unstructured":"Fischer, A., Friedlander, A.: A new line search inexact restoration approach for nonlinear programming. Comput. Optim. Appl. 46, 333\u2013346 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"928_CR12","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1137\/110844362","volume":"22","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R.: A sequential linear constraint programming algorithm for NLP. SIAM J. Optim. 22, 772\u2013794 (2012)","journal-title":"SIAM J. Optim."},{"key":"928_CR13","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Gra\u00f1a-Drummond, L.F., Svaiter, B.F.: Newton\u2018s method for multiobjective optimization. SIAM J. Optim. 20, 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"key":"928_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"AM Geoffrion","year":"1968","unstructured":"Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22, 387\u2013407 (1968)","journal-title":"J. Math. Anal. Appl."},{"key":"928_CR15","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S1052623401399320","volume":"14","author":"CC Gonzaga","year":"2003","unstructured":"Gonzaga, C.C., Karas, E.W., Vanti, M.: A globally convergent filter method for nonlinear programming. SIAM J. Optim. 14, 646\u2013669 (2003)","journal-title":"SIAM J. Optim."},{"key":"928_CR16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF00934353","volume":"36","author":"MI Henig","year":"1982","unstructured":"Henig, M.I.: Proper efficiency with respect to cones. J. Optim. Theory Appl. 36, 387\u2013407 (1982)","journal-title":"J. Optim. Theory Appl."},{"key":"928_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17005-8","volume-title":"Vector Optimization","author":"J Jahn","year":"2011","unstructured":"Jahn, J.: Vector Optimization. Springer-Verlag, Berlin Heidelberg (2011)"},{"key":"928_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1017567113614","volume":"111","author":"JM Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, J.M.: Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111, 39\u201358 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"928_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1004632923654","volume":"104","author":"JM Mart\u00ednez","year":"2000","unstructured":"Mart\u00ednez, J.M., Pilotta, E.A.: Inexact restoration algorithms for constrained optimization. J. Optim. Theory Appl. 104, 135\u2013163 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"928_CR20","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, J.M., Pilotta, E.A.: Inexact restoration methods for nonlinear programming: advances and perspectives. In: Qi, L.Q., Teo, K.L., Yang, X.Q. (eds.) Optimization and Control with Applications, pp. 271\u2013292. Springer, Berlin (2005)","DOI":"10.1007\/0-387-24255-4_12"},{"key":"928_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"928_CR22","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF00934564","volume":"42","author":"A Pascoletti","year":"1984","unstructured":"Pascoletti, A., Serafini, P.: Scalarizing vector optimization problems. J. Optim. Theory Appl. 42, 499\u2013524 (1984)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"928_CR23","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1137\/0328021","volume":"28","author":"M Petschke","year":"1990","unstructured":"Petschke, M.: On a theorem of Arrow, Barankin, and Blackwell. SIAM J. Control Optim. 28(2), 395\u2013401 (1990)","journal-title":"SIAM J. Control Optim."},{"key":"928_CR24","unstructured":"Ramirez, V.: Um problema Bilevel-Multiobjetivo com Pontos Propriamente Eficientes. Departamento de Matem\u00e1tica Aplicada, Universidade Estadual de Campinas, Ph.D. proposal (2013)"},{"key":"928_CR25","unstructured":"Yahoo Finance website. http:\/\/finance.yahoo.com\/"},{"key":"928_CR26","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1013875600711","volume":"22","author":"Y Yamamoto","year":"2002","unstructured":"Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285\u2013317 (2002)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0928-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0928-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0928-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0928-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["928"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0928-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,1]]}}}