{"id":"https://openalex.org/W2060701814","doi":"https://doi.org/10.1137/130921738","title":"A Matrix-Free Trust-Region SQP Method for Equality Constrained Optimization","display_name":"A Matrix-Free Trust-Region SQP Method for Equality Constrained Optimization","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2060701814","doi":"https://doi.org/10.1137/130921738","mag":"2060701814"},"language":"en","primary_location":{"id":"doi:10.1137/130921738","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130921738","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070192811","display_name":"Matthias Heinkenschloss","orcid":"https://orcid.org/0000-0002-9305-4221"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthias Heinkenschloss","raw_affiliation_strings":["**Rice University;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"**Rice University;","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015545348","display_name":"Denis Ridzal","orcid":"https://orcid.org/0009-0000-3286-424X"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Denis Ridzal","raw_affiliation_strings":["Department of Computational and Applied Mathematics, MS-134, Rice University, Houston, TX 77005-1892"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computational and Applied Mathematics, MS-134, Rice University, Houston, TX 77005-1892","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":4.6385,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95002389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"24","issue":"3","first_page":"1507","last_page":"1541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11416","display_name":"Numerical methods for differential equations","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.8130069971084595},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.7496182918548584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6799980998039246},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6524140238761902},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.643235445022583},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4896429181098938},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47392305731773376},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.46117767691612244},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43392759561538696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3261997699737549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2877453565597534}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.8130069971084595},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.7496182918548584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6799980998039246},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6524140238761902},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.643235445022583},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4896429181098938},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47392305731773376},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.46117767691612244},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43392759561538696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3261997699737549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2877453565597534},{"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/130921738","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130921738","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.348.3943","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.caam.rice.edu/~heinken/papers/MHeinkenschloss_DRidzal_2011a.pdf","raw_type":"text"},{"id":"pmh:oai:repository.rice.edu:1911/88308","is_oa":false,"landing_page_url":"http://doi.org/10.1137/130921738.","pdf_url":null,"source":{"id":"https://openalex.org/S4306401268","display_name":"Rice Digital Scholarship Archive (Rice University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74775410","host_organization_name":"Rice University","host_organization_lineage":["https://openalex.org/I74775410"],"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":"Journal article"},{"id":"pmh:oai:scholarship.rice.edu:1911/88308","is_oa":false,"landing_page_url":"http://hdl.handle.net/1911/88308","pdf_url":null,"source":{"id":"https://openalex.org/S4306401268","display_name":"Rice Digital Scholarship Archive (Rice University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74775410","host_organization_name":"Rice University","host_organization_lineage":["https://openalex.org/I74775410"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W172684289","https://openalex.org/W1592249764","https://openalex.org/W1967957237","https://openalex.org/W1971536112","https://openalex.org/W1972504036","https://openalex.org/W1981452262","https://openalex.org/W1984840642","https://openalex.org/W2000389939","https://openalex.org/W2004556812","https://openalex.org/W2010315317","https://openalex.org/W2015530812","https://openalex.org/W2019761609","https://openalex.org/W2022916138","https://openalex.org/W2032576830","https://openalex.org/W2036371636","https://openalex.org/W2046351898","https://openalex.org/W2053050827","https://openalex.org/W2059184141","https://openalex.org/W2067649866","https://openalex.org/W2070656412","https://openalex.org/W2083715026","https://openalex.org/W2091644521","https://openalex.org/W2138831925","https://openalex.org/W2141870784","https://openalex.org/W2157397688","https://openalex.org/W2160429522","https://openalex.org/W2595100366","https://openalex.org/W2733179301","https://openalex.org/W2798909945","https://openalex.org/W3029645440","https://openalex.org/W4302564868"],"related_works":["https://openalex.org/W574348691","https://openalex.org/W2107502531","https://openalex.org/W2587737421","https://openalex.org/W2096282913","https://openalex.org/W2119283772","https://openalex.org/W1555927645","https://openalex.org/W2282397816","https://openalex.org/W2369920403","https://openalex.org/W2170048621","https://openalex.org/W4206704743"],"abstract_inverted_index":{"We":[0,114],"develop":[1],"and":[2,24,77,121],"analyze":[3],"a":[4,67,75,78,140],"trust-region":[5,61],"sequential":[6],"quadratic":[7],"programming":[8],"(SQP)":[9],"method":[10],"for":[11,156],"the":[12,22,72,93,112,119,133],"solution":[13,27,32,95],"of":[14,28,33,86,96,102,132],"smooth":[15],"equality":[16],"constrained":[17],"optimization":[18,43],"problems,":[19],"which":[20],"allows":[21],"inexact":[23,94],"hence":[25],"iterative":[26],"linear":[29,34,97,159],"systems.":[30,98],"Iterative":[31],"systems":[35],"is":[36,64,105],"important":[37],"in":[38,138],"large-scale":[39],"applications,":[40],"such":[41,139],"as":[42],"problems":[44],"with":[45,92],"partial":[46],"differential":[47],"equation":[48],"constraints,":[49],"where":[50],"direct":[51],"solves":[52],"are":[53,136],"either":[54],"too":[55],"expensive":[56],"or":[57],"not":[58],"applicable.":[59],"Our":[60],"SQP":[62],"algorithm":[63,82,104,135,153],"based":[65],"on":[66,111],"composite-step":[68],"approach":[69],"that":[70,123,142,151],"decouples":[71],"step":[73],"into":[74],"quasi-normal":[76],"tangential":[79],"step.":[80],"The":[81,99],"includes":[83],"critical":[84],"modifications":[85],"substep":[87],"computations":[88],"needed":[89],"to":[90,117],"cope":[91],"global":[100,127],"convergence":[101,128],"our":[103,152],"guaranteed":[106],"under":[107],"rather":[108],"general":[109],"conditions":[110],"substeps.":[113],"propose":[115],"algorithms":[116,125],"compute":[118],"substeps":[120],"prove":[122],"these":[124],"satisfy":[126],"conditions.":[129],"All":[130],"components":[131],"resulting":[134],"specified":[137],"way":[141],"they":[143],"can":[144],"be":[145],"directly":[146],"implemented.":[147],"Numerical":[148],"results":[149],"indicate":[150],"converges":[154],"even":[155],"very":[157],"coarse":[158],"system":[160],"solves.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}