✦ LIBER ✦

A feasible conjugate-direction method to solve linearly constrained minimization problems

✍ Scribed by M. J. Best

Publisher: Springer
Year: 1975
Tongue: English
Weight: 556 KB
Volume: 16
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00935621

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A feasible descent cone method for linea

A feasible descent cone method for linearly constrained minimization problems

✍ E. de Klerk; J.A. Snyman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 955 KB

Decomposition branch and bound method fo

Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

✍ Thai Quynh Phong; Le Thi Hoai An; Pham Dinh Tao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A method of feasible directions using fu

A method of feasible directions using function approximations, with applications to min max problems

✍ R Klessig; E Polak 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 926 KB

A gradient-only line search method for t

A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function

✍ J. A. Snyman 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t

A technique which combines modified patt

A technique which combines modified pattern search methods with composite designs and polynomial constraints to solve constrained optimization problems

✍ B. F. Houston; R. A. Huffman 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB