✦ LIBER ✦

Algorithms for optimization problems with exclusion constraints

✍ Scribed by D. Q. Mayne; E. Polak

Publisher: Springer
Year: 1986
Tongue: English
Weight: 788 KB
Volume: 51
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00940285

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Feasible directions algorithms for optim

Feasible directions algorithms for optimization problems with equality and inequality constraints

✍ D. Q. Mayne; E. Polak 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 704 KB

Algorithm developments for optimization

Algorithm developments for optimization problems with joint reliability constraints

✍ Kuei-Yuan Chan; Dong-Shin Lin 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

An algorithm for solving global optimiza

An algorithm for solving global optimization problems with nonlinear constraints

✍ Yaroslav D. Sergeyev; Dmitri L. Markin 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 573 KB

A supermemory gradient projection algori

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

✍ Ziyou Gao; Guoping He 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 429 KB

Convex optimization problems with constr

Convex optimization problems with constraints

✍ E. A. Nurminskii 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 375 KB

On the Complexity of Exclusion Algorithm

On the Complexity of Exclusion Algorithms for Optimization

✍ Eugene Allgower; Melissa Erdmann; Kurt Georg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa