Cart
Create Account
Sign In
Collection:
The log-determinant optimization problem with general matrix constraints arises in many applications. The log-determinant term hampers the scalability of existing methods. This paper proposes a highly efficient stochastic method that has time complexity O
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Videos in this product
Primal-Dual Stochastic Subgradient Method For Log-Determinant Optimization
The log-determinant optimization problem with general matrix constraints arises in many applications. The log-determinant term hampers the scalability of existing methods. This paper proposes a highly efficient stochastic method that has time complexity O