activity
20092023
most citedA General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems

289 citations · 518 across the 37 of their papers we have counts for

collaborators

38 papers

math.OC2023★ 1 cited

A Parameter-Free Conditional Gradient Method for Composite Minimization under Hölder Condition

Masaru Ito, Zhaosong Lu, Chuan He

In this paper we consider a composite optimization problem that minimizes the sum of a weakly smooth function and a convex function with either a bounded domain or a uniformly conv…

math.OC2023★ 1 cited

Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization

Ziyi Chen, Yi Zhou, Yingbin Liang +1

Various optimal gradient-based algorithms have been developed for smooth nonconvex optimization. However, many nonconvex machine learning problems do not belong to the class of smo…

math.OC2023

A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees

Chuan He, Zhaosong Lu, Ting Kei Pong

In this paper we consider finding a second-order stationary point (SOSP) of nonconvex equality constrained optimization when a nearly feasible point is known. In particular, we fir…

math.OC2023

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization

Chuan He, Heng Huang, Zhaosong Lu

In this paper we consider finding an approximate second-order stationary point (SOSP) of general nonconvex conic optimization that minimizes a twice differentiable function subject…

math.OC2023

A first-order augmented Lagrangian method for constrained minimax optimization

Zhaosong Lu, Sanyou Mei

In this paper we study a class of constrained minimax problems. In particular, we propose a first-order augmented Lagrangian method for solving them, whose subproblems turn out to…

math.OC2023★ 1 cited

First-order penalty methods for bilevel optimization

Zhaosong Lu, Sanyou Mei

In this paper we study a class of unconstrained and constrained bilevel optimization problems in which the lower level is a possibly nonsmooth convex optimization problem, while th…