{"id":"https://openalex.org/W2048249717","doi":"https://doi.org/10.1137/0805006","title":"On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming","display_name":"On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2048249717","doi":"https://doi.org/10.1137/0805006","mag":"2048249717"},"language":"en","primary_location":{"id":"doi:10.1137/0805006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805006","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/A5002468787","display_name":"Ciyou Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ciyou Zhu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002468787"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0842,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86649925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"1","first_page":"114","last_page":"128"},"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.9987999796867371,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.7652467489242554},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6636868119239807},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.612159788608551},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5934008359909058},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.524795413017273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5019161701202393},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.49368295073509216},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.49318116903305054},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.4919602572917938},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47793224453926086},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.464839905500412},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4429294466972351},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.43949785828590393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16256016492843628},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.07081380486488342},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0647653341293335},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.0640348494052887}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7652467489242554},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6636868119239807},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.612159788608551},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5934008359909058},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.524795413017273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5019161701202393},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.49368295073509216},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.49318116903305054},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.4919602572917938},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47793224453926086},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.464839905500412},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4429294466972351},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.43949785828590393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16256016492843628},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.07081380486488342},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0647653341293335},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0640348494052887},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0805006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805006","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W116303816","https://openalex.org/W965990085","https://openalex.org/W1982944912","https://openalex.org/W1987064381","https://openalex.org/W1996903464","https://openalex.org/W2124654085","https://openalex.org/W2159641394","https://openalex.org/W2490718595"],"related_works":["https://openalex.org/W2393439324","https://openalex.org/W2081157561","https://openalex.org/W131846159","https://openalex.org/W2043851096","https://openalex.org/W3197592642","https://openalex.org/W2155993847","https://openalex.org/W2914176832","https://openalex.org/W2088010696","https://openalex.org/W2386196923","https://openalex.org/W2552244284"],"abstract_inverted_index":{"The":[0,45],"aim":[1],"of":[2,23,78,92,127],"this":[3],"paper":[4],"is":[5,59,129],"two-fold.":[6],"First,":[7],"new":[8,63,82,134],"variants":[9,46,91,114],"are":[10,86],"proposed":[11],"for":[12,40,52,69,88,124],"the":[13,21,53,56,70,75,79,93,96,104,113,116,125,133],"primal-dual":[14,24,57,135],"steepest":[15],"descent":[16],"algorithm":[17],"as":[18,65,67,99],"one":[19],"in":[20,61,74],"family":[22],"projected":[25],"gradient":[26],"algorithms":[27],"developed":[28],"by":[29,108],"Zhu":[30,109],"and":[31,110],"Rockafellar":[32],"[SIAM":[33],"J.":[34],"Optim.,":[35],"3":[36],"(1993),":[37],"pp.":[38],"751\u2013783]":[39],"large-scale":[41],"extended":[42],"linear-quadratic":[43],"programming.":[44],"include":[47],"a":[48,62,100,120],"second":[49,117],"update":[50,118],"scheme":[51],"iterates,":[54],"where":[55],"feedback":[58,136],"arranged":[60],"pattern,":[64],"well":[66],"alternatives":[68],"\u201cperfect":[71],"line":[72],"search\u201d":[73],"original":[76,97],"version":[77,98],"reference.":[80],"Second,":[81],"linear":[83],"convergence":[84,128],"results":[85],"proved":[87],"all":[89],"these":[90],"algorithm,":[94],"including":[95],"special":[101],"case,":[102],"without":[103],"additional":[105],"assumptions":[106],"used":[107],"Rockafellar.":[111],"For":[112],"with":[115],"scheme,":[119],"much":[121],"sharper":[122],"estimation":[123],"rate":[126],"obtained":[130],"due":[131],"to":[132],"pattern.":[137]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}