{"id":"https://openalex.org/W2558202019","doi":"https://doi.org/10.1007/s10589-017-9894-9","title":"An SQP method for mathematical programs with vanishing constraints with strong convergence properties","display_name":"An SQP method for mathematical programs with vanishing constraints with strong convergence properties","publication_year":2017,"publication_date":"2017-02-06","ids":{"openalex":"https://openalex.org/W2558202019","doi":"https://doi.org/10.1007/s10589-017-9894-9","mag":"2558202019","pmid":"https://pubmed.ncbi.nlm.nih.gov/28479672"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-017-9894-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9894-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9894-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9894-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051874203","display_name":"Mat\u00fa\u0161 Benko","orcid":"https://orcid.org/0000-0003-3307-7939"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Mat\u00fa\u0161 Benko","raw_affiliation_strings":["Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria","Institute of Computational Mathematics, Johannes Kepler University Linz, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Institute of Computational Mathematics, Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039711962","display_name":"Helmut Gfrerer","orcid":"https://orcid.org/0000-0001-6860-102X"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Helmut Gfrerer","raw_affiliation_strings":["Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria","Institute of Computational Mathematics, Johannes Kepler University Linz, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Institute of Computational Mathematics, Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051874203"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.9476,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76110675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"67","issue":"2","first_page":"361","last_page":"399"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8906123638153076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8365394473075867},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.8287199139595032},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.7051582336425781},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5890648365020752},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5722514986991882},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5510058999061584},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5111151337623596},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5061058402061462},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49264007806777954},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.49100926518440247},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.486901193857193},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47789299488067627},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4283022880554199},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.26928192377090454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11233410239219666},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07585084438323975}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8906123638153076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8365394473075867},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.8287199139595032},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.7051582336425781},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5890648365020752},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5722514986991882},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5510058999061584},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5111151337623596},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5061058402061462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49264007806777954},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.49100926518440247},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.486901193857193},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47789299488067627},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4283022880554199},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.26928192377090454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11233410239219666},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07585084438323975},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10589-017-9894-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9894-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9894-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmid:28479672","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/28479672","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational optimization and applications","raw_type":null},{"id":"pmh:oai:RePEc:spr:coopap:v:67:y:2017:i:2:d:10.1007_s10589-017-9894-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-017-9894-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:epub.jku.at/:8303801","is_oa":true,"landing_page_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-16119","pdf_url":null,"source":{"id":"https://openalex.org/S4306401788","display_name":"University Library Linz repository (Johannes Kepler Universitat Linz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121883995","host_organization_name":"Johannes Kepler University of Linz","host_organization_lineage":["https://openalex.org/I121883995"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:europepmc.org:4267533","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/5397537","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s10589-017-9894-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9894-9","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9894-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1085494316","display_name":"Numerical Methods for Disjunctive Programming","funder_award_id":"P 26132","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G4500059459","display_name":null,"funder_award_id":"P 26132-N25","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2558202019.pdf","grobid_xml":"https://content.openalex.org/works/W2558202019.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1964090995","https://openalex.org/W1975123909","https://openalex.org/W2018508199","https://openalex.org/W2042838878","https://openalex.org/W2088336360","https://openalex.org/W2117706836","https://openalex.org/W2155640943","https://openalex.org/W2339860953","https://openalex.org/W2545540009","https://openalex.org/W2950493241","https://openalex.org/W3098267398","https://openalex.org/W3194851289","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W4297837336","https://openalex.org/W2036371636","https://openalex.org/W2950493241","https://openalex.org/W2164807043","https://openalex.org/W4231448069","https://openalex.org/W2019128690","https://openalex.org/W2128461291","https://openalex.org/W436931041"],"abstract_inverted_index":{"We":[0,43,57],"propose":[1],"an":[2],"SQP":[3,72],"algorithm":[4,24],"for":[5],"mathematical":[6],"programs":[7],"with":[8,19],"vanishing":[9,21],"constraints":[10],"which":[11],"solves":[12],"at":[13,75],"each":[14],"iteration":[15],"a":[16],"quadratic":[17,52],"program":[18,53],"linear":[20],"constraints.":[22],"The":[23],"is":[25],"based":[26],"on":[27],"the":[28,51,64,70,83,88,96],"newly":[29],"developed":[30],"concept":[31],"of":[32,50,63,66,82,91,95],"[Formula:":[33,46,92],"see":[34,47,93],"text]-stationarity":[35,94],"(Benko":[36],"and":[37,78],"Gfrerer":[38],"in":[39],"Optimization":[40],"66(1):61-92,":[41],"2017).":[42],"demonstrate":[44],"how":[45],"text]-stationary":[48],"solutions":[49],"can":[54],"be":[55],"obtained.":[56],"show":[58],"that":[59],"all":[60],"limit":[61,97],"points":[62],"sequence":[65],"iterates":[67],"generated":[68],"by":[69,79],"basic":[71],"method":[73,84],"are":[74],"least":[76],"M-stationary":[77],"some":[80],"extension":[81],"we":[85],"also":[86],"guarantee":[87],"stronger":[89],"property":[90],"points.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}