Isbn: 9783031848391 - methods of nonsmooth optimization in stochastic programming: from conceptual algorithms to real-world applications: 363 (international series in operations research & management science, 363) (4 resultados)

ISBN
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (4)

  • Nuevo (4)

a

Intervalo de precios personalizado (EUR)

a

    • Idioma: Inglés

      Editorial: Springer, 2026

      303184839X / 9783031848391

      • Tapa blanda

      Librería: preigu, Osnabrück, Alemaniapreigu

      Vendedor de 5 estrellas
      Contactar con el vendedor

      Condición: Nuevo

      EUR 104,25

      Envío por EUR 70,00 
      Se envía de Alemania a Estados Unidos de America

      Cantidad disponible: 5 disponibles

      Taschenbuch. Condición: Neu. Methods of Nonsmooth Optimization in Stochastic Programming | From Conceptual Algorithms to Real-World Applications | Wim Stefanus van Ackooij (u. a.) | Taschenbuch | xvi | Englisch | 2026 | Springer | EAN 9783031848391 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

    • Idioma: Inglés

      Editorial: Springer, 2026

      303184839X / 9783031848391

      • Tapa blanda

      Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

      Vendedor de 5 estrellas
      Contactar con el vendedor

      Condición: Nuevo

      EUR 166,33

      Envío por EUR 30,50 
      Se envía de Alemania a Estados Unidos de America

      Cantidad disponible: 1 disponibles

      Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a comprehensive series of methods in nonsmooth optimization, with a particular focus on their application in stochastic programming and dedicated algorithms for decision-making under uncertainty. Each method is accompanied by rigorous mathematical analysis, ensuring a deep understanding of the underlying principles. The theoretical discussions included are essential for comprehending the mechanics of various algorithms and the nature of the solutions they provide-whether they are global, local, stationary, or critical. The book begins by introducing fundamental tools from set-valued analysis, optimization, and probability theory. It then transitions from deterministic to stochastic optimization, starting with a thorough discussion of modeling, understanding uncertainty, and incorporating it into optimization problems. Following this foundation, the book explores numerical algorithms for nonsmooth optimization, covering well-known decomposition techniques and algorithms for convex optimization, mixed-integer convex programming, and nonconvex optimization. Additionally, it introduces numerical algorithms specifically for stochastic programming, focusing on stochastic programming with recourse, chance-constrained optimization, and detailed algorithms for both risk-neutral and risk-averse multistage stochastic programs.The book guides readers through the entire process, from defining optimization models for practical problems to presenting implementable algorithms that can be applied in practice. It is intended for students, practitioners, and scholars who may be unfamiliar with stochastic programming and nonsmooth optimization. The analyses provided are also valuable for practitioners who may not be interested in convergence proofs but wish to understand the nature of the solutions obtained.

    • Idioma: Inglés

      Editorial: Springer Mai 2026, 2026

      303184839X / 9783031848391

      • Tapa blanda
      • Impresión bajo demanda

      Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

      Vendedor de 5 estrellas
      Contactar con el vendedor

      Condición: Nuevo

      EUR 117,69

      Envío por EUR 23,00 
      Se envía de Alemania a Estados Unidos de America

      Cantidad disponible: 2 disponibles

      Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book presents a comprehensive series of methods in nonsmooth optimization, with a particular focus on their application in stochastic programming and dedicated algorithms for decision-making under uncertainty. Each method is accompanied by rigorous mathematical analysis, ensuring a deep understanding of the underlying principles. The theoretical discussions included are essential for comprehending the mechanics of various algorithms and the nature of the solutions they provide-whether they are global, local, stationary, or critical. The book begins by introducing fundamental tools from set-valued analysis, optimization, and probability theory. It then transitions from deterministic to stochastic optimization, starting with a thorough discussion of modeling, understanding uncertainty, and incorporating it into optimization problems. Following this foundation, the book explores numerical algorithms for nonsmooth optimization, covering well-known decomposition techniques and algorithms for convex optimization, mixed-integer convex programming, and nonconvex optimization. Additionally, it introduces numerical algorithms specifically for stochastic programming, focusing on stochastic programming with recourse, chance-constrained optimization, and detailed algorithms for both risk-neutral and risk-averse multistage stochastic programs.The book guides readers through the entire process, from defining optimization models for practical problems to presenting implementable algorithms that can be applied in practice. It is intended for students, practitioners, and scholars who may be unfamiliar with stochastic programming and nonsmooth optimization. The analyses provided are also valuable for practitioners who may not be interested in convergence proofs but wish to understand the nature of the solutions obtained. 588 pp. Englisch.

    • Idioma: Inglés

      Editorial: Springer Mai 2026, 2026

      303184839X / 9783031848391

      • Tapa blanda
      • Impresión bajo demanda

      Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

      Vendedor de 5 estrellas
      Contactar con el vendedor

      Condición: Nuevo

      EUR 117,69

      Envío por EUR 60,00 
      Se envía de Alemania a Estados Unidos de America

      Cantidad disponible: 1 disponibles

      Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents a comprehensive series of methods in nonsmooth optimization, with a particular focus on their application in stochastic programming and dedicated algorithms for decision-making under uncertainty. Each method is accompanied by rigorous mathematical analysis, ensuring a deep understanding of the underlying principles. The theoretical discussions included are essential for comprehending the mechanics of various algorithms and the nature of the solutions they provide-whether they are global, local, stationary, or critical. The book begins by introducing fundamental tools from set-valued analysis, optimization, and probability theory. It then transitions from deterministic to stochastic optimization, starting with a thorough discussion of modeling, understanding uncertainty, and incorporating it into optimization problems. Following this foundation, the book explores numerical algorithms for nonsmooth optimization, covering well-known decomposition techniques and algorithms for convex optimization, mixed-integer convex programming, and nonconvex optimization. Additionally, it introduces numerical algorithms specifically for stochastic programming, focusing on stochastic programming with recourse, chance-constrained optimization, and detailed algorithms for both risk-neutral and risk-averse multistage stochastic programs.The book guides readers through the entire process, from defining optimization models for practical problems to presenting implementable algorithms that can be applied in practice. It is intended for students, practitioners, and scholars who may be unfamiliar with stochastic programming and nonsmooth optimization. The analyses provided are also valuable for practitioners who may not be interested in convergence proofs but wish to understand the nature of the solutions obtained. 588 pp. Englisch.