✦ LIBER ✦

A dynamical model for solving degenerate quadratic minimax problems with constraints

✍ Scribed by A.R. Nazemi

Book ID: 113511743
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 568 KB
Volume: 236
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.08.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A project neural network for solving deg

A project neural network for solving degenerate quadratic minimax problem with linear constraints

✍ Xiaoping Xue; Wei Bian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A generalized neural network for solving

A generalized neural network for solving a class of minimax optimization problems with linear constraints

✍ Yongqing Yang; Jinde Cao; Xianyun Xu; Jiao Liu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 865 KB

Quadratic rate of convergence of a linea

Quadratic rate of convergence of a linearization method for solving discrete minimax problems

✍ V.A. Daugavet; V.N. Malozemov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 537 KB

A mixed-integer model for solving orderi

A mixed-integer model for solving ordering problems with side constraints

✍ Francesco Maffioli; Anna Sciomachen 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 181 KB

Support method for solving a linear-quad

Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control

✍ Bibi, M.O. 📂 Article 📅 1996 🏛 Taylor and Francis Group 🌐 English ⚖ 326 KB

Algorithms for solving dynamic models wi

Algorithms for solving dynamic models with occasionally binding constraints

✍ Lawrence J. Christiano; Jonas D.M. Fisher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 669 KB

We describe and compare several algorithms for approximating the solution to a model in which inequality constraints occasionally bind. Their performance is evaluated and compared using various parameterizations of the one sector growth model with irreversible investment. We develop parameterized ex