𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower and upper bounds version of a variational inequality

✍ Scribed by Jinlu Li

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
250 KB
Volume
13
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The variational upper and lower bounds f
The variational upper and lower bounds for stopping powers of atoms and molecules
✍ M.S. Yuriev πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 183 KB

A variational procedure for calculating upper and lower bounds for the logarithm of the average energy cf excitation InZ in the theory of the stopping power of :Itoms and molecules is described. The upper and lower bounds for lnlof the hydrogen atom are calculated. '?he author is' greatly indebted

A new version of extragradient method fo
A new version of extragradient method for variational inequality problems
✍ Yiju Wang; Naihua Xiu; Changyu Wang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 716 KB

In this paper, we propose a new version of extragradient method for the variational inequality problem. The method uses a new searching direction which differs from any one in existing projection-type methods, and is of a better stepsize rule. Under a certain generalized monotonicity condition, it i

Average Costs of a Graph Exploration: Up
Average Costs of a Graph Exploration: Upper and Lower Bounds
✍ Nicola Galli πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 168 KB

We consider the exploration of random digraphs. We give upper and lower bounds for the expected number of edges traversed during an exploration. This result implies a lower bound for the expected running time of a wide class of algorithms, e.g., breadth-first-search, depth-first-search, and algorith