✦ LIBER ✦

Pattern Search Methods for Linearly Constrained Minimization

✍ Scribed by Lewis, Robert Michael; Torczon, Virginia

Book ID: 118204386
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 252 KB
Volume: 10
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623497331373

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pattern Search Algorithms for Bound Cons

Pattern Search Algorithms for Bound Constrained Minimization

✍ Lewis, Robert Michael; Torczon, Virginia 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 352 KB

Evolutionary pattern search algorithms f

Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization

✍ Hart, W.E. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 223 KB

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

A method of linearizations for linearly

A method of linearizations for linearly constrained nonconvex nonsmooth minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 562 KB

An algorithm for linearly constrained no

An algorithm for linearly constrained nonsmooth convex multiobjective minimization

✍ Krzysztof C Kiwiel 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 206 KB

An algebra-based approach for linearly c

An algebra-based approach for linearly constrained concave minimization

✍ Quanling Wei; Hong Yan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 534 KB

This paper proposes an algebra approach for solving the linearly constrained continuous quasi-concave minimization problems. The study involves a class of very generalized concave functions, continuous strictly quasi-concave functions. Based on the fact that the optimal solutions can be achieved at