{"id":"https://openalex.org/W1975852795","doi":"https://doi.org/10.1007/s101070050003","title":"An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints","display_name":"An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints","publication_year":2000,"publication_date":"2000-05-01","ids":{"openalex":"https://openalex.org/W1975852795","doi":"https://doi.org/10.1007/s101070050003","mag":"1975852795"},"language":"en","primary_location":{"id":"doi:10.1007/s101070050003","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050003","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/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]},{"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":"Le Thi Hoai An","raw_affiliation_strings":["Mathematical Modelling and Applied Optimization Group, Laboratory of Mathematics, National Institute for Applied Sciences-Rouen, BP 8, F 76 131 Mont Saint Aignan Cedex, France, e-mail: lethi@insa-rouen.fr, FR"],"affiliations":[{"raw_affiliation_string":"Mathematical Modelling and Applied Optimization Group, Laboratory of Mathematics, National Institute for Applied Sciences-Rouen, BP 8, F 76 131 Mont Saint Aignan Cedex, France, e-mail: lethi@insa-rouen.fr, FR","institution_ids":["https://openalex.org/I88814501","https://openalex.org/I196454796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042936176"],"corresponding_institution_ids":["https://openalex.org/I196454796","https://openalex.org/I88814501"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0488,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.77155172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"87","issue":"3","first_page":"401","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9718000292778015,"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.781338095664978},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.6564595699310303},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5582345724105835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5080709457397461},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4847390353679657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.466608464717865},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45724251866340637},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.455231249332428},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.41246476769447327},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.38931480050086975},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3422507047653198},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.21292662620544434}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.781338095664978},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.6564595699310303},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5582345724105835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5080709457397461},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4847390353679657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.466608464717865},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45724251866340637},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.455231249332428},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.41246476769447327},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.38931480050086975},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3422507047653198},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.21292662620544434},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s101070050003","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050003","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-01636775v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-01636775","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, 2000, 87 (3), pp.401 - 426. ⟨10.1007/s101070050003⟩","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":12,"referenced_works":["https://openalex.org/W625539078","https://openalex.org/W1568288633","https://openalex.org/W1966349642","https://openalex.org/W1991638696","https://openalex.org/W2037805287","https://openalex.org/W2038497950","https://openalex.org/W2042532613","https://openalex.org/W2089986028","https://openalex.org/W2100440346","https://openalex.org/W2144963972","https://openalex.org/W2229839854","https://openalex.org/W2527075805"],"related_works":["https://openalex.org/W2108516953","https://openalex.org/W2140018151","https://openalex.org/W3084689723","https://openalex.org/W3161275408","https://openalex.org/W4381623700","https://openalex.org/W4321613417","https://openalex.org/W2811183536","https://openalex.org/W3088056528","https://openalex.org/W2083014164","https://openalex.org/W2317735557"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}