Cover Image

High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fang, Yuchen, Lavaei, Javad, Na, Sen
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Computational Complexity Machine Learning Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method
by: Fang, Yuchen, et al.
Published: (2026)

Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise
by: Fang, Yuchen, et al.
Published: (2026)

Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models
by: Fang, Yuchen, et al.
Published: (2024)

Derivative-Free Sequential Quadratic Programming for Equality-Constrained Stochastic Optimization
by: Na, Sen
Published: (2025)

Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems
by: Fang, Yuchen, et al.
Published: (2022)

TRSVR: An Adaptive Stochastic Trust-Region Method with Variance Reduction
by: Fang, Yuchen, et al.
Published: (2026)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
by: Liu, Wei, et al.
Published: (2025)

On Approximate Computation of Critical Points
by: Ahmadi, Amir Ali, et al.
Published: (2026)

All-Pass Fractional OPF: A Solver-Friendly, Physics-Preserving Approximation of AC OPF
by: Hasanzadeh, Milad, et al.
Published: (2026)

Backtracking New Q-Newton's method, Newton's flow, Voronoi's diagram and Stochastic root finding
by: Fornaess, John Erik, et al.
Published: (2024)

Physics-Informed Neural Networks with Trust-Region Sequential Quadratic Programming
by: Cheng, Xiaoran, et al.
Published: (2024)

Complexity of Zeroth- and First-order Stochastic Trust-Region Algorithms
by: Ha, Yunsoo, et al.
Published: (2024)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2021)

Differentiable Singular Value Decomposition
by: Kanchi, Rohit, et al.
Published: (2025)

Optimal Contract Design for End-of-Life Care Payments
by: Jiang, Muyan, et al.
Published: (2024)

OptEMA: Adaptive Exponential Moving Average for Stochastic Optimization with Zero-Noise Optimality
by: Yuan, Ganzhao
Published: (2026)

Subgradient Method for System Identification with Non-Smooth Objectives
by: Yalcin, Baturalp, et al.
Published: (2025)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
by: Berahas, Albert S., et al.
Published: (2023)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
by: Doğan, M. Levent, et al.
Published: (2025)

Online Covariance Matrix Estimation in Sketched Newton Methods
by: Kuang, Wei, et al.
Published: (2025)

Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling
by: Du, Xinchen, et al.
Published: (2025)

Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming
by: Na, Sen, et al.
Published: (2022)

A direct optimization algorithm for input-constrained MPC
by: Wu, Liang, et al.
Published: (2023)

The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)

High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise
by: Parletta, Daniela A., et al.
Published: (2022)

Nonlinear Assimilation via Score-based Sequential Langevin Sampling
by: Ding, Zhao, et al.
Published: (2024)

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2023)

Stochastic Langevin Differential Inclusions with Applications to Machine Learning
by: Difonzo, Fabio V., et al.
Published: (2022)

Backtracking New Q-Newton's method for finding roots of meromorphic functions in 1 complex variable: Global convergence, and local stable/unstable curves
by: Fornæss, John Erik, et al.
Published: (2024)

Using Linearized Optimal Transport to Predict the Evolution of Stochastic Particle Systems
by: Karris, Nicholas, et al.
Published: (2024)

Accuracy of Discretely Sampled Stochastic Policies in Continuous-time Reinforcement Learning
by: Jia, Yanwei, et al.
Published: (2025)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
by: Yuan, Ganzhao
Published: (2026)

UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization
by: Jiang, Yiming, et al.
Published: (2023)

Discrete Variable Topology Optimization Using Multi-Cut Formulation and Adaptive Trust Regions
by: Ye, Zisheng, et al.
Published: (2024)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Stochastic Optimal Control Matching
by: Domingo-Enrich, Carles, et al.
Published: (2023)

Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent
by: Riedl, Konstantin, et al.
Published: (2023)

Overlapping Schwarz Scheme for Linear-Quadratic Programs in Continuous Time
by: Zhao, Hongli, et al.
Published: (2025)

Maximum Principle of Optimal Probability Density Control
by: Gaby, Nathan, et al.
Published: (2025)

Generalization Bounds for Sparse Random Feature Expansions
by: Hashemi, Abolfazl, et al.
Published: (2021)