<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Numerical optimization</title>
    <subTitle>theoretical and practical aspects</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Bonnans, J. F.</namePart>
    <namePart type="date">1957-</namePart>
  </name>
  <typeOfResource/>
  <originInfo>
    <place>
      <placeTerm type="text">Berlin</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Springer</publisher>
    <dateIssued>c2003</dateIssued>
    <issuance/>
  </originInfo>
  <physicalDescription>
    <extent>xiii, 419 p. : ill. ; 24 cm.</extent>
  </physicalDescription>
  <tableOfContents>General Introduction (Page-3),Basic Methods (Page-25),Line-Searches (Page-37),Newtonian Methods (Page-51),Conjugate Gradient (Page-67),Special Methods (Page-77),A Case Study: Seismic Reection Tomography (Page-97),Introduction  to Nonsmooth Optimization (Page-109),Some Methods in Nonsmooth Optimization (Page-119),Bundle Methods. The Quest for Descent (Page-137),Applications of Nonsmooth Optimization (Page-161), Computational Exercises (Page-183),Background (Page-197),Local Methods for Problems with Equality Constraints (Page-215),Local Methods for Problems with Equality and Inequality Constraints (Page-255),Exact Penalization (Page-271),Globalization by Line-Search (Page-289),Quasi-Newton Versions (Page-323), Linearly Constrained Optimization and Simplex Algorithms (Page-353),Linear Monotone Complementarity and Associated Vectors Fields (Page-371),Predictor-Corrector Algorithms (Page-395),Non-Feasible Algorithms (Page-411),Self-Duality (Page-425),One-Step Methods (Page-435),Complexity of Linear Optimization Problems with Integer Data (Page-451),Karmarkar’s Algorithm (Page-457).       
 </tableOfContents>
  <note type="statement of responsibility">J. Frederic Bonnans</note>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Mathematical optimization</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Numerical analysis</topic>
    <topic>Data processing</topic>
  </subject>
  <classification authority="ddc">519.3, BON</classification>
  <relatedItem type="series">
    <titleInfo>
      <title>Universitext</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">3540001913 (pbk. : acid-free paper)</identifier>
  <identifier type="lccn">2002042915</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg"/>
    <recordChangeDate encoding="iso8601">20221125115435.0</recordChangeDate>
  </recordInfo>
</mods>
