𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for indefinite quadratic programming with convex constraints

✍ Scribed by LêD. Muu; W. Oettli

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
284 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for indefinite integer quad
An algorithm for indefinite integer quadratic programming
✍ S.S. Erenguc; H.P. Benson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b

An algorithm for quadratic programming
An algorithm for quadratic programming
✍ Marguerite Frank; Philip Wolfe 📂 Article 📅 1956 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

Pr in c e t o n Un i v e r s i t y A finite iteration method for calculating the solution of quadratic Extensions to m o r e general nonprogramming problems is described.r linear Droblems a r e suggested.

A Parallel Algorithm for Linear Programs
A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint
✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo

A new penalty function algorithm for con
A new penalty function algorithm for convex quadratic programming
✍ M. Ben-Daya; K.S. Al-Sultan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 607 KB

In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e