{"id":"https://openalex.org/W2050741878","doi":"https://doi.org/10.1137/08072471x","title":"A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians","display_name":"A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians","publication_year":2009,"publication_date":"2009-09-16","ids":{"openalex":"https://openalex.org/W2050741878","doi":"https://doi.org/10.1137/08072471x","mag":"2050741878"},"language":"en","primary_location":{"id":"doi:10.1137/08072471x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08072471x","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/A5005028153","display_name":"Frank E. Curtis","orcid":"https://orcid.org/0000-0001-7214-9187"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank E. Curtis","raw_affiliation_strings":["fecurt@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"fecurt@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081856145","display_name":"Jorge Nocedal","orcid":"https://orcid.org/0000-0002-9662-2730"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jorge Nocedal","raw_affiliation_strings":["nocedal@eecs.northwestern.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"nocedal@eecs.northwestern.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112274231","display_name":"Andreas W\u00e4chter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas W\u00e4chter","raw_affiliation_strings":["andreasw@watson.ibm.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"andreasw@watson.ibm.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3411,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.91423358,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"3","first_page":"1224","last_page":"1249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9986000061035156,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9955999851226807,"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/mathematics","display_name":"Mathematics","score":0.7918367981910706},{"id":"https://openalex.org/keywords/jacobian-matrix-and-determinant","display_name":"Jacobian matrix and determinant","score":0.7338813543319702},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6554012894630432},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6457836031913757},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.6166040301322937},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5264473557472229},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4868723452091217},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.46996021270751953},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.4631573259830475},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4343722462654114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41934698820114136},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.23192360997200012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15321677923202515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1022844910621643},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.07507190108299255}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7918367981910706},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.7338813543319702},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6554012894630432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6457836031913757},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.6166040301322937},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5264473557472229},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4868723452091217},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.46996021270751953},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.4631573259830475},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4343722462654114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41934698820114136},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.23192360997200012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15321677923202515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1022844910621643},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.07507190108299255},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":3,"locations":[{"id":"doi:10.1137/08072471x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08072471x","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.154.7597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.7597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.northwestern.edu/~nocedal/PDFfiles/ammo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.2874","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2008/05/1984.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2572016","https://openalex.org/W1040875707","https://openalex.org/W1967957237","https://openalex.org/W1968553199","https://openalex.org/W1974153211","https://openalex.org/W1989033306","https://openalex.org/W2000389939","https://openalex.org/W2018850201","https://openalex.org/W2041684917","https://openalex.org/W2055333640","https://openalex.org/W2058021091","https://openalex.org/W2077658674","https://openalex.org/W2080419468","https://openalex.org/W2085137170","https://openalex.org/W2090395694","https://openalex.org/W2094634441","https://openalex.org/W2097897435","https://openalex.org/W2107501462","https://openalex.org/W2123871098","https://openalex.org/W2138831925","https://openalex.org/W2140153041","https://openalex.org/W2155696034","https://openalex.org/W2595100366","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W2058731384","https://openalex.org/W2107915509","https://openalex.org/W2204405059","https://openalex.org/W2080108722","https://openalex.org/W2039676703","https://openalex.org/W2526664560","https://openalex.org/W2393058368","https://openalex.org/W2091091836","https://openalex.org/W2914606650","https://openalex.org/W1970914972"],"abstract_inverted_index":{"We":[0,87],"present":[1],"a":[2,57,72,76,80,84],"line":[3],"search":[4],"algorithm":[5,91],"for":[6,16,40,47,61,74],"large-scale":[7],"constrained":[8],"optimization":[9],"that":[10,89],"is":[11,25,45,92],"robust":[12],"and":[13,44,71],"efficient":[14],"even":[15],"problems":[17],"with":[18],"(nearly)":[19],"rank-deficient":[20],"Jacobian":[21],"matrices.":[22],"The":[23,50],"method":[24],"matrix-free":[26],"(i.e.,":[27],"it":[28],"does":[29],"not":[30],"require":[31],"explicit":[32],"storage":[33],"or":[34,64,99],"factorizations":[35],"of":[36,53,68,83,103],"derivative":[37],"matrices),":[38],"allows":[39],"inexact":[41],"step":[42],"computations,":[43],"applicable":[46],"nonconvex":[48],"problems.":[49],"main":[51],"components":[52],"the":[54,69,90],"approach":[55],"are":[56,109],"trust":[58],"region":[59],"subproblem":[60],"handling":[62],"ill-conditioned":[63],"inconsistent":[65],"linear":[66],"models":[67],"constraints":[70],"process":[73],"attaining":[75],"sufficient":[77],"reduction":[78],"in":[79],"local":[81],"model":[82],"penalty":[85],"function.":[86],"show":[88],"globally":[93],"convergent":[94],"to":[95,100],"first-order":[96],"optimal":[97],"points":[98,102],"stationary":[101],"an":[104],"infeasibility":[105],"measure.":[106],"Numerical":[107],"results":[108],"presented.":[110]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}