Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming
We study nonlinear optimization problems with a stochastic objective and deterministic equality and inequality constraints, which emerge in numerous applications including finance, manufacturing, power systems and, recently, deep neural networks. We propose an active-set stochastic sequential quadratic programming (StoSQP) algorithm that utilizes a differentiable exact augmented Lagrangian as the merit function. The algorithm adaptively selects the penalty parameters of the augmented Lagrangian and performs a stochastic line search to decide the stepsize. The global convergence is established: for any initialization, the KKT residuals converge to zero almost surely. Our algorithm and analysis further develop the prior work of Na et al., (2022). Specifically, we allow nonlinear inequality constraints without requiring the strict complementary condition; refine some of the designs in Na et al., (2022) such as the feasibility error condition and the monotonically increasing sample size; strengthen the global convergence guarantee; and improve the sample complexity on the objective Hessian. We demonstrate the performance of the designed algorithm on a subset of nonlinear problems collected in CUTEst test set and on constrained logistic regression problems.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
CMC-Opt: Constraint Manifold with Corners for Inequality-Constrained Optimization
We introduce a manifold-based framework for addressing optimization problems with equality and inequality constraints found in robotics. Our approach transforms the original problem into an unconstrained optimization pro…
Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming
We study online statistical inference for the solutions of stochastic optimization problems with equality and inequality constraints. Such problems are prevalent in statistics and machine learning, encompassing constrain…
Stochastic OptimizationReinforcement LearningStochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
We propose smoothed primal-dual algorithms for solving stochastic and smooth nonconvex optimization problems with linear inequality constraints. Our algorithms are single-loop and only require a single stochastic gradien…
Chance Constrained Stochastic Optimal Control for Arbitrarily Disturbed LTI Systems Via the One-Sided Vysochanskij-Petunin Inequality
While many techniques have been developed for chance constrained stochastic optimal control with Gaussian disturbance processes, far less is known about computationally efficient methods to handle non-Gaussian processes.…
Collision AvoidanceGaussian ProcessesA Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
A step-search sequential quadratic programming method is proposed for solving nonlinear equality constrained stochastic optimization problems. It is assumed that constraint function values and derivatives are available, …
Stochastic Optimization