{"id":"https://openalex.org/W2022234616","doi":"https://doi.org/10.1137/0805008","title":"A Practical Interior-Point Method for Convex Programming","display_name":"A Practical Interior-Point Method for Convex Programming","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2022234616","doi":"https://doi.org/10.1137/0805008","mag":"2022234616"},"language":"en","primary_location":{"id":"doi:10.1137/0805008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805008","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/A5015422470","display_name":"Florian Jarre","orcid":"https://orcid.org/0000-0003-3458-123X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florian Jarre","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039807799","display_name":"Michael A. Saunders","orcid":"https://orcid.org/0000-0003-3800-4982"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael A. Saunders","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3477,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92206077,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":"1","first_page":"149","last_page":"171"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9923999905586243,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9854000210762024,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8546391725540161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7596498727798462},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7583822011947632},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6441861987113953},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6089872121810913},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5886566042900085},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5547701120376587},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5057439804077148},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4883434474468231},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4878397285938263},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4791266620159149},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4517001509666443},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4314192533493042},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4307393431663513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3611851930618286},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19025534391403198}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8546391725540161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7596498727798462},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7583822011947632},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6441861987113953},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6089872121810913},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5886566042900085},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5547701120376587},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5057439804077148},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4883434474468231},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4878397285938263},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4791266620159149},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4517001509666443},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4314192533493042},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4307393431663513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3611851930618286},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19025534391403198},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/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/0805008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805008","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W14066104","https://openalex.org/W21055737","https://openalex.org/W189195062","https://openalex.org/W205196884","https://openalex.org/W1570961610","https://openalex.org/W1573409602","https://openalex.org/W1748199557","https://openalex.org/W1972639694","https://openalex.org/W1973117121","https://openalex.org/W1981315194","https://openalex.org/W1990735605","https://openalex.org/W1992975148","https://openalex.org/W2017068042","https://openalex.org/W2025655081","https://openalex.org/W2028570814","https://openalex.org/W2034235667","https://openalex.org/W2038872086","https://openalex.org/W2044908666","https://openalex.org/W2071425572","https://openalex.org/W2086867325","https://openalex.org/W2113273909","https://openalex.org/W2326806701","https://openalex.org/W2611147814","https://openalex.org/W4241910220","https://openalex.org/W4249290066"],"related_works":["https://openalex.org/W1823078487","https://openalex.org/W1758063681","https://openalex.org/W2095983929","https://openalex.org/W2498799440","https://openalex.org/W2034177488","https://openalex.org/W2153851007","https://openalex.org/W1536532856","https://openalex.org/W2952370250","https://openalex.org/W2092565441","https://openalex.org/W1983813429"],"abstract_inverted_index":{"The":[0,14,54],"authors":[1],"present":[2],"a":[3,17,22,28,71,99],"primal":[4],"interior-point":[5],"algorithm":[6,15,47,87],"for":[7],"solving":[8],"convex":[9],"programs":[10],"with":[11,102],"nonlinear":[12,63],"constraints.":[13],"uses":[16],"predictor-corrector":[18],"strategy":[19],"to":[20,32],"follow":[21],"smooth":[23],"path":[24],"that":[25,42,85,94],"leads":[26],"from":[27],"given":[29,40],"starting":[30,104],"point":[31],"an":[33],"optimal":[34],"solution.":[35],"A":[36,74],"convergence":[37],"analysis":[38],"is":[39],"showing":[41],"under":[43],"mild":[44],"assumptions":[45],"the":[46,62,86],"simultaneously":[48],"iterates":[49],"towards":[50],"feasibility":[51],"and":[52,93],"optimality.":[53],"matrices":[55],"involved":[56],"can":[57,96],"be":[58,89],"kept":[59],"sparse":[60],"if":[61],"functions":[64],"are":[65],"separable":[66],"or":[67],"depend":[68],"on":[69,108],"only":[70],"few":[72],"variables.":[73],"preliminary":[75],"implementation":[76],"has":[77],"been":[78],"developed.":[79],"Some":[80],"promising":[81],"numerical":[82],"results":[83],"indicate":[84],"may":[88],"efficient":[90],"in":[91,98],"practice,":[92],"it":[95],"deal":[97],"single":[100],"phase":[101],"infeasible":[103],"points":[105],"without":[106],"relying":[107],"some":[109],"\u201cbig":[110],"M\u201d":[111],"parameter.":[112]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}