{"id":"https://openalex.org/W2014405554","doi":"https://doi.org/10.1137/s1052623493246045","title":"A New Algorithm for Solving Strictly Convex Quadratic Programs","display_name":"A New Algorithm for Solving Strictly Convex Quadratic Programs","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2014405554","doi":"https://doi.org/10.1137/s1052623493246045","mag":"2014405554"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623493246045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493246045","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/A5100326394","display_name":"Wu Li","orcid":"https://orcid.org/0000-0003-3854-4268"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000060963","display_name":"J. J. Swetits","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Swetits","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1689,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.9471831,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"3","first_page":"595","last_page":"619"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9817000031471252,"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.765779972076416},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7306017279624939},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.6547876000404358},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5651208758354187},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5479301810264587},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5355292558670044},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.49492138624191284},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.46201908588409424},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.45147788524627686},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44399142265319824},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.43789392709732056},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.43720579147338867},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.42919689416885376},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.4145588278770447}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.765779972076416},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7306017279624939},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.6547876000404358},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5651208758354187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5479301810264587},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5355292558670044},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.49492138624191284},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.46201908588409424},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.45147788524627686},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44399142265319824},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.43789392709732056},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.43720579147338867},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.42919689416885376},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.4145588278770447},{"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/s1052623493246045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493246045","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W92038506","https://openalex.org/W1583089965","https://openalex.org/W1970553957","https://openalex.org/W1972223440","https://openalex.org/W1974221673","https://openalex.org/W1975017829","https://openalex.org/W1975316900","https://openalex.org/W1982325686","https://openalex.org/W1988849934","https://openalex.org/W2002854334","https://openalex.org/W2011925679","https://openalex.org/W2024483461","https://openalex.org/W2026289804","https://openalex.org/W2029084473","https://openalex.org/W2032024979","https://openalex.org/W2038497950","https://openalex.org/W2039110906","https://openalex.org/W2040438257","https://openalex.org/W2042613327","https://openalex.org/W2047391904","https://openalex.org/W2053299192","https://openalex.org/W2057697122","https://openalex.org/W2061211758","https://openalex.org/W2061907550","https://openalex.org/W2064449121","https://openalex.org/W2065554534","https://openalex.org/W2068484625","https://openalex.org/W2069053817","https://openalex.org/W2070208792","https://openalex.org/W2078271509","https://openalex.org/W2086643048","https://openalex.org/W2090963365","https://openalex.org/W2093246563","https://openalex.org/W2105207928","https://openalex.org/W2136885855","https://openalex.org/W2159307101","https://openalex.org/W4248231329","https://openalex.org/W4301681840"],"related_works":["https://openalex.org/W2233303476","https://openalex.org/W4298879965","https://openalex.org/W2951903936","https://openalex.org/W1985181089","https://openalex.org/W4232508221","https://openalex.org/W4231773446","https://openalex.org/W3206492465","https://openalex.org/W2364127131","https://openalex.org/W2348400506","https://openalex.org/W2911254004"],"abstract_inverted_index":{"We":[0],"reformulate":[1],"convex":[2,11,20,32,58,69],"quadratic":[3,12,21,33,41,59,70],"programs":[4,13],"with":[5],"simple":[6],"bound":[7],"constraints":[8],"and":[9,84],"strictly":[10,68],"as":[14],"problems":[15],"of":[16,19,30,56,66,80],"unconstrained":[17,64],"minimization":[18],"splines.":[22],"Therefore,":[23],"any":[24],"algorithm":[25],"for":[26],"finding":[27],"a":[28,31,49,54,57,67,77,81],"minimizer":[29,55],"spline":[34,60],"can":[35],"be":[36],"used":[37],"to":[38,52],"solve":[39],"these":[40],"programming":[42,71],"problems.":[43],"In":[44],"this":[45],"paper,":[46],"we":[47],"propose":[48],"Newton":[50,74],"method":[51,75,83],"find":[53],"derived":[61],"from":[62],"the":[63],"reformulation":[65],"problem.":[72],"The":[73],"is":[76,90],"\"natural":[78],"mixture\"":[79],"descent":[82],"an":[85,91],"active-set":[86],"method.":[87],"Moreover,":[88],"it":[89,95],"iterative":[92],"method,":[93],"yet":[94],"terminates":[96],"in":[97],"finite":[98],"operations":[99],"(in":[100],"exact":[101],"arithmetic).":[102]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}