2 papers
math.OC2025
A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
Wanqin Nie, Kai Tu, Minglu Ye +1
In this paper, we propose a double iteratively reweighted algorithm to solve nonconvex and nonsmooth optimization problems, where both the objectives and constraint functions are f…
math.OC2018
A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
Minglu Ye, Ting Kei Pong
We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set (MFS). In this method, we…