Books > Computing & IT > General theory of computing > Mathematical theory of computation
|
Buy Now
Primal-dual Interior-point Methods (Paperback)
Loot Price: R2,353
Discovery Miles 23 530
|
|
Primal-dual Interior-point Methods (Paperback)
Expected to ship within 12 - 17 working days
|
In the past decade, primal-dual algorithms have emerged as the most
important and useful algorithms from the interior-point class. This
book presents the major primal-dual algorithms for linear
programming in straightforward terms. A thorough description of the
theoretical properties of these methods is given, as are a
discussion of practical and computational aspects and a summary of
current software. This is an excellent, timely, and well-written
work. The major primal-dual algorithms covered in this book are
path-following algorithms (short- and long-step,
predictor-corrector), potential-reduction algorithms, and
infeasible-interior-point algorithms. A unified treatment of
superlinear convergence, finite termination, and detection of
infeasible problems is presented. Issues relevant to practical
implementation are also discussed, including sparse linear algebra
and a complete specification of Mehrotra's predictor-corrector
algorithm. Also treated are extensions of primal-dual algorithms to
more general problems such as monotone complementarity,
semidefinite programming, and general convex programming problems.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.