Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization

Abstract

This paper proposes a constrained stochastic successive convex approximation (CSSCA) algorithm to find a stationary point for a general non-convex stochastic optimization problem, whose objective and constraint functions are non-convex and involve expectations over random states. Most existing methods for non-convex stochastic optimization, such as the stochastic (average) gradient and stochastic majorization-minimization, only consider minimizing a stochastic non-convex objective over a deterministic convex set. The proposed CSSCA algorithm can also handle stochastic non-convex constraints in optimization problems, and it opens the way to solving more challenging optimization problems that occur in many applications. The algorithm is based on solving a sequence of convex objective/feasibility optimization problems obtained by replacing the objective/constraint functions in the original problems with some convex surrogate functions. The CSSCA algorithm allows a wide class of surrogate functions and thus provides many freedoms to design good surrogate functions for specific applications. Moreover, it also facilitates parallel implementation for solving large scale stochastic optimization problems, which arise naturally in today's signal processing such as machine learning and big data analysis. We establish the convergence of CSSCA algorithm with a feasible initial point, and customize the algorithmic framework to solve several important application problems. Simulations show that the CSSCA algorithm can achieve superior performance over existing solutions.

submitted to IEEE Transactions on Signal Processing, under minor revision

References in corpus (1)

• SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

Cited by in corpus (18)

• Learning Decentralized Wireless Resource Allocations with Graph Neural Networks
• Two-timescale Beamforming Optimization for Intelligent Reflecting Surface Aided Multiuser Communication with QoS Constraints
• Outage-Constrained Robust Beamforming for Intelligent Reflecting Surface Aided Wireless Communication
• Successive Convex Approximation Based Off-Policy Optimization for Constrained Reinforcement Learning
• Two-Stage Stochastic Optimization via Primal-Dual Decomposition and Deep Unrolling
• Sample-based and Feature-based Federated Learning for Unconstrained and Constrained Nonconvex Optimization via Mini-batch SSCA
• Spectrum Sharing Among Multiple-Seller and Multiple-Buyer Operators of A Mobile Network: A Stochastic Geometry Approach
• Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I
• Escaping Saddle Points with the Successive Convex Approximation Algorithm
• Intelligent Reflecting Surface Aided MISO Uplink Communication Network: Feasibility and Power Minimization for Perfect and Imperfect CSI
• Content-Aware User Association and Multi-User MIMO Beamforming over Mobile Edge Caching
• Sample-based Federated Learning via Mini-batch SSCA
• 3D Placement for Multi-UAV Relaying: An Iterative Gibbs-Sampling and Block Coordinate Descent Optimization Approach
• Practical Precoding via Asynchronous Stochastic Successive Convex Approximation
• Two-Timescale Optimization for Intelligent Reflecting Surface Aided D2D Underlay Communication
• Latency Minimization in Intelligent Reflecting Surface Assisted D2D Offloading Systems
• Stochastic Successive Convex Approximation for General Stochastic Optimization Problems
• MIMO-Aided Nonlinear Hybrid Transceiver Design for Multiuser mmWave Systems Relying on Tomlinson-Harashima Precoding