✦ LIBER ✦

A Modified Projection Algorithm for Large Strictly-Convex Quadratic Programs

✍ Scribed by V. Ruggiero; L. Zanni

Book ID: 111535311
Publisher: Springer
Year: 2000
Tongue: English
Weight: 227 KB
Volume: 104
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1004605612267

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for Solving Strictly Con

A New Algorithm for Solving Strictly Convex Quadratic Programs

✍ Li, Wu; Swetits, John 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 454 KB

Towards a strongly polynomial algorithm

Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm

✍ Frieda Granot; Jadranka Skorin-Kapov 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 538 KB

An extension of Karmarkar's projective a

An extension of Karmarkar's projective algorithm for convex quadratic programming

✍ Yinyu Ye; Edison Tse 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 884 KB

Applying a Newton Method to Strictly Con

Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs

✍ Sun, J.; Kuo, H. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 KB

A new penalty function algorithm for con

A new penalty function algorithm for convex quadratic programming

✍ M. Ben-Daya; K.S. Al-Sultan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 607 KB

In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e

A project neural network for solving deg

A project neural network for solving degenerate convex quadratic program

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