Newton's method for quadratic stochastic programs with recourse (Q1900750): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 14:58, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Newton's method for quadratic stochastic programs with recourse |
scientific article |
Statements
Newton's method for quadratic stochastic programs with recourse (English)
0 references
1995
0 references
A Newton-like method is used to solve a system of nonsmooth equations obtained from the Kuhn-Tucker conditions for the nonlinear convex programming problem which approximate a two-stage quadratic stochastic program with fixed recourse. It is proved that the proposed method realizes global convergence and superlinear local convergence, and is more general than previous methods which were developed for box-diagonal and fully quadratic stochastic programs. Finally, numerical results obtained both with the proposed algorithm for different starting points and with the variants of the algorithm that use Monte Carlo rules and lattice rules for numerical integration are given.
0 references
Newton's method
0 references
nonsmooth equations
0 references
nonlinear convex programming
0 references
quadratic stochastic program
0 references
global convergence
0 references
superlinear local convergence
0 references
numerical results
0 references
Monte Carlo rules
0 references
lattice rules
0 references