𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homotopy method for solving variational inequalities with bounded box constraints

✍ Scribed by Xiaona Fan; Bo Yu


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
183 KB
Volume
68
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, using the Gabriel-MorΓ© smoothing function of the median function, a smooth homotopy method for solving nonsmooth equation reformulation of bounded box constrained variational inequality problem VIP(l, u, F) is given. Without any monotonicity condition on the defining map F, for starting point chosen almost everywhere in R n , existence and convergence of the homotopy pathway are proven. Nevertheless, it is also proven that, if the starting point is chosen to be an interior point of the box, the proposed homotopy method can also serve as an interior point method.


πŸ“œ SIMILAR VOLUMES


Two-level Schwarz method for solving var
✍ Chen-liang Li; Jin-ping Zeng πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 157 KB

In this paper, we extend the two-level Schwarz method to solve the variational inequality problems with nonlinear source terms, and establish a convergence theorem. The method converges within finite steps with an appropriate initial point. The numerical results show that the methods are efficient.

Variations on a cutting plane method for
✍ A. Victor Cabot πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th

A hybrid entropic proximal decomposition
✍ Deren Han πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 300 KB

In this paper, we propose a hybrid nonlinear decomposition-projection method for solving a class of monotone variational inequality problems. The algorithm utilizes the problems' structure conductive to decomposition and a projection step to get the next iterate. To make the method more practical, w