Vi varmer op til Black Friday - Vind masser af præmier Vind masser af præmier Deltag her

Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems


Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Bog, hardback (kr. 3.529,95) (kr. 3.589,95)
  • Leveringstid 5-7 hverdage
  • Forventet levering 30-11-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 40.000 e- og lydbøger
Format:
Bog, hardback
Udgivelsesdato:
01-05-2000
Sprog:
Engelsk
Sidetal:
604
Læsernes anmeldelser
(0 anmeldelser)
  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
    ISBN13:
    9780792362753
    Vægt:
    1016 g
    Dybde:
    33 mm
    Bredde:
    156 mm
    Højde:
    234 mm
    Forlag:
    Springer
    Format:
    Hardback
  3. Anmeldelser

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.