Arc-search techniques for interior-point methods (Record no. 128660)

000 -LEADER
fixed length control field 03172cam a2200565Mi 4500
001 - CONTROL NUMBER
control field 9781003042518
003 - CONTROL NUMBER IDENTIFIER
control field FlBoTFG
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220509193033.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION
fixed length control field m o d
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr |n|||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 200929s2020 flu ob 001 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency OCoLC-P
Language of cataloging eng
Transcribing agency OCoLC-P
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781000220339
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1000220338
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781000220131
-- (PDF ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1000220133
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781000220230
-- (Mobipocket ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1000220230
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781003042518
-- (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1003042511
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780367487287
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 0367487284
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1201/9781003042518
Source of number or code doi
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)1198016973
Canceled/invalid control number (OCoLC)1197870705
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC-P)1198016973
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA402.5
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT
Subject category code subdivision 003000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT
Subject category code subdivision 004000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT
Subject category code subdivision 013000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.7
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Yang, Yaguang,
Relator term author.
245 10 - TITLE STATEMENT
Title Arc-search techniques for interior-point methods
Medium [electronic resource] /
Statement of responsibility, etc Yaguang Yang.
264 #1 -
-- Boca Raton :
-- CRC Press ;
-- Taylor & Francis Group,
-- [2020]
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource
336 ## -
-- text
-- rdacontent
336 ## -
-- still image
-- rdacontent
337 ## -
-- computer
-- rdamedia
338 ## -
-- online resource
-- rdacarrier
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc "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.
588 ## -
-- OCLC-licensed vendor bibliographic record.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Interior-point methods.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Linear programming.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer algorithms.
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / Applied
Source of heading or term bisacsh
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / Arithmetic
Source of heading or term bisacsh
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / Graphic Methods
Source of heading or term bisacsh
856 40 - ELECTRONIC LOCATION AND ACCESS
Materials specified Taylor & Francis
Uniform Resource Identifier https://www.taylorfrancis.com/books/9781003042518
856 42 - ELECTRONIC LOCATION AND ACCESS
Materials specified OCLC metadata license agreement
Uniform Resource Identifier http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf

No items available.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue