Mathematical Programming: Series A and B
USSR Computational Mathematics and Mathematical Physics
A numerical approach to optimization problems with variational inequality constraints
Mathematical Programming: Series A and B
Estimation of the optical constants and the thickness of thin films using unconstrained optimization
Journal of Computational Physics
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
SIAM Journal on Scientific Computing
Digital Image Processing: PIKS Inside
Digital Image Processing: PIKS Inside
Improvements of some projection methods for monotone nonlinear variational inequalities
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications
An Algorithm for Total Variation Minimization and Applications
Journal of Mathematical Imaging and Vision
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities
Computational Optimization and Applications
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Numerische Mathematik
Deblurring Images: Matrices, Spectra, and Filtering (Fundamentals of Algorithms 3) (Fundamentals of Algorithms)
A self-adaptive projection method with improved step-size for solving variational inequalities
Computers & Mathematics with Applications
Computational Intelligence and Neuroscience - Advances in Nonnegative Matrix and Tensor Factorization
An affine-scaling interior-point CBB method for box-constrained optimization
Mathematical Programming: Series A and B
Fast numerical algorithms for total variation based image restoration
Fast numerical algorithms for total variation based image restoration
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
SIAM Journal on Imaging Sciences
A new modified Goldstein-Levitin-Polyakprojection method for variational inequality problems
Computers & Mathematics with Applications
Some projection-like methods for the generalized Nash equilibria
Computational Optimization and Applications
Duality-based algorithms for total-variation-regularized image restoration
Computational Optimization and Applications
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Journal of Mathematical Imaging and Vision
A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
Journal of Computational and Applied Mathematics
Hi-index | 7.29 |
Since the appearance of the Barzilai-Borwein (BB) step sizes strategy for unconstrained optimization problems, it received more and more attention of the researchers. It was applied in various fields of the nonlinear optimization problems and recently was also extended to optimization problems with bound constraints. In this paper, we further extend the BB step sizes to more general variational inequality (VI) problems, i.e., we adopt them in projection methods. Under the condition that the underlying mapping of the VI problem is strongly monotone and Lipschitz continuous and the modulus of strong monotonicity and the Lipschitz constant satisfy some further conditions, we establish the global convergence of the projection methods with BB step sizes. A series of numerical examples are presented, which demonstrate that the proposed methods are convergent under mild conditions, and are more efficient than some classical projection-like methods.