<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>04609nam a22005055i 4500</leader>
  <controlfield tag="001">978-0-387-26379-3</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20260521091840.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">100301s2005    xxu|    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780387263793</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">99780387263793</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/b100325</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">CICY</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
    <subfield code="a">519.6</subfield>
    <subfield code="2">23</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Roos, Cornelis.</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Interior Point Methods for Linear Optimization</subfield>
    <subfield code="h">[recurso electr&#xF3;nico] /</subfield>
    <subfield code="c">by Cornelis Roos, Tam&#xE1;s Terlaky, Jean-Philiipe Vial.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">Revised Edition.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Boston, MA :</subfield>
    <subfield code="b">Springer US,</subfield>
    <subfield code="c">2005.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">XXIV, 497 p.</subfield>
    <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">recurso en l&#xED;nea</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Introduction: Theory and Complexity -- Duality Theory for Linear Optimization -- A Polynomial Algorithm for the Self-dual Model -- Solving the Canonical Problem -- The Logarithmic Barrier Approach -- Preliminaries -- The Dual Logarithmic Barrier Method -- The Primal-Dual Logarithmic Barrier Method -- Initialization -- The Target-following Approach -- Preliminaries -- The Primal-Dual Newton Method -- Applications -- The Dual Newton Method -- The Primal Newton Method -- Application to the Method of Centers -- Miscellaneous Topics -- Karmarkar's Projective Method -- More Properties of the Central Path -- Partial Updating -- Higher-Order Methods -- Parametric and Sensitivity Analysis -- Implementing Interior Point Methods.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Linear Optimization (LO) is one of the most widely applied and taught techniques in mathematics, with applications in many areas of science, commerce and industry. The dramatically increased interest in the subject is due mainly to advances in computer technology and the development of Interior Point Methods (IPMs) for LO. This book provides a unified presentation of the field. The authors present a self-contained comprehensive interior point approach to both the theory of LO and algorithms for LO (design, convergence, complexity, asymptotic behaviour and computational issues). A common thread throughout the book is the role of strictly complementary solutions, which play a crucial role in the interior point approach and distinguishes the new approach from the classical Simplex-based approach. The approach to LO in this book is new in many aspects. In particular the IPM and self-dual model based development of duality theory is surprisingly elegant. The algorithmic part of this book contains a complete discussion of many algorithmic variants, including predictor-corrector methods, partial updating, higher order methods and sensitivity and parametric analysis. The comprehensive coverage of the subject, together with the clarity of presentation, ensures that this book will be an invaluable resource for researchers and professionals who wish to develop their understanding of LO and IPMs. Numerous exercises are provided to help consolidate understanding of the material and more than 45 figures are included to illustrate the characteristics of the algorithms. A general understanding of linear algebra and calculus is assumed. The first chapters provide a self-contained introduction to LO for readers who are unfamiliar with LO methods; however these chapters are also of interest for others who want to have a fresh look at the topic. Audience This book is intended for the optimization researcher community, advanced undergraduate and graduate students who are interested to learn the fundamentals and major variants of Interior Point Methods for linear optimization, who want to have a comprehensive introduction to Interior Point Methods that revolutionized the theory and practice of modern optimization.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">MATHEMATICS.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">ALGORITHMS.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">COMPUTER SCIENCE.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">MATHEMATICAL OPTIMIZATION.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">OPERATIONS RESEARCH.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
    <subfield code="a">MATHEMATICS.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">OPTIMIZATION.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">COMPUTATIONAL SCIENCE AND ENGINEERING.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">ALGORITHMS.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Terlaky, Tam&#xE1;s.</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Vial, Jean-Philiipe.</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Springer eBooks</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9780387263786</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">http://dx.doi.org/10.1007/b100325</subfield>
    <subfield code="z">Ver el&#xA0;texto&#xA0;completo en las instalaciones del CICY</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">ER</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">32511</subfield>
    <subfield code="d">32511</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">LE</subfield>
    <subfield code="a">CICY</subfield>
    <subfield code="b">CICY</subfield>
    <subfield code="c">EL</subfield>
    <subfield code="d">2025-07-10</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">519.6</subfield>
    <subfield code="r">2025-07-10 08:39:36</subfield>
    <subfield code="w">2025-07-10</subfield>
    <subfield code="y">ER</subfield>
  </datafield>
</record>
