activity
20192026
most citedEstimation of sparse Gaussian graphical models with hidden clustering structure

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

collaborators
Showing math.OCShow all

10 papers · 1 filter

math.OC2026

A distributed semismooth Newton based augmented Lagrangian method for distributed optimization

Qihao Ma, Chengjing Wang, Peipei Tang +2

This paper proposes a novel distributed semismooth Newton based augmented Lagrangian method for solving a class of optimization problems over networks, where the global objective i…

math.OC2025

Complete Characterizations of Well-Posedness in Parametric Composite Optimization

Boris S. Mordukhovich, Peipei Tang, Chengjing Wang

This paper characterizes the well-posedness of Karush-Kuhn-Tucker system for perturbed composite optimization. Using the parabolic regularity, we introduce a novel second-order var…

math.OC2025

An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems

Chengjing Wang, Peipei Tang

In this paper, we study a class of convex composite optimization problems. We begin by characterizing the equivalence between the primal/dual strong second-order sufficient conditi…

math.OC2025

Second-Order Characterizations of Tilt Stability in Composite Optimization

Boris S. Mordukhovich, Peipei Tang, Chengjing Wang

Tilt stability is a fundamental concept of variational analysis and optimization that plays a pivotal role in both theoretical issues and numerical computations. This paper investi…

math.OC2025

Characterizations of Strong Variational Sufficiency in General Models of Composite Optimization

Boris S. Mordukhovich, Peipei Tang, Chengjing Wang

This paper investigates a recently introduced notion of strong variational sufficiency in optimization problems whose importance has been highly recognized in optimization theory,…

math.OC2022

An efficient algorithm for the norm based metric nearness problem

Peipei Tang, Bo Jiang, Chengjing Wang

Given a dissimilarity matrix, the metric nearness problem is to find the nearest matrix of distances that satisfy the triangle inequalities. This problem has wide applications, suc…