Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
From MaRDI portal
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
Cites work
- A customized proximal point algorithm for convex minimization with linear constraints
- A Decomposition Method and Its Application to Convex Programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A Singular Value Thresholding Algorithm for Matrix Completion
- Analyse numérique du champ magnetique d'un alternateur par éléments finis et sur-relaxation ponctuelle non linéaire
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- scientific article; zbMATH DE number 4060177 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- New Proximal Point Algorithms for Convex Minimization
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Partial inverse of a monotone operator
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Proximal point methods and nonconvex optimization
- Proximal-point algorithm using a linear proximal term
- Proximité et dualité dans un espace hilbertien
- Solving a class of matrix minimization problems by linear variational inequality approaches
Cited in
(7)- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- A customized proximal point algorithm for convex minimization with linear constraints
- A generalized multi-parameterized proximal point algorithm for linearly constrained convex optimization problem
- A class of customized proximal point algorithms for linearly constrained convex optimization
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
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)
