Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
14 324,00 JPY
Typical price1 079,29 PLN
Lowest (90 days)71,50 PLN
Offers6
Last updated1 тиждень тому
Price history (90 days)
Full history
2026-08-08
2026-08-15
| Оновлено | Ціна |
|---|---|
| 2026-08-08 | 84,99 |
| 2026-08-15 | 71,50 |
| Продавець | Product price | Delivery | Усього | Наявність | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 14 299,00 JPY | 25,00 JPY | 14 324,00 JPY | Доступно | 1 день тому | View offer |
| SP Springer Nature Author | 14 299,00 JPY | 25,00 JPY | 14 324,00 JPY | Доступно | 1 тиждень тому | View offer |
| SP SpringerNatureLink Shop INT | 99,99 USD | free | 99,99 USD | Доступно | 1 день тому | View offer |
| SP SpringerNatureLink Shop INT | 109,99 USD | 15,00 USD | 124,99 USD | Доступно | 1 день тому | View offer |
| SP SpringerNatureLink Shop INT | 109,99 USD | 19,00 USD | 128,99 USD | Доступно | 1 день тому | View offer |
| SP SpringerNatureLink Shop INT | 118,00 EUR | 29,00 EUR | 147,00 EUR | Доступно | 1 день тому | View offer |
Ціни та наявність можуть змінюватися. Останнє оновлення: 08.08.2026 23:21.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
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.