000			03172cam a2200565Mi 4500
001			9781003042518
003			FlBoTFG
005			20220509193033.0
006			m o d
007			cr |n|||||||||
008			200929s2020 flu ob 001 0 eng d
040			_aOCoLC-P _beng _cOCoLC-P
020			_a9781000220339 _q(electronic bk.)
020			_a1000220338 _q(electronic bk.)
020			_a9781000220131 _q(PDF ebook)
020			_a1000220133
020			_a9781000220230 _q(Mobipocket ebook)
020			_a1000220230
020			_a9781003042518 _q(ebook)
020			_a1003042511
020			_z9780367487287
020			_z0367487284
024	7		_a10.1201/9781003042518 _2doi
035			_a(OCoLC)1198016973 _z(OCoLC)1197870705
035			_a(OCoLC-P)1198016973
050		4	_aQA402.5
072		7	_aMAT _x003000 _2bisacsh
072		7	_aMAT _x004000 _2bisacsh
072		7	_aMAT _x013000 _2bisacsh
072		7	_aUMB _2bicssc
082	0	4	_a519.7 _223
100	1		_aYang, Yaguang, _eauthor.
245	1	0	_aArc-search techniques for interior-point methods _h[electronic resource] / _cYaguang Yang.
264		1	_aBoca Raton : _bCRC Press ; _bTaylor & Francis Group, _c[2020]
300			_a1 online resource
336			_atext _2rdacontent
336			_astill image _2rdacontent
337			_acomputer _2rdamedia
338			_aonline resource _2rdacarrier
505	0		_aA 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.
520			_a"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"-- _cProvided by publisher.
588			_aOCLC-licensed vendor bibliographic record.
650		0	_aInterior-point methods.
650		0	_aLinear programming.
650		0	_aComputer algorithms.
650		7	_aMATHEMATICS / Applied _2bisacsh
650		7	_aMATHEMATICS / Arithmetic _2bisacsh
650		7	_aMATHEMATICS / Graphic Methods _2bisacsh
856	4	0	_3Taylor & Francis _uhttps://www.taylorfrancis.com/books/9781003042518
856	4	2	_3OCLC metadata license agreement _uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
999			_c128660 _d128660