✦ LIBER ✦

Generalization of Murty's direct algorithm to linear and convex quadratic programming

✍ Scribed by M. M. Kostreva

Publisher: Springer
Year: 1989
Tongue: English
Weight: 757 KB
Volume: 62
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00939630

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for direct identification o

An algorithm for direct identification of passive transfer matrices with positive real fractions via convex programming

✍ L. De Tommasi; M. de Magistris; D. Deschrijver; T. Dhaene 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

The paper presents a new algorithm for the identification of a positive real rational transfer matrix of a multi-input-multi-output system from frequency domain data samples. It is based on the combination of least-squares pole identification by the Vector Fitting algorithm and residue identificatio

A projection and contraction method for

A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming

✍ Bingsheng He 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 607 KB

Further applications of a splitting algo

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

✍ Paul Tseng 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 750 KB

Algorithm for the simultaneous solution

Algorithm for the simultaneous solution of the direct and dual problem of convex programming in a Banach space

✍ V. A. Gnatyuk 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 397 KB

Semi-analytical algorithm for the approx

Semi-analytical algorithm for the approximate solution of a nonstationary inverse problem of diffusion on the basis of a direct method of solution, linear programming, and regularization methods

✍ P. I. Balk; T. V. Balk 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 524 KB