Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Sakalauskas, Leonidas
Affiliations: Institute of Mathematics and Informatics, Akademijos 4, 08663 Vilnius, Lithuania, e‐mail: [email protected]
Abstract: We consider a problem of nonlinear stochastic optimization with linear constraints. The method of ε‐feasible solution by series of Monte‐Carlo estimators has been developed for solving this problem avoiding “jamming” or “zigzagging”. Our approach is distinguished by two peculiarities: the optimality of solution is tested in a statistical manner and the Monte‐Carlo sample size is adjusted so as to decrease the total amount of Monte‐Carlo trials and, at the same time, to guarantee the estimation of the objective function with an admissible accuracy. Under some general conditions we prove by the martingale approach that the proposed method converges a.s. to the stationary point of the problem solved. As a counterexample the maximization of the probability of portfolio desired return is given, too.
Keywords: Monte‐Carlo method, portfolio optimization, stochastic programming, ε‐feasible solution
Journal: Informatica, vol. 15, no. 2, pp. 271-282, 2004
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]