{"id":"https://openalex.org/W4414701130","doi":"https://doi.org/10.1504/ijmor.2025.148875","title":"An adaptive hybrid direction algorithm for convex box-QP problems with enhanced pre-solving","display_name":"An adaptive hybrid direction algorithm for convex box-QP problems with enhanced pre-solving","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414701130","doi":"https://doi.org/10.1504/ijmor.2025.148875"},"language":"en","primary_location":{"id":"doi:10.1504/ijmor.2025.148875","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148875","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","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/A5029852747","display_name":"Abdelhek Laouar","orcid":"https://orcid.org/0000-0003-4240-9210"},"institutions":[{"id":"https://openalex.org/I187560010","display_name":"University of B\u00e9ja\u00efa","ror":"https://ror.org/03yb2hp88","country_code":"DZ","type":"education","lineage":["https://openalex.org/I187560010"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Abdelhek Laouar","raw_affiliation_strings":["Research Unit LaMOS, Department of Operations Research, Faculty of the Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria"],"affiliations":[{"raw_affiliation_string":"Research Unit LaMOS, Department of Operations Research, Faculty of the Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria","institution_ids":["https://openalex.org/I187560010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111663843","display_name":"Mohand Ouamer Bibi","orcid":null},"institutions":[{"id":"https://openalex.org/I187560010","display_name":"University of B\u00e9ja\u00efa","ror":"https://ror.org/03yb2hp88","country_code":"DZ","type":"education","lineage":["https://openalex.org/I187560010"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Mohand Ouamer Bibi","raw_affiliation_strings":["Research Unit LaMOS, Department of Operations Research, Faculty of the Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria"],"affiliations":[{"raw_affiliation_string":"Research Unit LaMOS, Department of Operations Research, Faculty of the Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria","institution_ids":["https://openalex.org/I187560010"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029852747"],"corresponding_institution_ids":["https://openalex.org/I187560010"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35584947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"2","first_page":"251","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.978600025177002,"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"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.965399980545044,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.490200012922287},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4487999975681305},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.4397999942302704},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42250001430511475},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.41519999504089355},{"id":"https://openalex.org/keywords/adaptive-algorithm","display_name":"Adaptive algorithm","score":0.3808000087738037},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.37049999833106995},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.3529999852180481},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.351500004529953}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.703499972820282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49729999899864197},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.490200012922287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47369998693466187},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43779999017715454},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.351500004529953},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.3107999861240387},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.3057999908924103},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.30079999566078186},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.29409998655319214},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.2615000009536743},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmor.2025.148875","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148875","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,64,173],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,24,46,81],"new":[6],"algorithm":[7,20,69,97,111,120],"for":[8,149,165],"solving":[9],"quadratic":[10],"programming":[11],"problem":[12,36],"with":[13,45,90,107,139,156],"box":[14],"constraints.":[15],"The":[16,113],"principle":[17],"of":[18,60,70,78,84,98],"the":[19,29,33,42,57,61,68,71,85,94,99,104,118,129,140,145,150,161,176,183],"is":[21,53,88,169,179],"to":[22,27,55,66,75,135],"apply":[23],"preprocessing":[25],"procedure":[26],"reduce":[28],"original":[30,62],"problem.":[31,63],"Then":[32],"resulting":[34],"reduced":[35,108],"will":[37],"be":[38,136],"solved":[39],"by":[40,182],"applying":[41],"adaptive":[43],"method":[44,73,87,132,143],"hybrid":[47],"direction.":[48],"A":[49,168],"post-processing":[50],"step":[51],"(post-solving)":[52],"necessary":[54],"deduce":[56],"optimal":[58,162,177],"solution":[59,163,178],"order":[65],"test":[67],"proposed":[72,86,119],"and":[74,103,133,144,164],"make":[76],"sure":[77],"its":[79],"effectiveness,":[80],"comparative":[82],"study":[83],"made":[89],"active-set":[91],"quadprog":[92,96],"algorithm,":[93,147],"interior-point-convex":[95],"MATLAB":[100],"optimisation":[101],"toolbox":[102],"modified":[105],"proportioning":[106],"gradient":[109],"projections":[110],"(MPRGP).":[112],"obtained":[114,180],"results":[115],"show":[116],"that":[117],"presents":[121],"good":[122],"performances,":[123],"it":[124],"always":[125],"performs":[126],"better":[127],"than":[128],"active":[130,158],"set":[131],"appears":[134],"very":[137],"competitive":[138],"interior":[141],"point":[142],"MPRGP":[146],"mainly":[148],"problems":[151,166],"having":[152],"|bi|":[153],"sufficiently":[154],"large":[155],"many":[157],"variables":[159],"at":[160],"where":[167],"generalised":[170],"diagonally":[171],"dominant.":[172],"these":[174],"cases,":[175],"only":[181],"pre-solving":[184],"procedure.":[185]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}