Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs / Najlacnejšie knihy
Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs

Code: 03211507

Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs

by Kurt Marti

In engineering and economics a certain vector of inputs or decisions must often be chosen, subject to some constraints, such that the expected costs arising from the deviation between the output of a stochastic linear system and a ... more

51.68

RRP: 55.96 €

You save 4.28 €


In stock at our supplier
Shipping in 5 - 8 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs

You get 125 loyalty points

Book synopsis

In engineering and economics a certain vector of inputs or decisions must often be chosen, subject to some constraints, such that the expected costs arising from the deviation between the output of a stochastic linear system and a desired stochastic target vector are minimal. In many cases the loss function u is convex and the occuring random variables have, at least approximately, a joint discrete distribution. Concrete problems of this type are stochastic linear programs with recourse, portfolio optimization problems, error minimization and optimal design problems. In solving stochastic optimization problems of this type by standard optimization software, the main difficulty is that the objective function F and its derivatives are defined by multiple integrals. Hence, one wants to omit, as much as possible, the time-consuming computation of derivatives of F. Using the special structure of the problem, the mathematical foundations and several concrete methods for the computation of feasible descent directions, in a certain part of the feasible domain, are presented first, without any derivatives of the objective function F. It can also be used to support other methods for solving discretely distributed stochastic programs, especially large scale linear programming and stochastic approximation methods.

Book details

Book category Books in English Reference, information & interdisciplinary subjects Research & information: general Information theory

51.68

Trending among others



Collection points Bratislava a 13138 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: