✦ LIBER ✦

An extension of the Fletcher–Reeves method to linear equality constrained optimization problem

✍ Scribed by Li, Can; Li, Dong-Hui

Book ID: 122884639
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 275 KB
Volume: 219
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.04.055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extension of the simplex method to co

An extension of the simplex method to constrained nonlinear optimization

✍ M. B. Subrahmanyam 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 432 KB

An Extension of Lemke's Method to the Pi

An Extension of Lemke's Method to the Piecewise Linear Complementarity Problem

✍ Masakazu Kojima, Hisakazu Nishino and Tomoharu Sekine 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 854 KB

An extension of the conditional gradient

An extension of the conditional gradient method to a class of nonconvex optimization problems

✍ Yu. A. Chernyaev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 174 KB

An approximate method of solving the lin

An approximate method of solving the linear time optimal problem

✍ V.A. Sokol; N.T. Tynyanskii 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 753 KB

An extension of the conjugate residual m

An extension of the conjugate residual method to nonsymmetric linear systems

✍ T. Sogabe; M. Sugihara; S.-L. Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 752 KB

algorithm Coupled two-term recurrences a b s t r a c t The Conjugate Gradient (CG) method and the Conjugate Residual (CR) method are Krylov subspace methods for solving symmetric (positive definite) linear systems. To solve nonsymmetric linear systems, the Bi-Conjugate Gradient (Bi-CG) method has b

Solving optimization problems on ranks a

Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method

✍ Yongge Tian 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 332 KB