✦ LIBER ✦

Randomized algorithms for the separation of point sets and for solving quadratic programs

✍ Scribed by N. D. Botkin

Publisher: Springer
Year: 1995
Tongue: English
Weight: 636 KB
Volume: 32
Category: Article
ISSN: 0095-4616
DOI: 10.1007/bf01185230

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparsity-preserving sor algorithms for s

Sparsity-preserving sor algorithms for separable quadratic and linear programming

✍ O.L. Mangasarian 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 571 KB

The sequential linear quadratic programm

The sequential linear quadratic programming algorithm for solving dynamic optimization problems - a review.

✍ Sverre Støren; Terje Hertzberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

An algorithm for solving the diagnostic

An algorithm for solving the diagnostic and setting problems for automata

✍ A. M. Bogomolov; V. G. Skobelev 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 502 KB

Parallel algorithms for separation of tw

Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

✍ Dilip Sarkar; Ivan Stojmenović 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 605 KB

Parallel computational issues of an inte

Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems

✍ M. D’Apuzzo; M. Marino 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 181 KB

This paper deals with a parallel implementation of an interior point algorithm for solving sparse convex quadratic programs with bound constraints. The parallelism is introduced at the linear algebra level. Concerning the solution of the linear system arising at each step of the considered algorithm

A new algorithm for solving convex param

A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings

✍ Panagiotis Patrinos; Haralambos Sarimveis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 928 KB