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

The local convergence of the Byrd-Schnabel algorithm for constrained optimization

โœ Scribed by Thomas F. Coleman; Ai-Ping Liao

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
394 KB
Volume
6
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The LFOPC leap-frog algorithm for constr
The LFOPC leap-frog algorithm for constrained optimization
โœ J.A. Snyman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 619 KB

AbstractwThis paper describes an accurate and reliable new algorithm (LFOPC) for solving constrained optimization problems, through a three-phase application of the well-established leap-frog method for unconstrained optimization, to penalty function formulations of the original constrained problems

On the global stabilization of locally c
On the global stabilization of locally convergent algorithms
โœ E. Polak ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

It is possible to summarize the schemes, used in the past to stabilize algorithms, in the form of algorithm models. These models serve as patterns for subsequent applications. Summm'y--There are a number of algorithms in the literature which both theoretically and empirically are known to be only l