SEQUENTIAL QUADRATIC OPTIMIZATION FOR NONLINEAR EQUALITY CONSTRAINED STOCHASTIC OPTIMIZATION

Sequential quadratic optimization algorithms are proposed for solving smooth nonlinear optimization problems with equality constraints. The main focus is an algorithm proposed for the case when the constraint functions are deterministic, and constraint function and derivative values can be computed explicitly, but the objective function is stochastic. It is assumed in this setting that it is intractable to compute objective function and derivative values explicitly, although one can compute stochastic function and gradient estimates. As a starting point for this stochastic setting, an algorithm is proposed for the deterministic setting that is modeled after a state-of-theart line-search SQP algorithm but uses a stepsize selection scheme based on Lipschitz constants (or adaptively estimated Lipschitz constants) in place of the line search. This sets the stage for the proposed algorithm for the stochastic setting, for which it is assumed that line searches would be intractable. Under reasonable assumptions, convergence (resp., convergence in expectation) from remote starting points is proved for the proposed deterministic (resp., stochastic) algorithm. The results of numerical experiments demonstrate the practical performance of our proposed techniques.

Automated summary

Sequential quadratic optimization algorithms are proposed to solve smooth nonlinear optimization problems with equality constraints, especially focusing on cases where constraint functions are deterministic. The algorithm uses a stepsize selection scheme based on Lipschitz constants for deterministic settings.