{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T20:45:15Z","timestamp":1775767515711,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf02191670","type":"journal-article","created":{"date-parts":[[2005,9,21]],"date-time":"2005-09-21T11:18:36Z","timestamp":1127301516000},"page":"379-399","source":"Crossref","is-referenced-by-count":243,"title":["Descent approaches for quadratic bilevel programming"],"prefix":"10.1007","volume":"81","author":[{"given":"L.","family":"Vicente","sequence":"first","affiliation":[]},{"given":"G.","family":"Savard","sequence":"additional","affiliation":[]},{"given":"J.","family":"J\u00fadice","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02191670_CR1","doi-asserted-by":"crossref","unstructured":"Anandalingam, G., andFriesz, T., Editors,Hierarchical Optimization, Annals of Operations Research, Vol. 34, 1992.","DOI":"10.1007\/BF02098169"},{"key":"BF02191670_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"J. Bard","year":"1990","unstructured":"Bard, J., andMoore, J.,A Branch-and-Bound Algorithm for the Bilevel Programming Problem, SIAM Journal on Scientific and Statistical Computing, Vol. 11, pp. 281\u2013292, 1990.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"BF02191670_CR3","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P. Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., andSavard, G.,New Branching-and-Bounding Rules for Linear Bilevel Programming, SIAM Journal on Statistical and Scientific Computing, Vol. 13, pp. 1194\u20131217, 1992.","journal-title":"SIAM Journal on Statistical and Scientific Computing"},{"key":"BF02191670_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02098174","volume":"34","author":"J. J\u00fadice","year":"1992","unstructured":"J\u00fadice, J., andFaustino, A.,A Sequential LCP Method for Bilevel Linear Programming, Annals of Operations Research, Vol. 34, pp. 89\u2013106, 1992.","journal-title":"Annals of Operations Research"},{"key":"BF02191670_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02098176","volume":"34","author":"F. Al-Khayyal","year":"1992","unstructured":"Al-Khayyal, F., Horst, R., andPardalos, P.,Global, Optimization of Concave Functions Subject of Quadratic Constraints: An Application in Nonlinear Bilevel Programming, Annals of Operations Research, Vol. 34, pp. 125\u2013147, 1992.","journal-title":"Annals of Operations Research"},{"key":"BF02191670_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01580720","volume":"40","author":"J. Bard","year":"1988","unstructured":"Bard, J.,Convex Two-Level Programming, Mathematical Programming, Vol. 40, pp. 15\u201327, 1988.","journal-title":"Mathematical Programming"},{"key":"BF02191670_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/21.101139","volume":"21","author":"T. Edmunds","year":"1991","unstructured":"Edmunds, T., andBard, J.,Algorithms for Nonlinear Bilevel Mathematical Programs, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, pp. 83\u201389, 1991.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"BF02191670_CR8","volume-title":"An Exact Algorithm for Convex Bilevel Programming","author":"B. Jaumard","year":"1992","unstructured":"Jaumard, B., Savard, G., andXiong, J.,An Exact Algorithm for Convex Bilevel Programming, Optimization Days, Montreal, Canada, 1992."},{"key":"BF02191670_CR9","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TSMC.1981.4308712","volume":"11","author":"E. Aiyoshi","year":"1981","unstructured":"Aiyoshi, E., andShimizu, K.,Hierarchical Decentralized System and Its New Solution by a Barrier Method, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 11, pp 444\u2013449, 1981.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"BF02191670_CR10","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","volume":"29","author":"E. Aiyoshi","year":"1984","unstructured":"Aiyoshi, E., andShimizu, K.,A Solution Method for the Static Constrained Stackelberg Problem via Penalty Method, IEEE Transactions on Automatic Control, Vol. 29, pp. 1111\u20131114, 1984.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"BF02191670_CR11","unstructured":"Bi, Z., Calamai, P., andConn, A.,An Exact Penalty Function Approach for the Nonlinear Bilevel Programming Problem, Technical Report 180-O-170591, University of Waterloo, 1991."},{"key":"BF02191670_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02098173","volume":"34","author":"Y. Ishizuka","year":"1992","unstructured":"Ishizuka, Y., andAiyoshi E.,Double Penalty Method for Bilevel Linear Programming, Annals of Operations Research, Vol. 34, pp. 73\u201388, 1992.","journal-title":"Annals of Operations Research"},{"key":"BF02191670_CR13","unstructured":"Florian, M., andChen, Y.,A Bilevel Programming Approach to Estimating O-D Matrix by Traffic Counts, Report CRT-750, Centre de Recherche sur les Transports, 1991."},{"key":"BF02191670_CR14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF00939562","volume":"65","author":"C. Kolstad","year":"1990","unstructured":"Kolstad, C., andLasdon, L.,Derivative Evaluation and Computational Experience with Large Bilevel Mathematical Programs, Journal of Optimization Theory and Applications, Vol. 65, pp. 485\u2013499, 1990.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02191670_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/nav.3800310104","volume":"31","author":"J. Bard","year":"1984","unstructured":"Bard, J.,Optimality Conditions for the Bilevel Programming Problem, Naval Research Logistics Quarterly, Vol. 31, pp. 13\u201326, 1984.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02191670_CR16","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/1520-6750(198810)35:5<413::AID-NAV3220350505>3.0.CO;2-6","volume":"35","author":"P. Clarke","year":"1988","unstructured":"Clarke, P., andWesterberg, A.,A Note of the Optimality Conditions for the Bilevel Programming Problem, Naval Research Logistics, Vol. 35, pp. 413\u2013418, 1988.","journal-title":"Naval Research Logistics"},{"key":"BF02191670_CR17","unstructured":"Chen, Y., andFlorian, M.,The Nonlinear Bilevel Programming Problem: A General Formulation and Optimality Conditions, Report CRT-794, Centre de Recherche sur les Transports, 1991."},{"key":"BF02191670_CR18","doi-asserted-by":"crossref","unstructured":"Dempe, S.,A Necessary and a Sufficient Optimality Condition for Bilevel Programming Problems, Optimization (to appear).","DOI":"10.1080\/02331939208843831"},{"key":"BF02191670_CR19","unstructured":"Gauvin, J., andSavard, G.,The Steepest-Descent Method for the Nonlinear Bilevel Programming Problem, Report G-90-37, GERAD (Groupe d'\u00c9tudes et de Recherche en Analyse des D\u00e9cisions), 1990."},{"key":"BF02191670_CR20","unstructured":"J\u00fadice, J., andFaustino, A.,The Linear-Quadratic Bilevel Programming Problem, INFOR (to appear)."},{"key":"BF02191670_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0121176","volume":"31","author":"F. Al-Khayyal","year":"1987","unstructured":"Al-Khayyal, F.,An Implicit Enumeration Procedure for the General Linear Complementarity Problem, Mathematical Programming Studies, Vol. 31, pp. 1\u201320, 1987.","journal-title":"Mathematical Programming Studies"},{"key":"BF02191670_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"Kojima, M., Mizuno, S., andYoshise, A.,A Polynomial-Time Algorithm for a Class of Linear Complementarity Problems, Mathematical Programming, Vol. 50, pp. 331\u2013342, 1991.","journal-title":"Mathematical Programming"},{"key":"BF02191670_CR23","volume-title":"Linear Programming","author":"K. Murty","year":"1983","unstructured":"Murty, K.,Linear Programming, John Wiley and Sons, New York, 1983."},{"key":"BF02191670_CR24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N. Megiddo","year":"1991","unstructured":"Megiddo, N.,On Finding Primal and Dual Optimal Bases, ORSA Journal on Computing, Vol. 3, pp. 63\u201365, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"BF02191670_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"P. Pardalos","year":"1988","unstructured":"Pardalos, P., andSchnitger, G.,Checking Local Optimality in Constrained Quadratic Programming is NP-Hard, Operations Research Letters, Vol. 7, pp. 33\u201335, 1988.","journal-title":"Operations Research Letters"},{"key":"BF02191670_CR26","unstructured":"Carpenter, T., Lustig, I., Mulvey, J., andShanno, D.,Higher-Order Predictor-Corrector Interior-Point Methods with Application to Quadratic Objectives, RUTCOR Research Report RRR 67-90, Rutgers University, 1990."},{"key":"BF02191670_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., andJohnson, D.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, New York, 1979."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02191670.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02191670\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02191670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T19:36:17Z","timestamp":1586460977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02191670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF02191670"],"URL":"https:\/\/doi.org\/10.1007\/bf02191670","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}