Abstract
Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
Full Text
Sign-in/Register to access full text options
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have