{"id":"https://openalex.org/W1980551102","doi":"https://doi.org/10.1137/s1056263493260386","title":"An Algorithm for the Inequality-Constrained Discrete Min--Max Problem","display_name":"An Algorithm for the Inequality-Constrained Discrete Min--Max Problem","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W1980551102","doi":"https://doi.org/10.1137/s1056263493260386","mag":"1980551102"},"language":"en","primary_location":{"id":"doi:10.1137/s1056263493260386","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1056263493260386","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/A5005628088","display_name":"Ber\u00e7 R\u00fcstem","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Berc Rustem","raw_affiliation_strings":["Imperial College London,#TAB#"],"affiliations":[{"raw_affiliation_string":"Imperial College London,#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065710302","display_name":"Quoc Chinh Nguyen","orcid":"https://orcid.org/0000-0002-1692-1918"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quoc Nguyen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005628088"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":2.20139771,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.87662026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"8","issue":"1","first_page":"265","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9934999942779541,"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.9934999942779541,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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.8244664669036865},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7770081758499146},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6570776104927063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6558504104614258},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6207607984542847},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.49351656436920166},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.47324782609939575},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.45082661509513855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32343143224716187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14388200640678406}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8244664669036865},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7770081758499146},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6570776104927063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6558504104614258},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6207607984542847},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.49351656436920166},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.47324782609939575},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.45082661509513855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32343143224716187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14388200640678406},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/s1056263493260386","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1056263493260386","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":[{"display_name":"Reduced inequalities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W87985779","https://openalex.org/W1976202852","https://openalex.org/W1980665525","https://openalex.org/W1985610252","https://openalex.org/W1986947514","https://openalex.org/W1989589595","https://openalex.org/W1994181610","https://openalex.org/W1994772893","https://openalex.org/W1996881663","https://openalex.org/W1998260066","https://openalex.org/W2006750587","https://openalex.org/W2018429185","https://openalex.org/W2022855030","https://openalex.org/W2023562587","https://openalex.org/W2029877964","https://openalex.org/W2045691556","https://openalex.org/W2063767894","https://openalex.org/W2084478514","https://openalex.org/W2085370962","https://openalex.org/W2128071598","https://openalex.org/W2134383774","https://openalex.org/W2159686234","https://openalex.org/W2270864342","https://openalex.org/W2502011505"],"related_works":["https://openalex.org/W2027659296","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/W4313189992","https://openalex.org/W2615021531","https://openalex.org/W2030310352"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"discuss":[4],"an":[5,8,28],"approach":[6],"using":[7],"augmented":[9],"Lagrangian":[10],"formulation":[11],"to":[12,39],"directly":[13],"solve":[14],"the":[15,50,57,67],"inequality":[16,51],"constrained":[17],"min--max":[18],"problem.":[19],"The":[20,64],"algorithm":[21,68],"involves":[22],"a":[23,35],"sequential":[24],"quadratic":[25],"programming":[26],"subproblem,":[27],"adaptive":[29],"penalty":[30,58],"parameter":[31,59],"selection":[32],"rule,":[33],"and":[34,47,71],"stepsize":[36],"strategy,":[37],"convergent":[38],"unit":[40],"steps,":[41],"that":[42,56],"ensures":[43],"progress":[44],"toward":[45],"optimality":[46],"feasibility":[48],"of":[49,66],"constraints.":[52],"It":[53],"is":[54,69,75],"shown":[55],"does":[60],"not":[61],"grow":[62],"indefinitely.":[63],"convergence":[65],"established,":[70],"its":[72],"numerical":[73],"effectiveness":[74],"demonstrated":[76],"with":[77],"test":[78],"examples.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}