Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
From MaRDI portal
Publication:779740
DOI10.1007/s41980-019-00298-0zbMath1447.90029OpenAlexW2982154129WikidataQ127025855 ScholiaQ127025855MaRDI QIDQ779740
Zheng Peng, Kangkang Deng, Bin-Qian Jiang
Publication date: 14 July 2020
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-019-00298-0
global convergenceconvex optimizationseparable convex optimization\(\mathcal{O}(1/k)\)-convergence ratecustomized proximal point algorithm
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Partial inverse of a monotone operator
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Proximal-point algorithm using a linear proximal term
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Proximal point methods and nonconvex optimization
- Analyse numérique du champ magnetique d'un alternateur par éléments finis et sur-relaxation ponctuelle non linéaire
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Solving a class of matrix minimization problems by linear variational inequality approaches
- A proximal point algorithm revisit on the alternating direction method of multipliers
- Multiplier and gradient methods
- A customized proximal point algorithm for convex minimization with linear constraints
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Decomposition Method and Its Application to Convex Programming
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Proximité et dualité dans un espace hilbertien
