Mathematical Programming: Series A and B
USSR Computational Mathematics and Mathematical Physics
On the convergence of the proximal point algorithm for convex minimization
SIAM Journal on Control and Optimization
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Approximate iterations in Bregman-function-based proximal algorithms
Mathematical Programming: Series A and B
A Logarithmic-Quadratic Proximal Method for Variational Inequalities
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
Mathematics of Operations Research
Convergence of Proximal-Like Algorithms
SIAM Journal on Optimization
The interior proximal extragradient method for solving equilibrium problems
Journal of Global Optimization
Hi-index | 7.29 |
In this paper, we suggest and analyze a new modified proximal-point method for solving nonlinear complementarity problems. Under suitable conditions, we prove that the new method is globally convergent. We report some preliminary computational results to illustrate the efficiency of the proposed method.