supported by the National Natural Science Foundations of China(Grant Nos.12061045,12031003);by the Guangzhou Education Scientific Research Project 2024(Grant No.202315829);by the Guangzhou University Research Projects(Grant No.RC2023061);by the Jiangxi Provincial Natural Science Foundation(Grant No.20224ACB211004).
Image restoration based on total variation has been widely studied owing to its edgepreservation properties.In this study,we consider the total variation infimal convolution(TV-IC)image restoration model for eliminati...
supported by the National Natural Science Foundation of China(Grant No.11971092);supported by the Fundamental Research Funds for the Central Universities(Grant No.DUT20RC(3)079)。
Optimization problem of cardinality constrained mean-variance(CCMV)model for sparse portfolio selection is considered.To overcome the difficulties caused by cardinality constraint,an exact penalty approach is employed...
supported by the Natural Science Foundation of Jiangsu Province (Grant No.BK20210267);supported by the National Natural Science Foundation of China (Grant No.11971239);the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province (Grant No.21KJA110002);supported by the National Natural Science Foundation of China (Grant Nos.12131004,11625105).
The Peaceman-Rachford splitting method is efficient for minimizing a convex optimization problem with a separable objective function and linear constraints.However,its convergence was not guaranteed without extra requ...
In this paper,we present the proximal-proximal-gradient method(PPG),a novel optimization method that is simple to implement and simple to parallelize.PPG generalizes the proximal-gradient method and ADMM and is applic...
In this paper, we study the restoration of images simultaneously corrupted by blur and impulse noise via variational approach with a box constraint on the pixel values of an image. In the literature, the TV-l^1 variat...
In this paper we prove the convergence of the approximate proximal method for DC functions proposed by Sun et al [6]. Our analysis also permits to treat the exact method. We then propose an interesting result in the c...
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system ...