Proximal-point algorithm using a linear proximal term
From MaRDI portal
Publication:1028604
DOI10.1007/s10957-008-9493-0zbMath1170.49008OpenAlexW1970298676MaRDI QIDQ1028604
Publication date: 6 July 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9493-0
variational inequalitiesmonotone variational inequalitiesproximal point algorithmslinear proximal terms
Related Items
The projection and contraction methods for finding common solutions to variational inequality problems, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, The developments of proximal point algorithms, An approximate proximal point algorithm for maximal monotone inclusion problems, On the Convergence of Continuous and Discrete Unbalanced Optimal Transport Models for 1-Wasserstein Distance, An asymmetric proximal decomposition method for convex programming with linearly coupling constraints, A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, A general self-adaptive relaxed-PPA method for convex programming with linear constraints, A variable metric proximal-descent algorithm for monotone operators, A distributed Douglas-Rachford splitting method for multi-block convex minimization problems, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, A proximal point-like method for symmetric finite element model updating problems, A proximal point algorithm with asymmetric linear term, Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization, Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization, A hybrid splitting method for variational inequality problems with separable structure, A class of nonlinear proximal point algorithms for variational inequality problems, Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of the alternating direction method of multipliers to separable convex programming problems
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Inexact implicit methods for monotone general variational inequalities
- Monotone Operators and the Proximal Point Algorithm
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Convergence of Proximal-Like Algorithms
- Engineering and Economic Applications of Complementarity Problems
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
