{"id":"https://openalex.org/W2050663224","doi":"https://doi.org/10.1007/s101070100283","title":"A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach","display_name":"A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2050663224","doi":"https://doi.org/10.1007/s101070100283","mag":"2050663224"},"language":"en","primary_location":{"id":"doi:10.1007/s101070100283","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070100283","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5033475682","display_name":"Jean Charles Gilbert","orcid":"https://orcid.org/0000-0002-0375-4663"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"J. Charles Gilbert","raw_affiliation_strings":["INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France; e-mail: Jean-Charles.Gilbert@inria.fr, , , , , , FR","INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France; e-mail: Jean-Charles.Gilbert@inria.fr, , FR"],"affiliations":[{"raw_affiliation_string":"INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France; e-mail: Jean-Charles.Gilbert@inria.fr, , , , , , FR","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France; e-mail: Jean-Charles.Gilbert@inria.fr, , FR","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108138095","display_name":"Paul Armand","orcid":null},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Paul Armand","raw_affiliation_strings":["LACO \u2013 Universit\u00e9 de Limoges, Facult\u00e9 des Sciences, 123, avenue Albert Thomas, 87060 Limoges, France; e-mail: armand@unilim.fr, , , , , , FR","LACO \u2013 Universit\u00e9 de Limoges, Facult\u00e9 des Sciences, 123, avenue Albert Thomas, 87060 Limoges, France; e-mail: armand@unilim.fr, , FR"],"affiliations":[{"raw_affiliation_string":"LACO \u2013 Universit\u00e9 de Limoges, Facult\u00e9 des Sciences, 123, avenue Albert Thomas, 87060 Limoges, France; e-mail: armand@unilim.fr, , , , , , FR","institution_ids":["https://openalex.org/I65806277"]},{"raw_affiliation_string":"LACO \u2013 Universit\u00e9 de Limoges, Facult\u00e9 des Sciences, 123, avenue Albert Thomas, 87060 Limoges, France; e-mail: armand@unilim.fr, , FR","institution_ids":["https://openalex.org/I65806277"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105381050","display_name":"Sophie Jan-J\ufffdgou","orcid":null},"institutions":[{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sophie Jan-J\ufffdgou","raw_affiliation_strings":["MIP, UFR MIG, Universit\u00e9 Paul Sabatier, 118, route de Narbonne, 31062 Toulouse Cedex 4, France; e-mail: jan@mip.ups-tlse.fr, FR"],"affiliations":[{"raw_affiliation_string":"MIP, UFR MIG, Universit\u00e9 Paul Sabatier, 118, route de Narbonne, 31062 Toulouse Cedex 4, France; e-mail: jan@mip.ups-tlse.fr, FR","institution_ids":["https://openalex.org/I134560555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033475682"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5181,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.65944758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"92","issue":"3","first_page":"393","last_page":"424"},"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.9975000023841858,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.992900013923645,"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.7520098686218262},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.7227970957756042},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.650448203086853},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6380974054336548},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.6221854090690613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5838112831115723},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5712478756904602},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5534307956695557},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5221866965293884},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5182304382324219},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4933408796787262},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39057981967926025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34602728486061096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1681627631187439},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11648112535476685}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7520098686218262},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.7227970957756042},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.650448203086853},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6380974054336548},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.6221854090690613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5838112831115723},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5712478756904602},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5534307956695557},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5221866965293884},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5182304382324219},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4933408796787262},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39057981967926025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34602728486061096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1681627631187439},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11648112535476685},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"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},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1007/s101070100283","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070100283","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00955215v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00955215","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":"Mathematical Programming, 2002, 92 (3), pp.393-424. ⟨10.1007/s101070100283⟩","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:inria-00072546v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00072546","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":"Mathematical Programming, 2002, 92 (3), pp.393-424. ⟨10.1007/s101070100283⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W615575329","https://openalex.org/W1538755060","https://openalex.org/W1553702074","https://openalex.org/W1588059640","https://openalex.org/W1966000604","https://openalex.org/W1978554456","https://openalex.org/W2011243226","https://openalex.org/W2038872086","https://openalex.org/W2041684917","https://openalex.org/W2042370800","https://openalex.org/W2059352176","https://openalex.org/W2066710237","https://openalex.org/W2129616681","https://openalex.org/W2153532571","https://openalex.org/W3134771994"],"related_works":["https://openalex.org/W2384324993","https://openalex.org/W2014001084","https://openalex.org/W4205485413","https://openalex.org/W2778996617","https://openalex.org/W3125179639","https://openalex.org/W2079260672","https://openalex.org/W1999067864","https://openalex.org/W1659710326","https://openalex.org/W2086070068","https://openalex.org/W3015765855"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}