qpDUNES
swMATH ID:  13238 
Software Authors:  Janick Frasch; Hans Joachim Ferreau; Moritz Diehl; Milan Vukov 
Description:  qpDUNES is quadratic programming solver targeted at blockbanded convex QPs that arise in optimal control, dynamic optimization, and estimation. The acronym DUNES stands for dual Newton strategy, the novel solution methodology which this solver implements. See this publication for the mathematical details. qpDUNES is a plain, selfcontained C code written according to the C90 standard to enlarge compatibility with embedded hardware platforms. It comes with its own linear algebra module and efficient data storage formats to better exploit the problem intrinsic structures. Problems can be set up and solved from a C/C++ environment as well as conveniently from MATLAB. qpDUNES provides setup and solve routines (both cold and warmstarted) for multistage QPs, as well as for linear timeinvariant (LTI) and for linear timevarying (LTV) modelpredictive control problems in both environments. For nonlinear model predictive control and moving horizon estimation, the powerful ACADO Toolkit features an interface to use qpDUNES as its workhorse. 
Homepage:  https://github.com/jfrasch/qpDUNES/wiki 
Source Code:  https://github.com/jfrasch/qpDUNES/wiki 
Related Software:  qpOASES; ACADO; CVXGEN; Ipopt; LiftOpt; VIATOC; fast_mpc; BLASFEO; Matlab; FORCES NLP; liftedCollocation; GRAMPC; OSQP; OOQP; RODAS; SUNDIALS; GitHub; MATMPC; QPALM; HPIPM 
Cited in:  16 Publications 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

A parallel quadratic programming method for dynamic optimization problems. Zbl 1321.90094 Frasch, Janick V.; Sager, Sebastian; Diehl, Moritz 
2015

all
top 5
Cited by 25 Authors
all
top 5
Cited in 8 Serials
all
top 5