Showing math.OCShow all
2 papers · 1 filter
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.OC2024
A Max-Min-Max Algorithm for Large-Scale Robust Optimization
Kai Tu, Zhi Chen, Man-Chung Yue
Robust optimization (RO) is a powerful paradigm for decision making under uncertainty. Existing algorithms for solving RO, including the reformulation approach and the cutting-plan…