๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A feasible descent algorithm for solving variational inequality problems

โœ Scribed by Deren Han; Hong K. Lo

Publisher
Springer
Year
2003
Tongue
English
Weight
262 KB
Volume
58
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

FEASIBLE DESCENT CONE METHODS FOR INEQUA
FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
โœ J. A. SNYMAN; N. STANDER ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region

New decomposition methods for solving va
New decomposition methods for solving variational inequality problems
โœ Deren Han; Wenyu Sun ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

For solving large-scale constrained separable variational inequality problems, the decomposition methods are attractive, since they solve the original problems via solving a series of small-scale problems, which may be much easier to solve than the original problems. In this paper, we propose some n