Udvidet returret til d. 31. januar 2025

Convex Analysis and Minimization Algorithms I

- Fundamentals

Bag om Convex Analysis and Minimization Algorithms I

Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783642081613
  • Indbinding:
  • Paperback
  • Sideantal:
  • 418
  • Udgivet:
  • 15. maj 2011
  • Udgave:
  • 11993
  • Størrelse:
  • 233x157x23 mm.
  • Vægt:
  • 612 g.
  • BLACK NOVEMBER
  Gratis fragt
Leveringstid: 8-11 hverdage
Forventet levering: 20. november 2024

Beskrivelse af Convex Analysis and Minimization Algorithms I

Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research.

Brugerbedømmelser af Convex Analysis and Minimization Algorithms I



Find lignende bøger
Bogen Convex Analysis and Minimization Algorithms I findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.