Proximal-point algorithm using a linear proximal term
From MaRDI portal
Publication:1028604
DOI10.1007/S10957-008-9493-0zbMATH Open1170.49008OpenAlexW1970298676MaRDI QIDQ1028604FDOQ1028604
Authors: J. Blot 
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
Recommendations
- Implementing proximal point methods for linear programming
- On the proximal point algorithm
- A proximal point algorithm with asymmetric linear term
- Interior proximal point algorithm for linear programs
- An abstract proximal point algorithm
- Publication:3035147
- A Generalization of the Proximal Point Algorithm
- Relatively inexact proximal point algorithm and linear convergence analysis
- The proximal point algorithm revisited
- Proximal Decomposition Via Alternating Linearization
variational inequalitiesproximal point algorithmsmonotone variational inequalitieslinear proximal terms
Cites Work
- Application of the alternating direction method of multipliers to separable convex programming problems
- Monotone Operators and the Proximal Point Algorithm
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Title not available (Why is that?)
- Convergence of Proximal-Like Algorithms
- Engineering and Economic Applications of Complementarity Problems
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- 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
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Title not available (Why is that?)
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Title not available (Why is that?)
Cited In (23)
- Some proximal algorithms for linearly constrained general variational inequalities
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- An approximate proximal point algorithm for maximal monotone inclusion problems
- The PPA-based numerical algorithm with the \(O(1/t)\) convergence rate for variant variational inequalities
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- The projection and contraction methods for finding common solutions to variational inequality problems
- A hybrid splitting method for variational inequality problems with separable structure
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- A proximal point-like method for symmetric finite element model updating problems
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- A variable metric proximal-descent algorithm for monotone operators
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- A proximal point algorithm with asymmetric linear term
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- On the Convergence of Continuous and Discrete Unbalanced Optimal Transport Models for 1-Wasserstein Distance
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- A class of nonlinear proximal point algorithms for variational inequality problems
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- The developments of proximal point algorithms
- A general inertial proximal point algorithm for mixed variational inequality problem
This page was built for publication: Proximal-point algorithm using a linear proximal term
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028604)
