A generalized proximal-point-based prediction-correction method for variational inequality problems
From MaRDI portal
Publication:950089
DOI10.1016/j.cam.2007.10.063zbMath1185.65111OpenAlexW1990427786MaRDI QIDQ950089
Publication date: 22 October 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.10.063
global convergencenumerical resultsvariational inequalitygeneralized proximal point algorithmsprediction-correction methods
Variational inequalities (49J40) Discrete approximations in optimal control (49M25) Numerical methods for variational inequalities and related problems (65K15)
Related Items (6)
Iterative Methods for the Elastography Inverse Problem of Locating Tumors ⋮ Unnamed Item ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ A proximal point algorithm with asymmetric linear term ⋮ A new implementable prediction-correction method for monotone variational inequalities with separable structure ⋮ Proximal Methods for the Elastography Inverse Problem of Tumor Identification Using an Equation Error Approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
- A note on a globally convergent Newton method for solving monotone variational inequalities
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- Enlargement of monotone operators with applications to variational inequalities
- On some properties of generalized proximal point methods for variational inequalities
- A new hybrid generalized proximal point algorithm for variational inequality problems
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Smooth methods of multipliers for complementarity problems
- Some properties of generalized proximal point methods for quadratic and linear programming
- A globally convergent Newton method for solving strongly monotone variational inequalities
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- Engineering and Economic Applications of Complementarity Problems
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- A new accuracy criterion for approximate proximal point algorithms
- Network economics. A variational inequality approach.
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
This page was built for publication: A generalized proximal-point-based prediction-correction method for variational inequality problems
