Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization

07/20/2020
by   Albert Berahas, et al.
0

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-the-art 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2021

A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear Equality Constrained Optimization with Rank-Deficient Jacobians

A sequential quadratic optimization algorithm is proposed for solving sm...
research
02/10/2021

An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians

We consider the problem of solving nonlinear optimization programs with ...
research
03/31/2022

A simplified nonsmooth nonconvex bundle method with applications to security-constrained ACOPF problems

An optimization algorithm for a group of nonsmooth nonconvex problems in...
research
07/22/2020

Examples of pathological dynamics of the subgradient method for Lipschitz path-differentiable functions

We show that the vanishing stepsize subgradient method – widely adopted ...
research
11/08/2022

Quantization-Based Optimization: Alternative Stochastic Approximation of Global Optimization

In this study, we propose a global optimization algorithm based on quant...
research
03/23/2022

Spectral Projected Subgradient Method for Nonsmooth Convex Optimization Problems

We consider constrained optimization problems with a nonsmooth objective...

Please sign up or login with your details

Forgot password? Click here to reset