Numerical optimization. Theoretical and practical aspects. Transl. from the French (Q5898137): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q55868305, #quickstatements; #temporary_batch_1714936405447
 
Property / Wikidata QID
 
Property / Wikidata QID: Q55868305 / rank
 
Normal rank

Latest revision as of 21:14, 5 May 2024

scientific article; zbMATH DE number 5071162
Language Label Description Also known as
English
Numerical optimization. Theoretical and practical aspects. Transl. from the French
scientific article; zbMATH DE number 5071162

    Statements

    Numerical optimization. Theoretical and practical aspects. Transl. from the French (English)
    0 references
    0 references
    8 November 2006
    0 references
    The first edition of the book is refereed under [Numerical optimization. Theoretical and practical aspects. Transl. from the French. Universitext. Berlin: Springer (2003; Zbl 1014.65045)]. The new one comes with substantial extensions on 70 additional pages. New sections are 6.5: Quadratic programming, 7: A case study: Seismic reflection tomography, 11: Applications of nonsmooth optimization, 12: Computational exercises (nonsmooth optimization). More realistic application problems are introduced with the emphasis on outlining a typical modelling process in more detail. Some new variants of the bundle method for nonsmooth optimization are studied together with the possibility to run some of the codes under consideration on a classical example. Moreover, the presentation of theoretical results on nonsmooth optimization is reorganized and contains now a new subsection with convergence results. The book provides an excellent basis for studying optimzation theory and algorithms, especially for nonsmooth optimization. Additional case studies, availability of computer codes, and exercises improve the understanding of numerical algorithms and the practical problem solving process. In summary, the second edition significantly improves the first one.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nonlinear programming
    0 references
    nonsmooth optimization
    0 references
    interior-point algorithms
    0 references
    bundle method
    0 references
    Newton's method
    0 references
    textbook
    0 references
    eismic reflection tomography
    0 references
    unconstrained optimization
    0 references
    interior point methods
    0 references
    linear programming
    0 references
    quadratic programming
    0 references
    complexity
    0 references
    numerical algorithms
    0 references
    software libraries
    0 references
    line-searches
    0 references
    conjugate gradient
    0 references
    exact penalization
    0 references
    simplex algorithm
    0 references
    linear monotone complementarity
    0 references
    predictor-corrector algorithms
    0 references
    non-feasible algorithms
    0 references
    one-step methods
    0 references
    Karmarkar's algorithm
    0 references
    examples
    0 references
    exercises
    0 references
    0 references
    0 references
    0 references
    0 references