✦ LIBER ✦

A feasible directions method for computing Bayes E-optimal block designs

✍ Scribed by B. Simeone; I. Verdinelli

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 912 KB
Volume: 7
Category: Article
ISSN: 0167-9473
DOI: 10.1016/0167-9473(88)90013-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new first-order interior feasible dire

A new first-order interior feasible direction method for structural optimization

✍ Nielen Stander; J. A. Snyman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 888 KB

A computational method for optimal struc

A computational method for optimal structural design II: Continuous problems

✍ E. J. Haug Jr.; K. C. Pan; T. D. Streeter 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 836 KB

A computational method for optimal struc

A computational method for optimal structural design. I. Piecewise uniform structures

✍ E. J. Haug Jr.; K. C. Pan; T. D. Streeter 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 838 KB

A numerical method for multistep optimiz

A numerical method for multistep optimization problems with stepwise computation of search direction

✍ A.M. Valuyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 903 KB

Discontinuous deformation analysis-A new

Discontinuous deformation analysis-A new method for computing stress, strain and sliding of block systems

✍ Shi, Gen Hua (author);Goodman, Richard E. (author) 📂 Article 📅 1998 🏛 American Rock Mechanics Association (ARMA) 🌐 English ⚖ 112 KB 👁 3 views

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