Arc-search techniques for interior-point methods / Yaguang Yang.
"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...
Saved in:
| Online Access: |
Full Text (via Taylor & Francis) |
|---|---|
| Main Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Boca Raton :
CRC Press : Taylor & Francis Group,
[2020]
|
| Subjects: |
Table of Contents:
- A potential-reduction algorithm for LP
- Feasible path-following algorithms for LP
- Infeasible interior-point method algorithms for LP
- A feasible arc-search algorithm for LP
- A MTY-type infeasible arc-search Algorithm for LP
- A Mehrotra-type infeasible arc-search algorithm for LP
- An O( n̄L) infeasible arc-search algorithm for LP
- An arc-search algorithm for convex quadratic programming
- An arc-search algorithm for QP with box constraints
- An arc-search algorithm for LCP
- An arc-search algorithm for semidefinite programming.