An Incremental Path-Following Splitting Method for Linearly Constrained Nonconvex Nonsmooth Programs

2018/01/30 by Linbo Qiao, Wei Liu, Qiao, Linbo +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Optimization and Control (math.OC) #Optimization and Search Problems #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1801.10119

openalex publication_date 2018/01/30 · openalex created_date 2018/02/23 · openalex updated_date 2026/07/28

Abstract

The stationary point of Problem 2 is NOT the stationary point of Problem 1. We are sorry and we are working on fixing this error.

Citations

• Splitting Algorithms for the Sum of Two Nonlinear Operators
• A Fast Learning Algorithm for Deep Belief Nets
• Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs
• A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems

Related

• A full splitting algorithm for structured difference-of-convex programs
• A four-operator splitting algorithm for nonconvex and nonsmooth optimization
• Nonconvex proximal splitting: batch and incremental algorithms
• A Method for Solving Nonsmooth Pseudoconvex Optimization
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing\n Stepsizes and Iteration Complexity