{"id":"https://openalex.org/W2066710237","doi":"https://doi.org/10.1137/s1052623498344720","title":"A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems","display_name":"A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2066710237","doi":"https://doi.org/10.1137/s1052623498344720","mag":"2066710237"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623498344720","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498344720","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00073185","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108138095","display_name":"Paul Armand","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Armand","raw_affiliation_strings":["Math\u00e9matiques & S\u00e9curit\u00e9 de l'information"],"affiliations":[{"raw_affiliation_string":"Math\u00e9matiques & S\u00e9curit\u00e9 de l'information","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033475682","display_name":"Jean Charles Gilbert","orcid":"https://orcid.org/0000-0002-0375-4663"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jean Charles Gilbert","raw_affiliation_strings":["Environmental Modeling, Optimization and Programming Models"],"affiliations":[{"raw_affiliation_string":"Environmental Modeling, Optimization and Programming Models","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008860738","display_name":"Sophie Jan-J\u00e9gou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sophie Jan-J\u00e9gou","raw_affiliation_strings":["French Institute for Research in Computer Science and Automation"],"affiliations":[{"raw_affiliation_string":"French Institute for Research in Computer Science and Automation","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108138095"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6131,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.94563609,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"1","first_page":"199","last_page":"222"},"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.9988999962806702,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.979200005531311,"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/mathematics","display_name":"Mathematics","score":0.8546514511108398},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7770787477493286},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.757658839225769},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7184159755706787},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5648020505905151},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5025298595428467},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5022320747375488},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.49581989645957947},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4754488170146942},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4303654730319977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39053645730018616},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13597074151039124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09091341495513916},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07686692476272583}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8546514511108398},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7770787477493286},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.757658839225769},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7184159755706787},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5648020505905151},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5025298595428467},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5022320747375488},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49581989645957947},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4754488170146942},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4303654730319977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39053645730018616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13597074151039124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09091341495513916},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07686692476272583},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623498344720","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498344720","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:HAL:hal-00955220v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00955220","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1052-6234","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:inria-00073185v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00073185","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"SIAM Journal on Optimization, 2000, 11 (1), pp.199-222. ⟨10.1137/S1052623498344720⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00073185v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00073185","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"SIAM Journal on Optimization, 2000, 11 (1), pp.199-222. ⟨10.1137/S1052623498344720⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5299999713897705,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W60613359","https://openalex.org/W125730541","https://openalex.org/W265109674","https://openalex.org/W1493426390","https://openalex.org/W1509805685","https://openalex.org/W1514645957","https://openalex.org/W1518039036","https://openalex.org/W1553702074","https://openalex.org/W1570961610","https://openalex.org/W1584273307","https://openalex.org/W1585773866","https://openalex.org/W1632601927","https://openalex.org/W1847083924","https://openalex.org/W1877361590","https://openalex.org/W1966000604","https://openalex.org/W1972639694","https://openalex.org/W1976831027","https://openalex.org/W1978554456","https://openalex.org/W1990735605","https://openalex.org/W2011243226","https://openalex.org/W2014746566","https://openalex.org/W2018478336","https://openalex.org/W2022234616","https://openalex.org/W2038872086","https://openalex.org/W2041684917","https://openalex.org/W2042370800","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2059352176","https://openalex.org/W2068484625","https://openalex.org/W2071563913","https://openalex.org/W2075194837","https://openalex.org/W2077658674","https://openalex.org/W2079115388","https://openalex.org/W2083431695","https://openalex.org/W2089876425","https://openalex.org/W2092677228","https://openalex.org/W2112820497","https://openalex.org/W2115211938","https://openalex.org/W2129616681","https://openalex.org/W2130844535","https://openalex.org/W2132248149","https://openalex.org/W2139004160","https://openalex.org/W2153532571","https://openalex.org/W2165785900","https://openalex.org/W2179625630","https://openalex.org/W2798766386","https://openalex.org/W3134771994","https://openalex.org/W3141890267","https://openalex.org/W3159982138","https://openalex.org/W4212997115","https://openalex.org/W4244832091","https://openalex.org/W4254755288","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3125179639","https://openalex.org/W2079260672","https://openalex.org/W3136573029","https://openalex.org/W2094757704","https://openalex.org/W2364261631","https://openalex.org/W1971720918","https://openalex.org/W2052529091","https://openalex.org/W2410228078","https://openalex.org/W2374289070","https://openalex.org/W211549749"],"abstract_inverted_index":{"We":[0,49,59],"propose":[1],"a":[2,10,14,40],"BFGS":[3],"primal-dual":[4,73],"interior":[5],"point":[6],"method":[7],"for":[8,55],"minimizing":[9],"convex":[11,15],"function":[12],"on":[13],"set":[16,75],"defined":[17],"by":[18,39],"equality":[19],"and":[20,28,81],"inequality":[21],"constraints.":[22],"The":[23],"algorithm":[24],"generates":[25],"feasible":[26],"iterates":[27],"consists":[29],"in":[30],"computing":[31],"approximate":[32],"solutions":[33],"of":[34,42,71],"the":[35,68,72],"optimality":[36],"conditions":[37],"perturbed":[38],"sequence":[41],"positive":[43],"parameters":[44],"$\\mu$":[45,77],"converging":[46],"to":[47,67,79],"zero.":[48],"prove":[50],"that":[51,62],"it":[52,63],"converges":[53],"q-superlinearly":[54],"each":[56],"fixed":[57],"$\\mu$.":[58],"also":[60],"show":[61],"is":[64],"globally":[65],"convergent":[66],"analytic":[69],"center":[70],"optimal":[74],"when":[76],"tends":[78],"0":[80],"strict":[82],"complementarity":[83],"holds.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}