(\mathcal{N}\)IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs

Hierarchical least-squares programs with linear constraints (HLSP) are a type of optimization problem very common in robotics. Each priority level contains an objective in least-squares form which is subject to the linear constraints of the higher priority levels. Active-set methods are a popular ch...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Pfeiffer, Kai, Escande, Adrien, Righetti, Ludovic
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 04.08.2023
Subjects:
Computational efficiency
Computing time
Iterative methods
Least squares
Optimization
Robotics
Solvers
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Hierarchical least-squares programs with linear constraints (HLSP) are a type of optimization problem very common in robotics. Each priority level contains an objective in least-squares form which is subject to the linear constraints of the higher priority levels. Active-set methods are a popular choice for solving them. However, they can perform poorly in terms of computational time if there are large changes of the active set. We therefore propose a computationally efficient primal-dual interior-point method (IPM) for dense HLSP's which is able to maintain constant numbers of solver iterations in these situations. We base our IPM on the computationally efficient nullspace method as it requires only a single matrix factorization per solver iteration instead of two as it is the case for other IPM formulations. We show that the resulting normal equations can be expressed in least-squares form. This avoids the formation of the quadratic Lagrangian Hessian and can possibly maintain high levels of sparsity. Our solver reliably solves ill-posed instantaneous hierarchical robot control problems without exhibiting the large variations in computation time seen in active-set methods.
AbstractList Hierarchical least-squares programs with linear constraints (HLSP) are a type of optimization problem very common in robotics. Each priority level contains an objective in least-squares form which is subject to the linear constraints of the higher priority levels. Active-set methods are a popular choice for solving them. However, they can perform poorly in terms of computational time if there are large changes of the active set. We therefore propose a computationally efficient primal-dual interior-point method (IPM) for dense HLSP's which is able to maintain constant numbers of solver iterations in these situations. We base our IPM on the computationally efficient nullspace method as it requires only a single matrix factorization per solver iteration instead of two as it is the case for other IPM formulations. We show that the resulting normal equations can be expressed in least-squares form. This avoids the formation of the quadratic Lagrangian Hessian and can possibly maintain high levels of sparsity. Our solver reliably solves ill-posed instantaneous hierarchical robot control problems without exhibiting the large variations in computation time seen in active-set methods.
Author Pfeiffer, Kai
Righetti, Ludovic
Escande, Adrien
Author_xml – sequence: 1
  givenname: Kai
  surname: Pfeiffer
  fullname: Pfeiffer, Kai
– sequence: 2
  givenname: Adrien
  surname: Escande
  fullname: Escande, Adrien
– sequence: 3
  givenname: Ludovic
  surname: Righetti
  fullname: Righetti, Ludovic
BookMark eNotj09LwzAchoMoOOc-gLeAFz2k5k-TtN7GmG7QaWE7DsavbeIytsYlnQzE725BTw_v5Xl5btBl61uD0B2jSZpJSZ8gnN1XwhlVCROK8gs04EIwkqWcX6NRjDtKKVeaSykGqHpYH6Db1rD_fvtZP87LBZkVy_IZj1s8tdbVzrQdnredCc4HUnrXz4Xptr7B1gc8cyZAqLeuN-DCQOzI8niCYCIug_8IcIi36MrCPprRP4do9TJdTWakeH-dT8YFAck5yYRSoJuqorXJacU0UEhtzrNKWpEznTdSq0bQmlUUVGqszUHRvlJboTPZiCG6_9N-Bn88mdhtdv4U2v5xw2UqteYp4-IXv6VXZg
ContentType Paper
Copyright 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PTHSS
DOI 10.48550/arxiv.2106.13602
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection (subscription)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database (subscription)
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PTHSS
ID FETCH-LOGICAL-a522-8366a7dbb0ce90b17a0a4f928b5f39179d576d30c1b0a64eff9a601067f3785d3
IEDL.DBID M7S
IngestDate Mon Jun 30 09:33:55 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a522-8366a7dbb0ce90b17a0a4f928b5f39179d576d30c1b0a64eff9a601067f3785d3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2545772412?pq-origsite=%requestingapplication%
PQID 2545772412
PQPubID 2050157
ParticipantIDs proquest_journals_2545772412
PublicationCentury 2000
PublicationDate 20230804
PublicationDateYYYYMMDD 2023-08-04
PublicationDate_xml – month: 08
  year: 2023
  text: 20230804
  day: 04
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2023
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.8399113
SecondaryResourceType preprint
Snippet Hierarchical least-squares programs with linear constraints (HLSP) are a type of optimization problem very common in robotics. Each priority level contains an...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Computational efficiency
Computing time
Iterative methods
Least squares
Optimization
Robotics
Solvers
Title (\mathcal{N}\)IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs
URI https://www.proquest.com/docview/2545772412
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFA66KXjyN_6YIwcPeoh2S_ojXkRlY4OtBLfDhMFImhQL0m7tNgTxfzfJOsWLF4-hUEpCX773ve-9D4DLCHMcG6mOL4hnWnIo4oJIJKijDMIWKrauJT0_DIPRiLKScCtKWeU6JtpALbPIcOS3OpFxNRIkjeb9dIaMa5SprpYWGpugaqYkNKx0b_DNsTQ9XyNmvCpm2tFdtzx_T5Y3Os_xjMDLkim_Q7C9V9q7__2iPVBlfKryfbCh0gOwbfWcUXEIxNVYQ9FXfQAf4ef4usv6qNMbsDv4kMKWnRqhLxto6cAkyxHLEr3sWzdpqGEs7CSmMdn6pLzBnvH3QYPZwvQqQbZSdBVHYNhuDZ86qLRTQFyDLBRgz-O-FMKJFHVEw-cOJzFtBsKNsU7aqNSph8RO1BAO94iKY8ptEdaPsR-4Eh-DSpql6gRA4kYa9VBCOaeEU8wD6hClX06plNJRp6C23rFJ-UsUk5_tOvv78TnYMZ7uVmVHaqAyzxfqAmxFy3lS5HVQfWyF7LluT1qvWLfPXr4A1CizXQ
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB58oiff-DYHBT3E7TbZthFExAe72F0KuwcPwpI0KRZkV1ufiD_J_-gk6ypevHnwWAqBdiaTb2a-yQewnTLJMkvVCRUP7EiOoFJxTZXwjEXYymROtSQOW63o8lIkI_A-nIWxtMphTHSBWvdTWyOvYCJTQyTIq_7R7R21qlG2uzqU0Bi4xYV5ecKUrTxsnKJ9d3z__KxzUqefqgJUItagEQsCGWqlvNQIT1VD6UmeCT9StYxh7iI0InDNvLSqPBlwk2VCul5kmLEwqmmGy47COKIIXzimYPurpOMHIQJ0NuidupvCKrJ4zh_3Ma0KLJ_M1W5-Rnx3jJ3P_LMfMAvjibw1xRyMmN48TDq2alougNq9QqB9je712nq72mskTVqP28kBOe6RM3cnBh6lxBU7835Bk36Oj02nlU0QpJN6bseunQrMDYmtehFt3z3YSSySDPhq5SJ0_uKrlmCs1--ZZSC8liKmE1xIKbgUTEbC4wYXF0Jr7ZkVWB8aqPu54cvut3VWf3-9BVP1TjPuxo3WxRpMW_V6xyfk6zB2XzyYDZhIH-_zsth0zkWg-8e2_AAwagrR
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%28%5Cmathcal%7BN%7D%5C%29IPM-HLSP%3A+An+Efficient+Interior-Point+Method+for+Hierarchical+Least-Squares+Programs&rft.jtitle=arXiv.org&rft.au=Pfeiffer%2C+Kai&rft.au=Escande%2C+Adrien&rft.au=Righetti%2C+Ludovic&rft.date=2023-08-04&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2106.13602