Corporative Stochastic Approximation with Random Constraint Sampling for Semi-Infinite Programming

Bibliographic Details
Title: Corporative Stochastic Approximation with Random Constraint Sampling for Semi-Infinite Programming
Authors: Wei, Bo, Haskell, William B., Zhao, Sixiang
Publication Year: 2018
Collection: Mathematics
Subject Terms: Mathematics - Optimization and Control
More Details: We developed a corporative stochastic approximation (CSA) type algorithm for semi-infinite programming (SIP), where the cut generation problem is solved inexactly. First, we provide general error bounds for inexact CSA. Then, we propose two specific random constraint sampling schemes to approximately solve the cut generation problem. When the objective and constraint functions are generally convex, we show that our randomized CSA algorithms achieve an $\mathcal{O}(1/\sqrt{N})$ rate of convergence in expectation (in terms of optimality gap as well as SIP constraint violation). When the objective and constraint functions are all strongly convex, this rate can be improved to $\mathcal{O}(1/N)$.
Document Type: Working Paper
Access URL: http://arxiv.org/abs/1812.09017
Accession Number: edsarx.1812.09017
Database: arXiv
More Details
Description not available.