Arc-search techniques for interior-point methods /
"This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which solves a long-standing issue of the interior-point methods in linea...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Boca Raton :
CRC Press ; Taylor and Francis Group,
[2020]
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | "This book discusses one of the most recent developments in interior-point methods, the arc-search techniques. Introducing these techniques result in an efficient interior-point algorithm with the lowest polynomial bound, which solves a long-standing issue of the interior-point methods in linear programming, i.e., the algorithm with the best polynomial bound is the least efficient and the most efficient interior-point algorithm cannot be proved to converge. The book also covers important results since 1990s and the extensions of the arc-search techniques to the general optimization problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming"-- |
|---|---|
| Physical Description: | 1 online resource |
| ISBN: | 9781000220339 1000220338 9781000220131 1000220133 9781000220230 1000220230 9781003042518 1003042511 |