PPA-like contraction methods for convex optimization: a framework using variational inequality approach
From MaRDI portal
(Redirected from Publication:259109)
Recommendations
- scientific article; zbMATH DE number 6270284
- A uniform framework of contraction methods for convex optimization and monotone variational inequality
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Proximal-point algorithm using a linear proximal term
Cites work
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A customized proximal point algorithm for convex minimization with linear constraints
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Computing the nearest correlation matrix--a problem from finance
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Gradient methods for minimizing composite functions
- Matrix completion via an alternating direction method
- Monotone Operators and the Proximal Point Algorithm
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence of primal-dual hybrid gradient algorithm
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
Cited in
(21)- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- A primal-dual multiplier method for total variation image restoration
- Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints
- A distributed regularized Jacobi-type ADMM-method for generalized Nash equilibrium problems in Hilbert spaces
- Alternating direction method of multipliers for nonconvex log total variation image restoration
- A class of customized proximal point algorithms for linearly constrained convex optimization
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints
- A modified Chambolle-Pock primal-dual algorithm for Poisson noise removal
- A proximal augmented method for semidefinite programming problems
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- A primal-dual algorithm framework for convex saddle-point optimization
- An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
- ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces
- On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming
- A uniform framework of contraction methods for convex optimization and monotone variational inequality
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- An LQP-based two-step method for structured variational inequalities
This page was built for publication: PPA-like contraction methods for convex optimization: a framework using variational inequality approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259109)
