Abstract
We propose stochastic convex semidefinite programs (SCSDPs) to handle uncertain data in applications. For these models, we design an efficient inexact stochastic approximation (SA) method and prove the convergence, complexity, and robust treatment of the algorithm. We apply the inexact method for solving SCSDPs where the subproblem in each iteration is only solved approximately and show that it enjoys the similar iteration complexity as the exact counterpart if the subproblems are progressively solved to sufficient accuracy. Numerical experiments show that the method we proposed was effective for uncertain problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
