Sep 16, 2022 · We propose an indefinite proximal subgradient-based algorithm (IPSB) for solving nonsmooth composite optimization problems.

We propose an indefinite proximal subgradient-based algorithm (IPSB) for solving nonsmooth composite optimization problems. IPSB is a generalization of the ...

This paper investigates the possibility of relaxing the positive definiteness requirement of the proximal measure in PPA and proposes an indefinite PPA for ...

Sep 16, 2022 · We propose an indefinite proximal subgradient-based algorithm (IPSB) for solving nonsmooth composite optimization problems.

Sep 16, 2022 · Abstract. We propose an indefinite proximal subgradient-based algorithm (IPSB) for solving nons- mooth composite optimization problems.

An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization ; Journal: Journal of Global Optimization, 2022, № 2-4, p. 533-550.

We propose an indefinite proximal subgradient-based algorithm (IPSB) for solving nonsmooth composite optimization problems. IPSB is a generalization of the ...

This paper presents a majorized alternating direction method of multipliers (ADMM) with indefinite proximal terms for solving linearly constrained 2-block ...

Author's Latest Publications. research-article. An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization · Author Picture Rui Liu.

Improving on the subgradient method. In words, we cannot do better than the O(1/ 2) rate of subgradient method for Lipschitz, convex functions.