✦ LIBER ✦

A decomposition algorithm for unconstrained optimization problems with partial derivative information

✍ Scribed by G. Liuzzi; A. Risi

Book ID: 113085759
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 301 KB
Volume: 6
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-010-0270-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A derivative-free algorithm for unconstr

A derivative-free algorithm for unconstrained optimization

✍ Peng Yehui; Liu Zhenhai 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 314 KB

A polynomial-time recursive algorithm fo

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems

✍ Walid Ben-Ameur; José Neto 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Optimal semi-online algorithms for preem

Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information

✍ Yiwei Jiang; Yong He 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

A decomposition algorithm for nonlinear

A decomposition algorithm for nonlinear inseparable hierarchical optimization problems

✍ G. Feng 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 472 KB

A class of nonmonotone trust region algo

A class of nonmonotone trust region algorithms for unconstrained optimization problems

✍ Xiaowu Ke; Jiye Han 📂 Article 📅 1998 🏛 SP Science China Press 🌐 English ⚖ 348 KB

A domain decomposition method for optimi

A domain decomposition method for optimization problems for partial differential equations

✍ M.D. Gunzburger; Jeehyun Lee 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 786 KB

A nonoverlapping domain decomposition method for optimization problems for partial differential equations is presented. The domain decomposition is effected through an auxiliary optimization problem. This results in an multiobjective optimization problem involving the given functional and the auxili