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

A gradient projection method on an embedding of the feasible set

โœ Scribed by I. Ya. Zabotin

Publisher
Springer US
Year
1988
Tongue
English
Weight
377 KB
Volume
41
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Embedding the complement of a minimal bl
Embedding the complement of a minimal blocking set in a projective plane
โœ Lynn Margaret Batten ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any

A generalized super-memory gradient proj
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
โœ Jin-Bao Jian; You-Fang Zeng; Chun-Ming Tang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 362 KB

In this work, combining the properties of the generalized super-memory gradient projection methods with the ideas of the strongly sub-feasible directions methods, we present a new algorithm with strong convergence for nonlinear inequality constrained optimization. At each iteration, the proposed alg