A class of nonlinear proximal point algorithms for variational inequality problems
From MaRDI portal
Publication:5266138
DOI10.1080/00207160.2014.940333zbMath1317.65145OpenAlexW2087358836MaRDI QIDQ5266138
Deren Han, Hongjin He, Xing-Ju Cai
Publication date: 30 July 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.940333
variational inequality problemproximal point algorithmconvex minimization problemnonlinear proximal term
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
The developments of proximal point algorithms ⋮ An LQP-based two-step method for structured variational inequalities ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Solving a Class of Variational Inequality Problems with a New Inexact Strategy ⋮ A proximal point algorithm with asymmetric linear term ⋮ The indefinite proximal point algorithms for maximal monotone operators
Cites Work
- An inexact LQP alternating direction method for solving a class of structured variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities
- Proximal-point algorithm using a linear proximal term
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- A proximal-based deomposition method for compositions method for convex minimization problems
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Nonlinear proximal decomposition method for convex programming
- A new inexact alternating directions method for monotone variational inequalities
- A class of projection and contraction methods for monotone variational inequalities
- An self-adaptive LQP method for constrained variational inequalities
- On a unified implicit method for variational inequalities
- Multiplier and gradient methods
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- Projection methods for variational inequalities with application to the traffic assignment problem
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Convergence of Proximal-Like Algorithms
- Engineering and Economic Applications of Complementarity Problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A hybrid LQP-based method for structured variational inequalities
This page was built for publication: A class of nonlinear proximal point algorithms for variational inequality problems
