Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control

Current industrial practice knows many optimization tasks that can be cast as mixed-integer optimal control problems. Due to the combinatorial character of these problems, the computation of optimal solutions under real-time constraints is still a demanding challenge. Starting with Bock's direc...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Kirches, Christian (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Wiesbaden : Vieweg+Teubner Verlag, 2011.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02283nam a22004215i 4500
001 978-3-8348-8202-8
003 DE-He213
005 20130726180918.0
007 cr nn 008mamaa
008 111121s2011 gw | s |||| 0|eng d
020 |a 9783834882028  |9 978-3-8348-8202-8 
024 7 |a 10.1007/978-3-8348-8202-8  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.C65 
072 7 |a UGK  |2 bicssc 
072 7 |a COM072000  |2 bisacsh 
082 0 4 |a 003.3  |2 23 
100 1 |a Kirches, Christian.  |e author. 
245 1 0 |a Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control  |h [electronic resource] /  |c by Christian Kirches. 
264 1 |a Wiesbaden :  |b Vieweg+Teubner Verlag,  |c 2011. 
300 |a XX, 367p. 64 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
520 |a Current industrial practice knows many optimization tasks that can be cast as mixed-integer optimal control problems. Due to the combinatorial character of these problems, the computation of optimal solutions under real-time constraints is still a demanding challenge. Starting with Bock's direct multiple shooting method for optimal control, Christian Kirches develops a fast numerical algorithm of wide applicability that efficiently solves mixed-integer nonlinear optimal control problems. He uses convexification and relaxation techniques to obtain computationally tractable reformulations for which feasibility and optimality certificates can be given even after discretization and rounding. In a sequential quadratic programming framework, extensive exploitation of arising structures in an active set method ultimately brings the developed algorithm towards real-time feasibility. 
650 0 |a Computer science. 
650 0 |a Computer simulation. 
650 0 |a Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Simulation and Modeling. 
650 2 4 |a Mathematics, general. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783834815729 
856 4 0 |u http://dx.doi.org/10.1007/978-3-8348-8202-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)