SDP vs. LP relaxations for the moment approach in some performance evaluation problems

Stochastic Models

Volumn 20, Issue 4, 2004, Pages 439-456

  Lasserre, Jean Bernard ^a   Prieto Rumeau, Tomás ^b  

^a LAAS CNRS   (France)

^b UNIVERSIDAD NACIONAL DE EDUCACIÓN A DISTANCIA   (Spain)

Author keywords

Computational methods for Markov processes; Linear relaxations; Semidefinite relaxations

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; EVALUATION; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TIME DIVISION MULTIPLE ACCESS;

LINEAR RELAXATION; NUMERICAL COMPUTATIONS; SEMIDEFINITE RELAXATIONS;

MARKOV PROCESSES;

EID: 8644236621     PISSN: 15326349     EISSN: None     Source Type: Journal    
DOI: 10.1081/STM-200033112     Document Type: Article

References (21)

1. Helmes, K.; Röhl, S.; Stockbridge, R.H. Computing moments of the exit time distribution for Markov processes by linear programming. Oper. Res. 2001, 49, 516-530.
2. Stockbridge, R.H. Time-average control of martingale problems: Existence of a stationary solution. Ann. Probab. 1990, 18, 190-205.
3. Stockbridge, R.H. Time-average control of martingale problems: A linear programming formulation. Ann. Probab. 1990, 18, 206-217.
4. Kurtz, T.G.; Stockbridge, R.H.; Richard, H. Stationary solutions and forward equations for controlled and singular martingale problems. Electronic J. Probab. 2001, 6, Paper No. 17.
5. Ethier, S.N.; Kurtz, T.G. Markov Processes: Characterization and Convergence; John Wiley: New York, 1986.
6. Dawson, D.A. Geostochastic calculus. Can. J. Statist. 1978, 6, 143-168.
7. Dawson, D.A. Qualitative behaviour of geostochastic systems. Stoch. Proc. Appl. 1980, 10, 1-31.
8. Feller, W. An Introduction to Probability Theory and Its Applications; John Wiley: New York, 1965; Vol. 2.
9. Shohat, J.; Tamarkin, J. The Problem of Moments, 1st Ed.; American Mathematical Society: Providence, RI, 1943.
10. Vandenberghe, L.; Boyd, S. Semidefinite programming. SIAM Rev. 1996, 38, 49-95.
11. Schwerer, E. A linear programming approach to the steady-state analysis of reflected Brownian motion. Stoch. Models 2001, 17, 341-368.
12. Lovász, L.; Schrijver, A. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1991, 1, 166-190.
13. Lasserre, J.B. An equivalent positive semidefinite program for non-linear 0-1 programs. SIAM J. Optim. 2002, 12, 756-769.
14. Kurtz, T.G.; Stockbridge, R.H. Existence of Markov controls and characterization of optimal Markov controls. SIAM J. Control Optim. 1998, 36, 609-653.
15. Putinar, M. Positive polynomials on compact semi-algebraic sets. Ind. Univ. J. 1993, 42, 969-984.
16. Curto, R.E.; Fialkow, L.A. Recursiveness, positivity and truncated moment problems. Houston J. Math. 1991, 17, 603-635.
17. Lasserre, J.B. Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 2002, 27, 347-360.
18. Sturm, J.S. Using SeDuMi, a Matlab toolbox for optimization over symmetric cones (updated for Version 1.05). Optim. Methods Softw. 1999, 11-12, 625-653.
19. Baxter, M.W.; Rennie, A.J.O. Financial Calculus; Cambridge University Press: Cambridge, 1993.
20. Srivastava, M.S.; Wu, Y. Dynamic sampling plan in Shiryaev-Roberts procedure for detecting a change in the drift of Brownian motion. Ann. Statis. 1994, 22, 805-823.
21. Lasserre, J.B.; Prieto-Rumeau, T.; Zervos, M. Pricing a class of exotic options via moments and SDP relaxations. LAAS Report No. 03391. Submitted 2003.