Recent

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
Reliable decision-making with streaming data requires principled uncertainty quantification of online methods. While first-order …
Cite arXiv
Derivative-Free Sequential Quadratic Programming for Equality-Constrained Stochastic Optimization
We consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints, assuming that …
Cite DOI arXiv
High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise
In this paper, we consider nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We …
Cite DOI arXiv
Online Covariance Matrix Estimation in Sketched Newton Methods
Given the ubiquity of streaming data, online algorithms have been widely used for parameter estimation, with second-order methods …
Cite DOI arXiv
Near-Optimal Performance of Stochastic Model Predictive Control
This article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance …
Cite DOI arXiv
Online Covariance Estimation in Nonsmooth Stochastic Approximation
We consider applying stochastic approximation (SA) methods to solve nonsmooth variational inclusion problems. Existing studies have …
Cite arXiv
Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming
We consider online statistical inference of constrained stochastic nonlinear optimization problems. We apply the Stochastic Sequential …
Cite URL arXiv
Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems
We propose a trust-region stochastic sequential quadratic programming algorithm (TR-StoSQP) to solve nonlinear optimization problems …
Cite DOI arXiv
Convergence Analysis of Accelerated Stochastic Gradient Descent under the Growth Condition
We study the convergence of accelerated stochastic gradient descent for strongly convex objectives under the growth condition, which …
Cite DOI arXiv
A Fast Temporal Decomposition Procedure for Long-horizon Nonlinear Dynamic Programming
We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is …
Cite DOI arXiv