A parallel quadratic programming method for dynamic optimization problems
From MaRDI portal
Recommendations
- Parallel orthogonal factorization null-space method for dynamic quadratic programming
- A dynamic system approach to quadratic programming problems with penalty method
- Data Parallel Quadratic Programming on Box-Constrained Problems
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Parallel interior-point method for linear and quadratic programs with special structure
Cites work
- scientific article; zbMATH DE number 5859820 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1215253 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1163807 (Why is no real title available?)
- scientific article; zbMATH DE number 1373512 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A nonsmooth Newton's method for discretized optimal control problems with state and control constraints
- A nonsmooth version of Newton's method
- A numerically stable dual method for solving strictly convex quadratic programs
- A tolerant algorithm for linearly constrained optimization calculations
- An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An online active set strategy to overcome the limitations of explicit MPC
- Application of interior-point methods to model predictive control
- Block-structured quadratic programming for the direct multiple shooting method for optimal control
- Introductory lectures on convex optimization. A basic course.
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Numerically stable methods for quadratic programming
- On the Implementation of a Primal-Dual Interior Point Method
- Partitioned Dynamic Programming for Optimal Control
- qpOASES: a parametric active-set algorithm for~quadratic programming
Cited in
(23)- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- A parallel Newton-type method for nonlinear model predictive control
- Numerical structure of the Hessian of the Lagrange dual function for a class of convex problems
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- Multiple shooting in a microsecond
- ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
- Parallel orthogonal factorization null-space method for dynamic quadratic programming
- A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
- qpDUNES
- Distributed Newton algorithm for a special quadratic programming problem
- Inexact Newton-type optimization with iterated sensitivities
- Multi-level iterations for economic nonlinear model predictive control
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- A combined first‐ and second‐order approach for model predictive control
- From linear to nonlinear MPC: bridging the gap via the real-time iteration
- Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- ParNMPC -- a parallel optimisation toolkit for real-time nonlinear model predictive control
- A dual Newton strategy for scenario decomposition in robust multistage MPC
- Distributed optimization and control with ALADIN
- A dual Newton strategy for tree-sparse quadratic programs and its implementation in the open-source software treeQP
This page was built for publication: A parallel quadratic programming method for dynamic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499159)
