PPA-like contraction methods for convex optimization: a framework using variational inequality approach
From MaRDI portal
Publication:259109
DOI10.1007/s40305-015-0108-9zbMath1332.65084OpenAlexW2277300184MaRDI QIDQ259109
Publication date: 11 March 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0108-9
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (17)
A primal-dual algorithm framework for convex saddle-point optimization ⋮ On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective ⋮ 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 ⋮ An LQP-based two-step method for structured variational inequalities ⋮ Alternating direction method of multipliers for nonconvex log total variation image restoration ⋮ ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces ⋮ A Distributed Regularized Jacobi-Type ADMM-Method for Generalized Nash Equilibrium Problems in Hilbert Spaces ⋮ A primal-dual multiplier method for total variation image restoration ⋮ A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ A proximal augmented method for semidefinite programming problems ⋮ Optimally linearizing the alternating direction method of multipliers for convex programming ⋮ On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming ⋮ Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization ⋮ Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- Gradient methods for minimizing composite functions
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- A first-order primal-dual algorithm for convex problems with applications to imaging
- 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
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- Monotone Operators and the Proximal Point Algorithm
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
This page was built for publication: PPA-like contraction methods for convex optimization: a framework using variational inequality approach
