A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization
type: Item
instance of: scholarly article
title: A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization
author: Albert S. Berahas
author: Miaolan Xie
author: Baoyu Zhou
published in: SIAM Journal on Optimization
publication date: 2025-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49Mxx
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 7967000
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: constrained stochastic optimization
zbMATH Keywords: sequential quadratic optimization
zbMATH Keywords: step search
zbMATH Keywords: probabilistic oracles
MaRDI profile type: MaRDI publication profile
cites work: Convergence of Trust-Region Methods Based on Probabilistic Models
cites work: Linesearch Newton-CG methods for convex optimization with noise
cites work: Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
cites work: Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
cites work: Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization
cites work: Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction
cites work: Q4225395
cites work: An Inexact SQP Method for Equality Constrained Optimization
cites work: First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
cites work: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
cites work: Stochastic optimization using a trust-region method and random models
cites work: Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: Direct Search Based on Probabilistic Descent
cites work: Complexity and global rates of trust-region methods based on probabilistic models
cites work: Q3997500
cites work: High probability complexity bounds for adaptive step search based on stochastic oracles
cites work: First-order and stochastic optimization methods for machine learning
cites work: Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians
cites work: Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
cites work: Q5491447
cites work: Constrained Optimization in the Presence of Noise
cites work: A Stochastic Line Search Method with Expected Complexity Analysis
cites work: Optimal Solvers for PDE-Constrained Optimization
cites work: Direct Search Based on Probabilistic Descent in Reduced Spaces
cites work: Lectures on Stochastic Programming: Modeling and Theory, Third Edition
cites work: A trust region method for noisy unconstrained optimization
cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
DOI: 10.1137/23M1549006
description: scientific article; zbMATH DE number 7967000