activity
20232026
collaborators
Showing 2025 · math.OCShow all

5 papers · 2 filters

math.OC2025

The Augmented Lagrangian Methods: Overview and Recent Advances

Kangkang Deng, Rui Wang, Zhenyuan Zhu +2

Large-scale constrained optimization is pivotal in modern scientific, engineering, and industrial computation, often involving complex systems with numerous variables and constrain…

math.OC2025

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem

Zhanwang Deng, Tao Wei, Jirui Ma +1

In this paper, we propose a uniform semismooth Newton-based algorithmic framework called SSNCVX for solving a broad class of convex composite optimization problems. By exploiting t…

math.OC2025

Riemannian EXTRA: Communication-efficient decentralized optimization over compact submanifolds with data heterogeneity

Jiayuan Wu, Zhanwang Deng, Jiang Hu +2

We consider decentralized optimization over a compact Riemannian submanifold in a network of agents, where each agent holds a smooth, nonconvex local objective defined by its p…

math.OC2025

LMask: Learn to Solve Constrained Routing Problems with Lazy Masking

Tianyou Li, Haijun Zou, Jiayuan Wu +1

Routing problems are canonical combinatorial optimization tasks with wide-ranging applications in logistics, transportation, and supply chain management. However, solving these pro…

math.OC2025

An efficient primal dual semismooth Newton method for semidefinite programming

Zhanwang Deng, Jiang Hu, Kangkang Deng +1

In this paper, we present an efficient semismooth Newton method, named SSNCP, for solving a class of semidefinite programming problems. Our approach is rooted in an equivalent semi…