A class of customized proximal point algorithms for linearly constrained convex optimization
- High-Tech Institute of Xi’an (China)
- PLA University of Science and Technology, College of Communications Engineering (China)
In this paper, we propose a class of customized proximal point algorithms for linearly constrained convex optimization problems. The algorithms are implementable, provided that the proximal operator of the objective function is easy to evaluate. We show that, with special setting of the algorithmic scalar, our algorithms contain the customized proximal point algorithm (He et al., Optim Appl 56:559–572, 2013), the linearized augmented Lagrangian method (Yang and Yuan, Math Comput 82:301–329, 2013), the Bregman Operator Splitting algorithm (Zhang et al., SIAM J Imaging Sci 3:253–276, 2010) as special cases. The global convergence and worst-case convergence rate measured by the iteration complexity are established for the proposed algorithms. Numerical results demonstrate that the algorithms work well for a wide range of the scalar.
- OSTI ID:
- 22769365
- Journal Information:
- Computational and Applied Mathematics, Vol. 37, Issue 2; Other Information: Copyright (c) 2018 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional; Country of input: International Atomic Energy Agency (IAEA); ISSN 0101-8205
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals
Use of ARM observations and numerical models to determine radiative and latent heating profiles of mesoscale convective systems for general circulation models