{"id":"https://openalex.org/W2897334136","doi":"https://doi.org/10.1080/10556788.2018.1528250","title":"Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization","display_name":"Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization","publication_year":2018,"publication_date":"2018-10-09","ids":{"openalex":"https://openalex.org/W2897334136","doi":"https://doi.org/10.1080/10556788.2018.1528250","mag":"2897334136"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2018.1528250","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1528250","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5074795044","display_name":"Paul Armand","orcid":"https://orcid.org/0000-0002-8821-5799"},"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":true,"raw_author_name":"Paul Armand","raw_affiliation_strings":["Laboratoire XLIM, Universit\u00e9 de Limoges, Limoges, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire XLIM, Universit\u00e9 de Limoges, Limoges, France","institution_ids":["https://openalex.org/I65806277"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100545969","display_name":"Ngoc Nguyen Tran","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":"Ngoc Nguyen Tran","raw_affiliation_strings":["Laboratoire XLIM, Universit\u00e9 de Limoges, Limoges, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire XLIM, Universit\u00e9 de Limoges, Limoges, France","institution_ids":["https://openalex.org/I65806277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074795044"],"corresponding_institution_ids":["https://openalex.org/I65806277"],"apc_list":null,"apc_paid":null,"fwci":1.2593,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77828054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"34","issue":"5","first_page":"991","last_page":"1013"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9965999722480774,"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.9959999918937683,"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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.8857669830322266},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6762068271636963},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6662378907203674},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6556260585784912},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6342101693153381},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6211172938346863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5479207634925842},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5358368754386902},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.49834704399108887},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4959500730037689},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44902902841567993},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4238021969795227},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.4135139286518097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36330071091651917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3426694869995117},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3226472735404968},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.1268751323223114}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8857669830322266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6762068271636963},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6662378907203674},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6556260585784912},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6342101693153381},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6211172938346863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5479207634925842},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5358368754386902},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.49834704399108887},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4959500730037689},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44902902841567993},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4238021969795227},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.4135139286518097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36330071091651917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3426694869995117},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3226472735404968},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.1268751323223114},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2018.1528250","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1528250","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02415154v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02415154","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":"Optimization Methods and Software, 2018, 34 (5), pp.991-1013. ⟨10.1080/10556788.2018.1528250⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W180478659","https://openalex.org/W824001712","https://openalex.org/W1748199557","https://openalex.org/W1956889497","https://openalex.org/W1967695340","https://openalex.org/W1977108089","https://openalex.org/W1982935349","https://openalex.org/W2006449495","https://openalex.org/W2025644537","https://openalex.org/W2033624514","https://openalex.org/W2034835449","https://openalex.org/W2061646356","https://openalex.org/W2068484625","https://openalex.org/W2069159962","https://openalex.org/W2073783149","https://openalex.org/W2085400344","https://openalex.org/W2087542711","https://openalex.org/W2088422447","https://openalex.org/W2096686957","https://openalex.org/W2101337987","https://openalex.org/W2111920137","https://openalex.org/W2123871098","https://openalex.org/W2149454052","https://openalex.org/W2160559638","https://openalex.org/W2327853323","https://openalex.org/W2583926461","https://openalex.org/W2818269273","https://openalex.org/W2892650854","https://openalex.org/W4240022917"],"related_works":["https://openalex.org/W4313189992","https://openalex.org/W2615021531","https://openalex.org/W1903454366","https://openalex.org/W1788398095","https://openalex.org/W2076134677","https://openalex.org/W1989415423","https://openalex.org/W1948655259","https://openalex.org/W3105202832","https://openalex.org/W59247221","https://openalex.org/W2778996617"],"abstract_inverted_index":{"We":[0,61,107],"present":[1],"a":[2,5,10,15,66],"modification":[3],"of":[4,21,39,46,52,69,77,79,99],"primal-dual":[6],"algorithm":[7,55,81,118],"based":[8],"on":[9],"mixed":[11],"augmented":[12],"Lagrangian":[13],"and":[14,43,125],"log-barrier":[16],"penalty":[17],"function.":[18],"The":[19,49],"goal":[20],"this":[22,116],"new":[23,117],"feature":[24],"is":[25,33,56,87,90,119],"to":[26,35,82,113,122],"quickly":[27],"detect":[28,123],"infeasibility.":[29],"An":[30],"additional":[31],"parameter":[32],"introduced":[34],"balance":[36],"the":[37,40,44,47,53,70,73,75,80,91,97,104,129,133],"minimization":[38],"objective":[41],"function":[42],"realization":[45],"constraints.":[48],"global":[50],"convergence":[51,78,94],"modified":[54],"analysed":[57],"under":[58,65],"mild":[59],"assumptions.":[60],"also":[62],"show":[63,114],"that":[64,115],"suitable":[67],"choice":[68],"parameters":[71],"along":[72],"iterations,":[74],"rate":[76],"an":[83],"infeasible":[84,105],"stationary":[85],"point":[86,101],"superlinear.":[88],"This":[89],"first":[92],"local":[93],"result":[95],"for":[96],"class":[98],"interior":[100],"methods":[102],"in":[103,132],"case.":[106,135],"finally":[108],"report":[109],"some":[110],"numerical":[111],"experiments":[112],"quite":[120],"efficient":[121],"infeasibility":[124],"does":[126],"not":[127],"deteriorate":[128],"overall":[130],"behavior":[131],"general":[134]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}