{"id":"https://openalex.org/W4409683245","doi":"https://doi.org/10.1109/lcsys.2025.3563219","title":"Optimal Preconditioning for Online Quadratic Cone Programming","display_name":"Optimal Preconditioning for Online Quadratic Cone Programming","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4409683245","doi":"https://doi.org/10.1109/lcsys.2025.3563219"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2025.3563219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3563219","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","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/A5084320413","display_name":"Abhinav G. Kamath","orcid":"https://orcid.org/0000-0003-1812-6640"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhinav G. Kamath","raw_affiliation_strings":["William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1812-6640","affiliations":[{"raw_affiliation_string":"William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I46020346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079435982","display_name":"Purnanand Elango","orcid":"https://orcid.org/0000-0002-1856-220X"},"institutions":[{"id":"https://openalex.org/I4210159266","display_name":"Mitsubishi Electric (United States)","ror":"https://ror.org/053jnhe44","country_code":"US","type":"company","lineage":["https://openalex.org/I1306287861","https://openalex.org/I4210133125","https://openalex.org/I4210159266"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Purnanand Elango","raw_affiliation_strings":["Mitsubishi Electric Research Laboratories, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1856-220X","affiliations":[{"raw_affiliation_string":"Mitsubishi Electric Research Laboratories, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210159266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044772884","display_name":"Beh\u00e7et A\u00e7\u0131kme\u015fe","orcid":"https://orcid.org/0000-0002-8693-8109"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Beh\u00e7et A\u00e7\u0131kme\u015fe","raw_affiliation_strings":["William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8693-8109","affiliations":[{"raw_affiliation_string":"William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I46020346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3733,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81100688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"9","issue":null,"first_page":"108","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9926999807357788,"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.9836999773979187,"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/second-order-cone-programming","display_name":"Second-order cone programming","score":0.7475160360336304},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5970807671546936},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.5753915905952454},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5657671689987183},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4402744174003601},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3979151248931885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36301949620246887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25149059295654297},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18599599599838257},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.047066718339920044}],"concepts":[{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.7475160360336304},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5970807671546936},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.5753915905952454},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5657671689987183},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4402744174003601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3979151248931885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36301949620246887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25149059295654297},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18599599599838257},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.047066718339920044},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcsys.2025.3563219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3563219","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1405150090","display_name":"THE PRIMARY GOAL OF THE PROPOSED EFFORT IS TO DEVELOP DUAL QUATERNION BASED METHODS AND ALGORITHMS TO SOLVE COMPLEX COUPLED 6-DEGREE-OF-FREEDOM (6-DOF)  ROTATIONAL AND TRANSLATIONAL  SPACE VEHICLE GUIDANCE PROBLEMS. MANY NASA MISSIONS  CURRENT OR PLANNED  REQUIRE COMPLEX GUIDANCE TRAJECTORIES TO ACHIEVE MISSION GOALS. CURRENT GUIDANCE APPROACHES RELY ON CLEVER ENGINEERING HEURISTICS AND EXTENSIVE PRE-MISSION PLANNING AND ANALYSIS  AND HENCE THEY ONLY PROVIDE A LIMITED AUTONOMY  WHICH IS SOMETIMES REFERRED TO AS MANAGED AUTONOMY. THE MAIN TECHNICALCHALLENGE IS THAT MOST OF THESE GUIDANCE PROBLEMS HAVE DEMANDING MISSION AND VEHICLE CONSTRAINTS AND REQUIREMENTS THAT MUST BE SATISFIED. HENCE THE RESULTING PROBLEMS ARE COMPLEX OPTIMIZATION PROBLEMS THAT ARE HARD TO SOLVE  ESPECIALLY ONBOARD IN REAL-TIME. TO THIS END  WE PROPOSE TO DEVELOP A DUAL QUATERNION BASED FORMULATION OF THE GUIDANCE PROBLEMS TO OBTAIN NUMERICALLY TRACTABLE OPTIMIZATION PROBLEMS  WHOSE SOLUTIONS CAN BE COMPUTED ROBUSTLY ANDEFFICIENTLY. SPECIFICALLY  THE RESULTING PROBLEMS WILL BE CONVEX OPTIMIZATION PROBLEMS  WHOSE OPTIMAL SOLUTIONS CAN BE OBTAINED VERY RAPIDLY WITH DETERMINISTIC GUARANTEES. CONVEX OPTIMIZATION BASED ALGORITHMS HAVE RECENTLY BEEN DEMONSTRATED ON MARS PINPOINT LANDING POWERED DESCENT GUIDANCE PROBLEM IN ACTUAL FLIGHT TESTS AND PROVED TO BE AN ENABLING CAPABILITY. THOUGH THE PROPOSED EFFORT RELIES ON CONVEX OPTIMIZATION METHODS TO SOLVE GUIDANCE PROBLEMS  IT IS FUNDAMENTALLY DIFFERENT AND NEW IN TWO KEY ASPECTS:I) THE PROPOSED EFFORT FOCUS ON A DIFFERENT CLASS OF APPLICATIONS  NAMELY MOON OR PRIMITIVE LANDING MISSIONS (BOTH MANNED AND UNMANNED) WHERE THERE IS NO ENTRY PHASE  AND MANY MISSION CONSTRAINT ARE 6-DOF COUPLED IN ATTITUDE AND TRANSLATION.II) WE UTILIZE DUAL QUATERNION FORMULATION RATHER THAN STANDARD SPACE VEHICLE STATES  WHICH INHERENTLY COUPLES ATTITUDE AND TRANSLATIONAL MOTION. MOON AND PRIMITIVE BODY (COMETS AND ASTEROIDS) MISSIONS REQUIRE ACTIVE CONTROL THROUGHOUT THE PROXIMITY OPERATIONS. AS VEHICLES GET CLOSER TO THE SURFACE  TERRAIN RELATIVE NAVIGATION (TRN)SENSORS  SUCH AS THOSE DEVELOPED UNDER AUTONOMOUS LANDING AND HAZARD AVOIDANCE TECHNOLOGY (ALHAT) PROGRAM  SHOULD BE ABLE TO OBSERVE THE LANDING SITE WHILE MANEUVERING [1]. HENCEATTITUDE POINTING CONSTRAINTS WILL BE COUPLED WITH THE POSITION OF THE VEHICLE RELATIVE TO THE SITE (WHICH IS A TRANSLATIONAL STATE). SUCH COUPLED TRANSLATIONAL AND ATTITUDE CONSTRAINTS  ARE TYPICALLY STRONGLY NON-CONVEX IF THE STANDARD VEHICLE STATES ARE USED. ON THE OTHER HAND THE UTILIZATION OF DUAL QUATERNIONS TO DESCRIBE VEHICLE STATES NATURALLY ENABLE US TO FORMULATE THESE COMPLEX CONSTRAINTS AS CONVEX CONSTRAINTS ON THE SOLUTION VARIABLES. IN THIS PROJECT  WE EMPLOY THE UNIT DUAL QUATERNION PARAMETERIZATION TO SIMULTANEOUSLY REPRESENT THE ORIENTATION AND POSITION OF THE SPACECRAFT AND PROPOSE THE ROTATIONALLY AND TRANSLATIONALLY CONSTRAINED ZONE FORMULATION WITH UNIT DUAL QUATERNION. INDEED THERE ARE SEVERAL KEY MISSION CONSTRAINTS ENCOUNTERED IN MANY SUCH APPLICATIONS. DUAL QUATERNION FORMULATIONS HOLD THE PROMISE OF NATURALLY CONVEXIFYING THESE INHERENTLY 6-DOF CONSTRAINTS  THEREBY MOTIVATING THE PROPOSED RESEARCH EFFORT.","funder_award_id":"NNX17AH02A","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"},{"id":"https://openalex.org/G5851380093","display_name":null,"funder_award_id":"FA9550-20-1-005","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W205960364","https://openalex.org/W1966333543","https://openalex.org/W1981220107","https://openalex.org/W2003447360","https://openalex.org/W2022144586","https://openalex.org/W2038818107","https://openalex.org/W2063106205","https://openalex.org/W2087617385","https://openalex.org/W2092663520","https://openalex.org/W2116773335","https://openalex.org/W2158449358","https://openalex.org/W2173413132","https://openalex.org/W2288174618","https://openalex.org/W2754918589","https://openalex.org/W2763081248","https://openalex.org/W2769646558","https://openalex.org/W2902496574","https://openalex.org/W2938245968","https://openalex.org/W2963727072","https://openalex.org/W3157524186","https://openalex.org/W3195321777","https://openalex.org/W3208343212","https://openalex.org/W3210839039","https://openalex.org/W4205806761","https://openalex.org/W4211094263","https://openalex.org/W4221148616","https://openalex.org/W4250589301","https://openalex.org/W4297510490","https://openalex.org/W4317568541","https://openalex.org/W4317633841","https://openalex.org/W4320181261","https://openalex.org/W4388918904","https://openalex.org/W4391257613","https://openalex.org/W4391330224","https://openalex.org/W4400115802","https://openalex.org/W4402836670","https://openalex.org/W4407397297","https://openalex.org/W4407951025","https://openalex.org/W6674958657","https://openalex.org/W6800547938","https://openalex.org/W6861909703","https://openalex.org/W6864945519","https://openalex.org/W6869430715"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W4297030264","https://openalex.org/W2949225936","https://openalex.org/W2164807043","https://openalex.org/W2952895455","https://openalex.org/W3206492465","https://openalex.org/W2019128690","https://openalex.org/W4231448069","https://openalex.org/W2128461291"],"abstract_inverted_index":{"First-order":[0],"conic":[1,39,67,108],"optimization":[2,40,68,103],"solvers":[3],"are":[4],"sensitive":[5],"to":[6,27,63,78],"problem":[7,18,88],"conditioning":[8],"and":[9,54,100],"typically":[10],"perform":[11],"poorly":[12],"in":[13],"the":[14,48,73,82,92,111],"face":[15],"of":[16,33,81,94],"ill-conditioned":[17],"data.":[19,89],"To":[20],"mitigate":[21],"this,":[22],"we":[23],"propose":[24],"an":[25],"approach":[26,60,96],"preconditioning\u2013the":[28],"hypersphere":[29],"preconditioner-for":[30],"a":[31,43,56,106],"class":[32],"quadratic":[34,44],"cone":[35],"programs":[36],"(QCPs),":[37],"i.e.,":[38],"problems":[41,80],"with":[42,86],"objective":[45,49],"function,":[46],"wherein":[47,72],"function":[50],"is":[51,75],"strongly":[52],"convex":[53,99],"possesses":[55],"certain":[57],"structure.":[58],"This":[59],"lends":[61],"itself":[62],"factorization-free,":[64],"customizable,":[65],"first-order":[66,107],"for":[69],"online":[70],"applications":[71],"solver":[74],"called":[76],"repeatedly":[77],"solve":[79],"same":[83],"size/structure,":[84],"but":[85],"changing":[87],"We":[90],"demonstrate":[91],"efficacy":[93],"our":[95],"on":[97],"numerical":[98],"nonconvex":[101],"trajectory":[102],"examples,":[104],"using":[105],"optimizer":[109],"under":[110],"hood.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}