Parallel orthogonal factorization null-space method for dynamic quadratic programming

DOI10.1007/BF02192235zbMath0829.90104MaRDI QIDQ1897460

Yanyan Li

Publication date: 29 January 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

domain decompositionquadratic programsparallel trajectory optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Dynamic programming (90C39) Parallel numerical computation (65Y05)

Related Items (1)

Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel solver for trajectory optimization search directions
• Parallel computation of two-point boundary-value problems via particular solutions
• Epsilon-Ritz method for solving optimal control problems: Useful parallel solution method
• Partitioned Dynamic Programming for Optimal Control
• Trajectory optimization on a parallel processor

This page was built for publication: Parallel orthogonal factorization null-space method for dynamic quadratic programming