\(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
type: Item
instance of: scholarly article
title: \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
author: Kai Pfeiffer
author: Adrien Escande
author: Ludovic Righetti
published in: Optimization and Engineering
publication date: 2024-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7881277
zbMATH Keywords: numerical optimization
zbMATH Keywords: real time robot control
zbMATH Keywords: hierarchical least-squares programming
zbMATH Keywords: nullspace method
zbMATH Keywords: lexicographical optimization
zbMATH Keywords: multi-objective optimization
MaRDI profile type: MaRDI publication profile
cites work: Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
cites work: QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
cites work: Numerical solution of saddle point problems
cites work: Q4868585
cites work: Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
cites work: Large sparse numerical optimization
cites work: A deterministic algorithm for global multi-objective optimization
cites work: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: Maintaining LU factors of a general sparse matrix
cites work: Partitioning multiple objective optimal solutions with applications in radiotherapy design
cites work: A new polynomial-time algorithm for linear programming
cites work: A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Q4324980
cites work: Q5491447
cites work: Multi-objective approaches to ground station scheduling for optimization of communication with satellites
cites work: Application of interior-point methods to model predictive control
cites work: GPU parameter tuning for tall and skinny dense linear least squares problems
cites work: Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
cites work: OSQP: An Operator Splitting Solver for Quadratic Programs
cites work: LOQO:an interior point code for quadratic programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: A polynomial time infeasible interior-point arc-search algorithm for convex optimization
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
DOI: 10.1007/S11081-023-09823-X
description: scientific article; zbMATH DE number 7881277