9 citations · 24 across the 13 of their papers we have counts for
8 papers · 1 filter
Proximal bundle methods for hybrid weakly convex composite optimization problems
Jiaming Liang, Renato D. C. Monteiro, Honghao Zhang
This paper establishes the iteration-complexity of proximal bundle methods for solving hybrid (i.e., a blend of smooth and nonsmooth) weakly convex composite optimization (HWC-CO)…
A single cut proximal bundle method for stochastic convex composite optimization
Jiaming Liang, Vincent Guigues, Renato D. C. Monteiro
This paper considers optimization problems where the objective is the sum of a function given by an expectation and a closed convex composite function, and proposes stochastic comp…
A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
Jiaming Liang, Renato D. C. Monteiro
This paper presents a proximal bundle (PB) framework based on a generic bundle update scheme for solving the hybrid convex composite optimization (HCCO) problem and establishes a c…
Average Curvature FISTA for Nonconvex Smooth Composite Optimization Problems
Jiaming Liang, Renato D. C. Monteiro
A previous authors' paper introduces an accelerated composite gradient (ACG) variant, namely AC-ACG, for solving nonconvex smooth composite optimization (N-SCO) problems. In contra…
A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
Jiaming Liang, Renato D. C. Monteiro
This paper presents a proximal bundle variant, namely, the relaxed proximal bundle (RPB) method, for solving convex nonsmooth composite optimization problems. Like other proximal b…
An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems
Jiaming Liang, Renato D. C. Monteiro
This paper presents an accelerated composite gradient (ACG) variant, referred to as the AC-ACG method, for solving nonconvex smooth composite minimization problems. As opposed to w…
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
Jiaming Liang, Renato D. C. Monteiro, Chee-Khian Sim
In this paper, we describe and establish iteration-complexity of two accelerated composite gradient (ACG) variants to solve a smooth nonconvex composite optimization problem whose…
A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems
Jiaming Liang, Renato D. C. Monteiro
This paper describes and establishes the iteration-complexity of a doubly accelerated inexact proximal point (D-AIPP) method for solving the nonconvex composite minimization proble…