
Firstorder methods for problems with O(1) functional constraints can have almost the same convergence rate as for unconstrained problems
Firstorder methods (FOMs) have recently been applied and analyzed for s...
read it

Momentumbased variancereduced proximal stochastic gradient method for composite nonconvex stochastic optimization
Stochastic gradient methods (SGMs) have been extensively used for solvin...
read it

Augmented Lagrangian based firstorder methods for convex and nonconvex programs: nonergodic convergence and iteration complexity
Firstorder methods (FOMs) have been widely used for largescale problem...
read it

Asynchronous parallel adaptive stochastic gradient methods
Stochastic gradient methods (SGMs) are the predominant approaches to tra...
read it

Katyusha Acceleration for Convex FiniteSum Compositional Optimization
Structured problems arise in many applications. To solve these problems,...
read it

Inexact ProximalPoint Penalty Methods for NonConvex Optimization with NonConvex Constraints
Nonconvex optimization problems arise from various areas in science and...
read it

Markov Chain Block Coordinate Descent
The method of block coordinate gradient descent (BCD) has been a powerfu...
read it

A Block Coordinate Ascent Algorithm for MeanVariance Optimization
Risk management in dynamic decision problems is a primary concern in man...
read it

Ensemble Onedimensional Convolution Neural Networks for Skeletonbased Action Recognition
In this paper, we proposed a effective but extensible residual onedimen...
read it

Firstorder methods for constrained convex programming based on linearized augmented Lagrangian function
Firstorder methods have been popularly used for solving largescale pro...
read it

Global convergence rates of augmented Lagrangian methods for constrained convex programming
Augmented Lagrangian method (ALM) has been popularly used for solving co...
read it

Asynchronous parallel primaldual block update methods
Recent several years have witnessed the surge of asynchronous (async) p...
read it

Accelerated PrimalDual Proximal Block Coordinate Updating Methods for Constrained Convex Optimization
Block Coordinate Update (BCU) methods enjoy low perupdate computational...
read it

A Primer on Coordinate Descent Algorithms
This monograph presents a class of algorithms called coordinate descent ...
read it

Hybrid Jacobian and GaussSeidel proximal block coordinate update methods for linearly constrained convex programming
Recent years have witnessed the rapid development of block coordinate up...
read it

Accelerated firstorder primaldual proximal methods for linearly constrained composite convex programming
Motivated by big data applications, firstorder methods have been extrem...
read it

Randomized PrimalDual Proximal Block Coordinate Updates
In this paper we propose a randomized primaldual proximal block coordin...
read it

Coordinate Friendly Structures, Algorithms and Applications
This paper focuses on coordinate update methods, which are useful for so...
read it

Proximal gradient method for huberized support vector machine
The Support Vector Machine (SVM) has been used in a wide variety of clas...
read it

Alternating direction method of multipliers for regularized multiclass support vector machines
The support vector machine (SVM) was originally designed for binary clas...
read it

ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates
Finding a fixed point to a nonexpansive operator, i.e., x^*=Tx^*, abstra...
read it

A fast patchdictionary method for whole image recovery
Various algorithms have been proposed for dictionary learning. Among tho...
read it