activity
20182026
most citedAn Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimization

2 citations · 6 across the 18 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

math.OC2025

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming

Lei Yang, Jiayi Zhu, Ling Liang +1

This article investigates the convergence properties of a relative-type inexact preconditioned proximal augmented Lagrangian method (ripALM) for convex nonlinear programming, a…

math.OC2025

Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound

Ling Liang, Shujun Bi

This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of e…