Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit
✦ LIBER ✦
Low-discrepancy sampling for approximate dynamic programming with local approximators
✍ Scribed by Cervellera, C.; Gaggero, M.; Macciò, D.
- Book ID
- 122771624
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 454 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Approximation Algorithms and Semidefinit
✍
Gärtner, Bernd; Matousek, Jiri
📂
Article
📅
2011
🏛
Springer Berlin Heidelberg
🌐
German
⚖ 204 KB
Sampled fictitious play for approximate
✍
Marina Epelman; Archis Ghate; Robert L. Smith
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 701 KB
Reinforcement Learning and Approximate D
✍
Lewis, Frank L.; Liu, Derong
📂
Article
📅
2013
🏛
John Wiley & Sons, Inc.
🌐
English
⚖ 319 KB
Reinforcement learning (RL) and adaptive dynamic programming (ADP) has been one of the most critical research fields in science and engineering for modern complex systems. This book describes the latest RL and ADP techniques for decision and control in human engineered systems, covering both single
Adaptive stepsizes for recursive estimat
✍
Abraham P. George; Warren B. Powell
📂
Article
📅
2006
🏛
Springer
🌐
English
⚖ 925 KB
Sample approximation technique for mixed
✍
Martin Branda
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 222 KB
Sample approximation technique for mixed
✍
Martin Branda
📂
Article
📅
2013
🏛
Springer-Verlag
🌐
English
⚖ 192 KB