activity
20172026
most citedAn efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

54 citations · 81 across the 10 of their papers we have counts for

collaborators
Showing math.OCShow all

7 papers · 1 filter

math.OC2026

Exact low-dimensional reformulations for regularized spectral approximation

Shengxiang Deng, Xudong Li, Yangjing Zhang

We study exact low-dimensional reformulations for a regularized spectral approximation problem and its weighted variant. In the unweighted setting, weak-majorization monotonicity o…

math.OC2023

On some perturbation properties of nonsmooth optimization on Riemannian manifolds with applications

Yuexin Zhou, Chao Ding, Yangjing Zhang

This paper presents a perturbation analysis framework for nonsmooth optimization on connected Riemannian manifolds to bridge the gap between the rapid development of algorithmic ap…

math.OC2022★ 11 cited

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications

Shiwei Wang, Chao Ding, Yangjing Zhang +1

Strong variational sufficiency is a newly proposed property, which turns out to be of great use in the convergence analysis of multiplier methods. However, what this property impli…

math.OC2021★ 1 cited

On Regularized Square-root Regression Problems: Distributionally Robust Interpretation and Fast Computations

Hong T. M. Chu, Kim-Chuan Toh, Yangjing Zhang

Square-root (loss) regularized models have recently become popular in linear regression due to their nice statistical properties. Moreover, some of these models can be interpreted…

math.OC2019★ 8 cited

A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems

Yangjing Zhang, Ning Zhang, Defeng Sun +1

Undirected graphical models have been especially popular for learning the conditional independence structure among a large number of variables where the observations are drawn inde…

math.OC2019★ 2 cited

An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems

Ning Zhang, Yangjing Zhang, Defeng Sun +1

Nowadays, analysing data from different classes or over a temporal grid has attracted a great deal of interest. As a result, various multiple graphical models for learning a collec…

math.OC2017★ 54 cited

An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

Yangjing Zhang, Ning Zhang, Defeng Sun +1

The sparse group Lasso is a widely used statistical model which encourages the sparsity both on a group and within the group level. In this paper, we develop an efficient augmented…