articole
(gol)
Contact
Cont 
The first elementary exposition of core ideas of complexity theory for convex optimization, this book explores optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. Also covers polynomial-time interior-point methods.
citește totul
The first elementary exposition of core ideas of complexity theory for convex optimization, this book explores optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. Also covers polynomial-time interior-point methods.
ascunde descrierea
- Editură: Springer International Publishing AG
- Cod:
- Anul publicării: 2018
- Limba: Engleză
- Legarea: Legată
- Număr de pagini: 589
- Lățimea ambalajului: 24.1 cm
- Înălțimea ambalajului: 16.3 cm
- Adâncimea ambalajului: 4.1 cm
- Greutatea ambalajului: 1.1 kg
Recenzii