{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:44:20Z","timestamp":1648773860187},"reference-count":0,"publisher":"Institute of Information Theory and Automation","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Kybernetika"],"DOI":"10.14736\/kyb-2016-2-0169","type":"journal-article","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T21:20:19Z","timestamp":1461273619000},"page":"169-208","source":"Crossref","is-referenced-by-count":0,"title":["An SQP method for mathematical programs with complementarity constraints with strong convergence properties"],"prefix":"10.14736","author":[{"given":"Matus","family":"Benko","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Gfrerer","sequence":"additional","affiliation":[]}],"member":"5778","published-online":{"date-parts":[[2016,4,21]]},"container-title":["Kybernetika"],"original-title":[],"language":"en","deposited":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T21:20:20Z","timestamp":1461273620000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.kybernetika.cz\/content\/2016\/2\/169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.14736\/kyb-2016-2-0169","relation":{},"ISSN":["0023-5954","1805-949X"],"issn-type":[{"value":"0023-5954","type":"print"},{"value":"1805-949X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,21]]}}}