| Presentation | 1998/3/19 New Networks for Linear Programming Yukihiko Yamashita, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We propose a set of new algorithms for linear programming. These algorithms are derived by accelerating the method of averaged convex projections for linear inequalities. We provide strict proofs for the convergence of our algorithms. The algorithms are so simple that they can be calculated by superparallel processing. To this effect. We propose networks for implementing the algorithms. Furthermore, we provide illustrative examples to demonstrate the capability of our algorithms. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | linear programming / method of convex projections / supper-parallel processing / steepest descent method / conjugate gradient method |
| Paper # | |
| Date of Issue |
| Conference Information | |
| Committee | NC |
|---|---|
| Conference Date | 1998/3/19(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Neurocomputing (NC) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | New Networks for Linear Programming |
| Sub Title (in English) | |
| Keyword(1) | linear programming |
| Keyword(2) | method of convex projections |
| Keyword(3) | supper-parallel processing |
| Keyword(4) | steepest descent method |
| Keyword(5) | conjugate gradient method |
| 1st Author's Name | Yukihiko Yamashita |
| 1st Author's Affiliation | Department of International Development Engineering() |
| Date | 1998/3/19 |
| Paper # | |
| Volume (vol) | vol.97 |
| Number (no) | 623 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |