Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
DOI10.1007/S41980-019-00298-0zbMATH Open1447.90029OpenAlexW2982154129WikidataQ127025855 ScholiaQ127025855MaRDI QIDQ779740FDOQ779740
Zheng Peng, Bin-Qian Jiang, Kangkang Deng
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
Recommendations
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- A customized proximal point algorithm for convex minimization with linear constraints
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
convex optimizationglobal convergenceseparable convex optimization\(\mathcal{O}(1/k)\)-convergence ratecustomized proximal point algorithm
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Multiplier and gradient methods
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Proximité et dualité dans un espace hilbertien
- Title not available (Why is that?)
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- A customized proximal point algorithm for convex minimization with linear constraints
- 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 methods and nonconvex optimization
- A proximal point algorithm revisit on the alternating direction method of multipliers
- Partial inverse of a monotone operator
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Proximal-point algorithm using a linear proximal term
- New Proximal Point Algorithms for Convex Minimization
- Title not available (Why is that?)
- Analyse numérique du champ magnetique d'un alternateur par éléments finis et sur-relaxation ponctuelle non linéaire
- A Decomposition Method and Its Application to Convex Programming
- Solving a class of matrix minimization problems by linear variational inequality approaches
Cited In (1)
This page was built for publication: Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779740)
