𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel relaxation method for quadratic programming problems with interval constraints

✍ Scribed by Takanobu Sugimoto; Masao Fukushima; Toshihide Ibaraki

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
852 KB
Volume
60
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Modified relaxation method for mathemati
Modified relaxation method for mathematical programs with complementarity constraints
✍ Gui-Hua Lin πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 167 KB

## Abstract In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper (__J. Opt. Theory Appl.__ 2003; **118**:81–116). We show that the main results remai

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