Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Mathematical Programming: Series A and B
USSR Computational Mathematics and Mathematical Physics
A globally convergent Newton method for solving strongly monotone variational inequalities
Mathematical Programming: Series A and B
A new method for a class of linear variational inequalities
Mathematical Programming: Series A and B
Modified Projection-Type Methods for Monotone Variational Inequalities
SIAM Journal on Control and Optimization
A class of iterative methods for solving nonlinear projection equations
Journal of Optimization Theory and Applications
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
SIAM Journal on Control and Optimization
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
SIAM Journal on Optimization
Improvements of some projection methods for monotone nonlinear variational inequalities
Journal of Optimization Theory and Applications
An Improved Extra-Gradient Method for Minimizing a Sum of p-norms--A Variational Inequality Approach
Computational Optimization and Applications
Journal of Global Optimization
A two-stage prediction-correction method for solving monotone variational inequalities
Journal of Computational and Applied Mathematics
A generalized proximal-point-based prediction-correction method for variational inequality problems
Journal of Computational and Applied Mathematics
Modified extragradient methods for solving variational inequalities
Computers & Mathematics with Applications
Steplengths in the extragradient type methods
Journal of Computational and Applied Mathematics
Some Goldstein's type methods for co-coercive variant variational inequalities
Applied Numerical Mathematics
Computational Optimization and Applications
Some projection methods with the BB step sizes for variational inequalities
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
Computational Optimization and Applications
Hi-index | 0.00 |
Most existing interior-point methods for a linear complementarity problem (LCP) require the existence of a strictly feasible point to guarantee that the iterates are bounded. Based on a regularized central path, we present an infeasible interior-point ...