{"id":"https://openalex.org/W2102212721","doi":"https://doi.org/10.1109/cdc.2003.1271666","title":"Constrained quadratic programming techniques for control allocation","display_name":"Constrained quadratic programming techniques for control allocation","publication_year":2004,"publication_date":"2004-04-23","ids":{"openalex":"https://openalex.org/W2102212721","doi":"https://doi.org/10.1109/cdc.2003.1271666","mag":"2102212721"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2003.1271666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1271666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5055762342","display_name":"John Petersen","orcid":null},"institutions":[{"id":"https://openalex.org/I1306686416","display_name":"RTX (United States)","ror":"https://ror.org/0354t7b78","country_code":"US","type":"company","lineage":["https://openalex.org/I1306686416"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.A.M. Petersen","raw_affiliation_strings":["Department of Guidance, Navigation, and Control, Raytheon Missile Systems Company, Tucson, AR, USA","Dept. of Guidance, Navigation & Control, Raytheon Missile Syst., Tucson, AR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Guidance, Navigation, and Control, Raytheon Missile Systems Company, Tucson, AR, USA","institution_ids":["https://openalex.org/I1306686416"]},{"raw_affiliation_string":"Dept. of Guidance, Navigation & Control, Raytheon Missile Syst., Tucson, AR, USA","institution_ids":["https://openalex.org/I1306686416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066324401","display_name":"Marc Bodson","orcid":"https://orcid.org/0000-0003-3707-7151"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Bodson","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Utah, Salt Lake, UT, USA","University of Utah,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Utah, Salt Lake, UT, USA","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"University of Utah,","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4667,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.95505618,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3378","last_page":"3383"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11236","display_name":"Control Systems and Identification","score":0.9959999918937683,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7821987867355347},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7666118144989014},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7507491111755371},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5244953036308289},{"id":"https://openalex.org/keywords/active-set-method","display_name":"Active set method","score":0.5050049424171448},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5006520748138428},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47497767210006714},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4641619324684143},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4493100643157959},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4469906687736511},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4170876145362854},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.41648489236831665},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.41573068499565125},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.41380447149276733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3297807276248932},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.17982599139213562},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.08451196551322937}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7821987867355347},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7666118144989014},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7507491111755371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5244953036308289},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.5050049424171448},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5006520748138428},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47497767210006714},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4641619324684143},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4493100643157959},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4469906687736511},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4170876145362854},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.41648489236831665},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.41573068499565125},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.41380447149276733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3297807276248932},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.17982599139213562},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.08451196551322937},{"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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2003.1271666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1271666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W100063776","https://openalex.org/W1518039036","https://openalex.org/W1521448255","https://openalex.org/W1981745143","https://openalex.org/W1987582714","https://openalex.org/W1995535418","https://openalex.org/W2006884874","https://openalex.org/W2008772536","https://openalex.org/W2043939904","https://openalex.org/W2065466354","https://openalex.org/W2069426496","https://openalex.org/W2071563913","https://openalex.org/W2075194837","https://openalex.org/W2077658674","https://openalex.org/W2086867325","https://openalex.org/W2088920186","https://openalex.org/W2098144951","https://openalex.org/W2135496390","https://openalex.org/W2141548839","https://openalex.org/W2166915107","https://openalex.org/W2168605212","https://openalex.org/W2324717829","https://openalex.org/W2582124322","https://openalex.org/W2798766386","https://openalex.org/W4235844675","https://openalex.org/W4236752279","https://openalex.org/W4396738453"],"related_works":["https://openalex.org/W4313119266","https://openalex.org/W4389749172","https://openalex.org/W2357193936","https://openalex.org/W2077274614","https://openalex.org/W3121603694","https://openalex.org/W1985181089","https://openalex.org/W2388495914","https://openalex.org/W2382819838","https://openalex.org/W2034618192","https://openalex.org/W2021667348"],"abstract_inverted_index":{"The":[0,20,39],"paper":[1],"considers":[2],"the":[3,59,65,70,74,89,100,103],"objective":[4,31],"of":[5,41,64,73,84,102],"optimally":[6],"specifying":[7],"redundant":[8],"actuators":[9],"under":[10],"constraints,":[11],"a":[12,25,35],"problem":[13,21,108],"commonly":[14],"referred":[15],"to":[16,34,57,79,88],"as":[17,24],"control":[18],"allocation.":[19],"is":[22,45,77,92],"posed":[23],"mixed":[26],"/spl":[27],"lscr//sub":[28],"2/-norm":[29],"optimization":[30],"and":[32,51,62,96],"converted":[33],"quadratic":[36],"programming":[37],"formulation.":[38],"implementation":[40],"an":[42],"interior-point":[43,67,75],"algorithm":[44,104],"presented.":[46],"Alternative":[47],"methods":[48,54],"including":[49],"fixed-point":[50],"active":[52],"set":[53],"are":[55],"used":[56],"evaluate":[58],"reliability,":[60],"accuracy":[61],"efficiency":[63],"primal-dual":[66],"method.":[68],"While":[69],"computational":[71],"load":[72],"method":[76],"found":[78],"be":[80],"greater":[81],"for":[82],"problems":[83],"small":[85],"size,":[86],"convergence":[87],"optimal":[90],"solution":[91],"also":[93],"more":[94],"uniform":[95],"predictable.":[97],"In":[98],"addition,":[99],"properties":[101],"scale":[105],"favorably":[106],"with":[107],"size.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}