A computationally efficient primal-dual solver for linear-quadratic optimal control problems
From MaRDI portal
Cites work
- A primer on monotone operator methods
- A survey on operator splitting and decomposition of convex programs
- Accelerating the cubic regularization of Newton's method on convex problems
- Adaptive restart for accelerated gradient schemes
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Conjugate gradient type methods and preconditioning
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- scientific article; zbMATH DE number 1424232 (Why is no real title available?)
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Metric selection in fast dual forward-backward splitting
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- OSQP: an operator splitting solver for quadratic programs
- Predictive control with constraints
- Proportional-integral projected gradient method for conic optimization
- Some methods of speeding up the convergence of iteration methods
- Weak infeasibility in second order cone programming
This page was built for publication: A computationally efficient primal-dual solver for linear-quadratic optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980018)
