✦ LIBER ✦

Generalization of Karmarkar's algorithm to convex homogeneous functions

✍ Scribed by Bahman Kalantari

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 387 KB
Volume: 11
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90039-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Generalization of Murty's direct algorit

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

✍ M. M. Kostreva 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 757 KB

A generalization of Hadamard’s inequalit

A generalization of Hadamard’s inequality for convex functions

✍ W.H. Yang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 152 KB

In this note, we give a counterexample to show that Hadamard's inequality does not hold on a polyhedron in multi-dimensional Euclidean space. Then we give a sufficient condition on the polyhedron for Hadamard's inequality to hold. Finally, we provide an approach to create a large class of polyhedra

On the convexity of the multiplicative v

On the convexity of the multiplicative version of Karmarkar's potential function

✍ Hiroshi Imai 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

A generalization of a class of close-to-

A generalization of a class of close-to-convex functions

✍ D. V. Prokhorov 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 287 KB

Extremum functions of finite families of

Extremum functions of finite families of convex homogeneous functions

✍ V. I. Matov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 738 KB