A Sequential Cubic Programming Method with Second-Order Complexity Guarantees for Equality Constrained Optimization
math.OC
Submitted: 2026-04-03
Updated: 2026-11-11
Terminology
Sources
- Analysis of Sequential Quadratic Programming through the Lens of Riemannian Optimization
- Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
- High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise
- Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise