activity
20162023
most citedAEGCN: An Autoencoder-Constrained Graph Convolutional Network

41 citations · 80 across the 19 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2023

Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching

Ilgee Hong, Sen Na, Michael W. Mahoney +1

We consider solving equality-constrained nonlinear, nonconvex optimization problems. This class of problems appears widely in a variety of applications in machine learning and engi…

math.OC2022

Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems

Yuchen Fang, Sen Na, Michael W. Mahoney +1

We propose a trust-region stochastic sequential quadratic programming algorithm (TR-StoSQP) to solve nonlinear optimization problems with stochastic objectives and deterministic eq…

math.OC2022

Near-Optimal Performance of Stochastic Model Predictive Control

Sungho Shin, Sen Na, Mihai Anitescu

This article presents a dynamic regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative un…

math.OC2022★ 1 cited

Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming

Sen Na, Michael W. Mahoney

We consider online statistical inference of constrained stochastic nonlinear optimization problems. We apply the Stochastic Sequential Quadratic Programming (StoSQP) method to solv…

math.OC2022

Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence

Sen Na, Michał Dereziński, Michael W. Mahoney

We consider minimizing a smooth and strongly convex objective function using a stochastic Newton method. At each iteration, the algorithm is given an oracle access to a stochastic…

math.OC2021★ 2 cited

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

Sen Na, Mihai Anitescu, Mladen Kolar

We study nonlinear optimization problems with a stochastic objective and deterministic equality and inequality constraints, which emerge in numerous applications including finance,…

math.OC2021★ 1 cited

A Fast Temporal Decomposition Procedure for Long-horizon Nonlinear Dynamic Programming

Sen Na, Mihai Anitescu, Mladen Kolar

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that uti…

math.OC2021

An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians

Sen Na, Mihai Anitescu, Mladen Kolar

We consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, a…

math.OC2020★ 1 cited

Convergence Analysis of Accelerated Stochastic Gradient Descent under the Growth Condition

You-Lin Chen, Sen Na, Mladen Kolar

We study the convergence of accelerated stochastic gradient descent for strongly convex objectives under the growth condition, which states that the variance of stochastic gradient…

math.OC2020★ 2 cited

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Sen Na, Sungho Shin, Mihai Anitescu +1

We study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domai…

math.OC2020★ 1 cited

Superconvergence of Online Optimization for Model Predictive Control

Sen Na, Mihai Anitescu

We develop a one-Newton-step-per-horizon, online, lag-, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Bas…