Pith. sign in

REVIEW 1 cited by

Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.11502 v3 pith:2KB6KTFN submitted 2021-09-23 math.OC cs.LGcs.NAmath.NAstat.ML

Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming

classification math.OC cs.LGcs.NAmath.NAstat.ML
keywords algorithmnonlinearstochasticinequalityproblemsactive-setaugmentedcondition
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stochastic Penalty-Barrier Methods for Constrained Machine Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    SPBM extends classical penalty-barrier methods to stochastic non-convex non-smooth settings via exponential dual averaging and Moreau envelopes, matching baselines with linear overhead up to 10,000 constraints.