NIPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
From MaRDI portal
Publication:6572715
Recommendations
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- Application of interior-point methods to model predictive control
- FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs
- A regularized interior-point method for constrained linear least squares
- A primal-dual interior-point method for robust optimal control of linear discrete-time systems
Cites work
- A deterministic algorithm for global multi-objective optimization
- A new polynomial-time algorithm for linear programming
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization
- A practical anti-cycling procedure for linearly constrained optimization
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Application of interior-point methods to model predictive control
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- GPU parameter tuning for tall and skinny dense linear least squares problems
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Large sparse numerical optimization
- LOQO:an interior point code for quadratic programming
- Maintaining LU factors of a general sparse matrix
- Multi-objective approaches to ground station scheduling for optimization of communication with satellites
- Numerical solution of saddle point problems
- On the Global Convergence of a Filter--SQP Algorithm
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- OSQP: an operator splitting solver for quadratic programs
- Partitioning multiple objective optimal solutions with applications in radiotherapy design
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
Cited in
(1)
This page was built for publication: \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572715)
