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

Globally and superlinearly convergent algorithms for the solution of box-constrained optimization

โœ Scribed by Yu-Fei Yang


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
898 KB
Volume
45
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A superlinearly convergent constrained m
โœ B. Rustem ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 729 KB

In the presence of rival models of the same economic system, an optimal policy can be computed that takes account of the existence of all the models. A min-max, worst-case design, problem is formulated and subsequently restated as an alternative min-max problem. A numerical example of this approach

Effect of the subdivision strategy on co
โœ Hoang Tuy ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer US ๐ŸŒ English โš– 874 KB

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exh

Global existence and convergence rates o
โœ Qing Chen; Zhong Tan ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 398 KB

In this paper, we are concerned with the global existence and convergence rates of the smooth solutions for the compressible magnetohydrodynamic equations in R 3 . We prove the global existence of the smooth solutions by the standard energy method under the condition that the initial data are close

MAPLE code for the gamma algorithm for g
โœ M. Delgado Pineda; E.A. Galperin ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

a b s t r a c t Problems with uncertainties are ubiquitous in many areas of life and the economy. Due to a lack of information as regards the economy and in finance, problems with uncertainties (stock prices, marketing problems, inflation, unemployment) are usually formulated by giving bounds on max