03213cam a2200577Mi 4500 9781003042518 FlBoTFG 20260210180806.0 m o d cr |n||||||||| 200929s2020 flu ob 001 0 eng d OCoLC-P eng OCoLC-P 9781000220339 (electronic bk.) 1000220338 (electronic bk.) 9781000220131 (PDF ebook) 1000220133 9781000220230 (Mobipocket ebook) 1000220230 9781003042518 (ebook) 1003042511 9780367487287 0367487284 10.1201/9781003042518 doi (OCoLC)1198016973 (OCoLC)1197870705 (OCoLC-P)1198016973 QA402.5 MAT 003000 bisacsh MAT 004000 bisacsh MAT 013000 bisacsh UMB bicssc 519.7 23 Yang, Yaguang, author. Arc-search techniques for interior-point methods [electronic resource] / Yaguang Yang. Boca Raton : CRC Press ; Taylor & Francis Group, [2020] 1 online resource text rdacontent still image rdacontent computer rdamedia online resource rdacarrier 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. "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"-- Provided by publisher. OCLC-licensed vendor bibliographic record. Interior-point methods. Linear programming. 4744 Computer algorithms. 4948 MATHEMATICS / Applied bisacsh MATHEMATICS / Arithmetic bisacsh MATHEMATICS / Graphic Methods bisacsh Taylor & Francis https://www.taylorfrancis.com/books/9781003042518 OCLC metadata license agreement http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf 91209 91208