{"id":"https://openalex.org/W1987228767","doi":"https://doi.org/10.1080/10556780802263990","title":"Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming","display_name":"Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W1987228767","doi":"https://doi.org/10.1080/10556780802263990","mag":"1987228767"},"language":"en","primary_location":{"id":"doi:10.1080/10556780802263990","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780802263990","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"],"host_organization_lineage_names":["Taylor & Francis"],"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/A5101473027","display_name":"Tao Pham Dinh","orcid":"https://orcid.org/0000-0002-2711-2163"},"institutions":[{"id":"https://openalex.org/I196454796","display_name":"Institut National des Sciences Appliqu\u00e9es de Toulouse","ror":"https://ror.org/01h8pf755","country_code":"FR","type":"education","lineage":["https://openalex.org/I196454796","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"T. Pham Dinh","raw_affiliation_strings":["Laboratory of Modelling , Optimization and Operations Research (LMI) National Institute for Applied Sciences , Rouen, Cedex, France","Laboratory of Modelling, Optimization and Operations Research (LMI) National Institute for Applied Sciences, Rouen, Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratory of Modelling , Optimization and Operations Research (LMI) National Institute for Applied Sciences , Rouen, Cedex, France","institution_ids":["https://openalex.org/I196454796"]},{"raw_affiliation_string":"Laboratory of Modelling, Optimization and Operations Research (LMI) National Institute for Applied Sciences, Rouen, Cedex, France#TAB#","institution_ids":["https://openalex.org/I196454796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. A. Le Thi","raw_affiliation_strings":["Laboratory of Theoretical and Applied Computer Science (LITA) UFR MIM , University of Paul Verlaine , Metz, Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science (LITA) UFR MIM , University of Paul Verlaine , Metz, Cedex, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035040805","display_name":"Fran\u00e7ois Bertrand Akoa","orcid":null},"institutions":[{"id":"https://openalex.org/I196454796","display_name":"Institut National des Sciences Appliqu\u00e9es de Toulouse","ror":"https://ror.org/01h8pf755","country_code":"FR","type":"education","lineage":["https://openalex.org/I196454796","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"F. Akoa","raw_affiliation_strings":["Laboratory of Modelling , Optimization and Operations Research (LMI) National Institute for Applied Sciences , Rouen, Cedex, France","Laboratory of Modelling, Optimization and Operations Research (LMI) National Institute for Applied Sciences, Rouen, Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratory of Modelling , Optimization and Operations Research (LMI) National Institute for Applied Sciences , Rouen, Cedex, France","institution_ids":["https://openalex.org/I196454796"]},{"raw_affiliation_string":"Laboratory of Modelling, Optimization and Operations Research (LMI) National Institute for Applied Sciences, Rouen, Cedex, France#TAB#","institution_ids":["https://openalex.org/I196454796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101473027"],"corresponding_institution_ids":["https://openalex.org/I196454796"],"apc_list":null,"apc_paid":null,"fwci":5.6581,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.95727483,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"4","first_page":"609","last_page":"629"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9977999925613403,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8523338437080383},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.734363853931427},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6497396230697632},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6170595288276672},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5425058603286743},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.539490282535553},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5341694951057434},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4657358229160309},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.4603895843029022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4501112997531891},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.43775659799575806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4238250255584717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37835681438446045},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.09090825915336609},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08512091636657715}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8523338437080383},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.734363853931427},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6497396230697632},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6170595288276672},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5425058603286743},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.539490282535553},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5341694951057434},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4657358229160309},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.4603895843029022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4501112997531891},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.43775659799575806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4238250255584717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37835681438446045},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.09090825915336609},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08512091636657715},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780802263990","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780802263990","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"],"host_organization_lineage_names":["Taylor & Francis"],"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-01636749v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-01636749","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, 2008, 23 (4), pp.609 - 629. ⟨10.1080/10556780802263990⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W40680864","https://openalex.org/W55017993","https://openalex.org/W111413457","https://openalex.org/W112685570","https://openalex.org/W147998453","https://openalex.org/W322075565","https://openalex.org/W597306749","https://openalex.org/W1506342804","https://openalex.org/W1506690472","https://openalex.org/W1508335918","https://openalex.org/W1530146942","https://openalex.org/W1538755060","https://openalex.org/W1543439990","https://openalex.org/W1553702074","https://openalex.org/W1568288633","https://openalex.org/W1575701986","https://openalex.org/W1589133845","https://openalex.org/W1596359855","https://openalex.org/W1968553199","https://openalex.org/W1975855784","https://openalex.org/W1976831027","https://openalex.org/W1986354788","https://openalex.org/W1987314831","https://openalex.org/W1990494141","https://openalex.org/W2000151369","https://openalex.org/W2010511518","https://openalex.org/W2030731960","https://openalex.org/W2038497950","https://openalex.org/W2049219350","https://openalex.org/W2051664786","https://openalex.org/W2065887373","https://openalex.org/W2069426496","https://openalex.org/W2071474509","https://openalex.org/W2154951198","https://openalex.org/W2340859457","https://openalex.org/W2607928667","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2388495914","https://openalex.org/W4389749172","https://openalex.org/W2069426496","https://openalex.org/W2382819838","https://openalex.org/W2402755997","https://openalex.org/W2021667348","https://openalex.org/W37880458","https://openalex.org/W2059043079"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"provide":[4],"a":[5,21,37],"new":[6,32],"regularization":[7,33],"technique":[8],"based":[9],"on":[10],"DC":[11,14],"programming":[12,29],"and":[13,51],"Algorithms":[15],"to":[16,36,72],"handle":[17],"indefinite":[18],"Hessians":[19],"in":[20,42,61],"primal\u2013dual":[22],"interior":[23],"point":[24],"context":[25],"for":[26],"nonconvex":[27,74],"quadratic":[28,75],"problems.":[30,84],"The":[31],"leads":[34],"automatically":[35],"strongly":[38],"factorizable":[39],"quasidefinite":[40],"matrix":[41],"the":[43,49,52],"Newton":[44],"system.":[45],"Numerical":[46],"results":[47],"show":[48],"robustness":[50],"efficiency":[53],"of":[54,81],"our":[55,62,65],"approach":[56],"compared":[57],"with":[58],"LOQO.":[59],"Moreover,":[60],"computational":[63],"testing,":[64],"method":[66],"always":[67],"provided":[68],"globally":[69],"optimal":[70],"solutions":[71],"those":[73],"programs":[76],"that":[77],"arise":[78],"from":[79],"reformulations":[80],"linear":[82],"complementarity":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"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":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}