Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Gradually Reinforced Sample-Average-Approximation Differentiable Homotopy Method for a System of Stochastic Equations (2403.00294v1)

Published 1 Mar 2024 in math.NA and cs.NA

Abstract: This paper intends to apply the sample-average-approximation (SAA) scheme to solve a system of stochastic equations (SSE), which has many applications in a variety of fields. The SAA is an effective paradigm to address risks and uncertainty in stochastic models from the perspective of Monte Carlo principle. Nonetheless, a numerical conflict arises from the sample size of SAA when one has to make a tradeoff between the accuracy of solutions and the computational cost. To alleviate this issue, we incorporate a gradually reinforced SAA scheme into a differentiable homotopy method and develop a gradually reinforced sample-average-approximation (GRSAA) differentiable homotopy method in this paper. By introducing a series of continuously differentiable functions of the homotopy parameter $t$ ranging between zero and one, we establish a differentiable homotopy system, which is able to gradually increase the sample size of SAA as $t$ descends from one to zero. The set of solutions to the homotopy system contains an everywhere smooth path, which starts from an arbitrary point and ends at a solution to the SAA with any desired accuracy. The GRSAA differentiable homotopy method serves as a bridge to link the gradually reinforced SAA scheme and a differentiable homotopy method and retains the nice property of global convergence the homotopy method possesses while greatly reducing the computational cost for attaining a desired solution to the original SSE. Several numerical experiments further confirm the effectiveness and efficiency of the proposed method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Springer Science & Business Media (2012)
  2. Mathematical Programming 25(1), 83–108 (1983)
  3. Econometrica 64(1), 1–27 (1996)
  4. Mathematical Programming 134(1), 127–155 (2012)
  5. SIAM Journal on Optimization 32(3), 2129–2155 (2022)
  6. SIAM Journal on Optimization 32(4), 2909–2937 (2022)
  7. SIAM Journal on Optimization 22(2), 649–673 (2012)
  8. Mathematical Programming pp. 1–33 (2019)
  9. Dang, C.: The D1subscript𝐷1{D}_{1}italic_D start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-triangulation of rn for simplicial algorithms for computing solutions of nonlinear equations. Mathematics of Operations Research 16(1), 148–161 (1991)
  10. Dang, C.: The D2subscript𝐷2{D}_{2}italic_D start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations. Mathematical Programming 59(1-3), 307–324 (1993)
  11. INFORMS Journal on Computing 34(3), 1403–1418 (2022)
  12. Journal of Machine Learning Research 12(7) (2011)
  13. Eaves, B.C.: The linear complementarity problem. Management Science 17(9), 612–634 (1971)
  14. Eaves, B.C.: Homotopies for computation of fixed points. Mathematical Programming 3(1), 1–22 (1972)
  15. Journal of Economic Dynamics and Control 23(9), 1249–1279 (1999)
  16. INFORMS Journal on Computing 35(6), 1511–1526 (2023)
  17. Springer Science & Business Media (2007)
  18. Springer Science & Business Media (2013)
  19. Mathematical Programming 84(2), 313–333 (1999)
  20. Herings, P.J.J.: Two simple proofs of the feasibility of the linear tracing procedure. Economic Theory 15(2), 485–490 (2000)
  21. Mathematics of operations research 27(4), 637–646 (2002)
  22. Economic Theory 18(1), 159–185 (2001)
  23. Economic Theory 42(1), 119–156 (2010)
  24. Journal of Economic Theory 118, 32–60 (2004)
  25. Economic Theory 27(3), 493–512 (2006)
  26. Mathematical Programming 133(1-2), 171–201 (2012)
  27. SIAM Journal on Optimization 30(3), 2103–2133 (2020)
  28. SIAM Journal on Matrix Analysis and Applications 44(2), 530–558 (2023)
  29. Mathematics of Operations Research 44(1), 236–263 (2019)
  30. IEEE Transactions on Automatic Control 53(6), 1462–1475 (2008)
  31. Numerical Algorithms 89(1), 167–194 (2022)
  32. Quantitative Economics 3(2), 289–331 (2012)
  33. SIAM Journal on Numerical Analysis 13(4), 473–483 (1976)
  34. SIAM Journal on Optimization 12(2), 479–502 (2002)
  35. Computational Economics 15(1-2), 145–172 (2000)
  36. Journal of Scientific Computing 95(1), 13 (2023)
  37. Journal of Optimization Theory and Applications 186(2), 667–687 (2020)
  38. MERRILL, O.H.: Applications and extensions of an algorithm that computes fixed points ofcertain upper semi-continuous point to set mappings. Ph.D. thesis, University of Michigan (1972)
  39. Mathematical Programming pp. 1–75 (2023)
  40. SIAM Journal on Optimization 19(4), 1574–1609 (2009)
  41. Pflug, G.C.: Optimization of Stochastic Models. Springer US (1996)
  42. Mathematical Programming 174(1-2), 453–471 (2019)
  43. Springer Science & Business Media (2009)
  44. Scarf, H.: The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics 15(5), 1328–1343 (1967)
  45. Schmedders, K.: Computing equilibria in the general equilibrium model with incomplete asset markets. Journal of Economic Dynamics and Control 22(8-9), 1375–1401 (1998)
  46. Mathematical Programming 81(3), 301–325 (1998)
  47. SIAM Journal on Optimization 11(1), 70–86 (2000)
  48. Todd, M.J.: The computation of fixed points and applications. Lecture Notes in Economics and Mathematical Systems, Springer, Berlin 124 (1976)
  49. Mathematics of operations research 19(2), 341–351 (1994)
  50. SIAM Journal on Scientific Computing 42(1), A395–A423 (2020)
  51. Mathematical Programming 190(1-2), 585–613 (2021)
  52. Computational Optimization and Applications 76, 571–588 (2020)
  53. Automatica 148, 110798 (2023)
  54. Journal of Global Optimization 58(1), 151–168 (2014)

Summary

We haven't generated a summary for this paper yet.