Streaming af e- og lydbøger Stream e- og lydbøger Prøv gratis

Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems

Du sparer 13% fra forlagets pris Du sparer 14% fra forlagets pris
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
  • Forlagets pris kr. 3.579,95
  • Leveringstid 5-9 hverdage
  • Forventet levering 02-08-2018
Køb til medlemspris og få altid fri fragt.
Prøv 14 dage gratis (herefter 79,-/md.).

Læs mere om Saxo Premium her.
  • Op til 70% rabat
  • Fri fragt
  • Stream 30.000 e- og lydbøger
Bog, hardback (kr. 3.069,95) (kr. 3.129,95)
  1. Beskrivelse

    There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet­ ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap­ proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob­ lems, new approximate algorithms have been developed based on semidefinite pro­ gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri­ cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con­ tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

  2. Yderligere info
    Udgivelsesdato:
    01-05-2000
    Sprog:
    Engelsk
    ISBN13:
    9780792362753
    Sidetal:
    604
    Vægt:
    1016 g
    Højde:
    33 mm
    Bredde:
    156 mm
    Længde:
    234 mm
    Forlag:
    Springer
    Mærkat:
    Bog, hardback
    Format:
    Hardback
  3. Anmeldelser

    Kundernes boganmeldelser af Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems

Fandt du ikke hvad du søgte?

Hvis denne bog ikke er noget for dig, kan du benytte kategorierne nedenfor til at finde andre titler. Klik på en kategori for at se lignende bøger.