✦ LIBER ✦

On computing the center of a convex quadratically constrained set

✍ Scribed by Sanjay Mehrotra; Jie Sun

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 322 KB
Volume: 50
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01594926

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for computing the center of a

Algorithms for computing the center of area of a convex polygon

✍ Matthew Díaz; Joseph O'Rourke 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 1009 KB

The computational complexity of a set of

The computational complexity of a set of quadratic functions

✍ Joseph Ja'Ja' 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the convergence of the method of anal

On the convergence of the method of analytic centers when applied to convex quadratic programs

✍ F. Jarre 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 821 KB

Minimization of convex functions on the

Minimization of convex functions on the convex hull of a point set

✍ Nikolai D. Botkin; Josef Stoer 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 186 KB

On the stability of a convex set of matr

On the stability of a convex set of matrices

✍ Vakif Dzhafarov; Taner Büyükköroğlu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 154 KB

In this paper we give an alternative proof of the constant inertia theorem for convex compact sets of complex matrices. It is shown that the companion matrix whose non-trivial column is negative satisfies the directional Lyapunov condition (inclusion) for real multiplier vectors. An example of a rea

A note on the strong polynomiality of co

A note on the strong polynomiality of convex quadratic programming

✍ Sung-Pil Hong; Sushil Verma 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 569 KB