Pages that link to "Item:Q959964"

The following pages link to Variable-number sample-path optimization (Q959964):

Displaying 14 items.

• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• Sample size selection in optimization methods for machine learning (Q715253) (← links)
• Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
• Variable sample size method for equality constrained optimization problems (Q1749777) (← links)
• Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization (Q1926785) (← links)
• Iteratively sampling scheme for stochastic optimization with variable number sample path (Q2157906) (← links)
• Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
• Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation (Q2290926) (← links)
• Nonmonotone line search methods with variable sample size (Q2340358) (← links)
• Optimization with hidden constraints and embedded Monte Carlo computations (Q2357974) (← links)
• On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
• A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization (Q5076721) (← links)
• Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization (Q5137952) (← links)
• Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)