On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
From MaRDI portal
Publication:4016713
DOI10.1287/moor.17.1.112zbMath0764.90078OpenAlexW2082155171MaRDI QIDQ4016713
Publication date: 16 January 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.17.1.112
epi-convergencenondifferentiable optimizationconvergence of algorithmsmonotonic descent\(\partial\)-compatibility
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Finite master programs in regularized stochastic decomposition, Epigraphical nesting: A unifying theory for the convergence of algorithms, The approximation of separable stochastic programs, Statistical approximations for recourse constrained stochastic programs, Duality and statistical tests of optimality for two stage stochastic programs, An SQP-type method and its application in stochastic programs, Confidence level solutions for stochastic programming, Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming, Convergence of general iteration schemes, Near optimal solutions to least-squares problems with stochastic uncertainty, Unnamed Item, Enhancements of two-stage stochastic decomposition, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Inexact subgradient methods with applications in stochastic programming, Asymptotic behavior of solutions: an application to stochastic NLP