✦ LIBER ✦

A method of solution of a convex programming problem

✍ Scribed by V. N. Gordeev

Publisher: Springer US
Year: 1974
Tongue: English
Weight: 275 KB
Volume: 7
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070456

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A descent method with the use of duality

A descent method with the use of duality for the solution of a convex programming problem in a Hilbert space

✍ V. S. Izhutkin; A. N. Moloshnyuk 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 357 KB

Multiplex method for a convex programmin

Multiplex method for a convex programming problem

✍ V. S. Izhutkin 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 421 KB

On a convex programming problem of Rozan

On a convex programming problem of Rozanov

✍ George B. Dantzig 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 220 KB

A method of solving linear and convex pr

A method of solving linear and convex programming problems

✍ Ya.M. Bershchanskii 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 552 KB

One method of solving the convex program

One method of solving the convex programming problem

✍ B. N. Pshenichnyi 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 643 KB

Convex solution of a permutation problem

✍ Marko Stošić; Manuel Marques; João Paulo Costeira 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 164 KB

In this paper, we show that a problem of finding a permuted version of k vectors from R N such that they belong to a prescribed rank r subset, can be solved by convex optimization. We prove that under certain generic conditions, the wanted permutation matrix is unique in the convex set of doubly-sto