Algorithms for Sparsity-Constrained Optimization
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
103,50 GBP
Typical price3 129,87 PLN
Lowest (90 days)117,69 PLN
Offers2
Last updated2일 전
| 판매자 | Product price | Delivery | 합계 | 재고 여부 | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 103,50 GBP | free | 103,50 GBP | 구매 가능 | 3일 전 | View offer |
| SP Springer Nature Author | 21 449,00 JPY | 29,00 JPY | 21 478,00 JPY | 구매 가능 | 2일 전 | View offer |
가격과 재고 여부는 변경될 수 있습니다. 마지막 업데이트: 08.08.2026 23:28.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.