Related papers: Spectral deferred correction methods for second-or…
We consider a class of two-stage nonconvex nonsmooth stochastic conic program, where the objective functions in both stages can contain nonsmooth terms that are functions with easily computed proximal mappings, further composed with affine…
We present a parametric family of semi-implicit second order accurate numerical methods for non-conservative and conservative advection equation for which the numerical solutions can be obtained in a fixed number of forward and backward…
Stochastic dynamical systems with continuous symmetries arise commonly in nature and often give rise to coherent spatio-temporal patterns. However, because of their random locations, these patterns are not well captured by current order…
In this paper, we investigate a general class of stochastic gradient descent (SGD) algorithms, called Conditioned SGD, based on a preconditioning of the gradient direction. Using a discrete-time approach with martingale tools, we establish…
Virtual Decomposition Control (VDC) has emerged as a powerful modular framework for real-world robotic control, particularly in contact-rich tasks. Despite its widespread use, VDC has been fundamentally limited to first-order impedance…
We consider coordinate descent methods on convex quadratic problems, in which exact line searches are performed at each iteration. (This algorithm is identical to Gauss-Seidel on the equivalent symmetric positive definite linear system.) We…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors. The problem structure allows us to reformulate it as a convex-concave saddle point problem. We propose a…
The inverse scattering approach for the defocusing Davey-Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We…
On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods. These results are all about upper complexity bounds, which can determine at most how many…
We suppose the existence of an oracle which solves any semidefinite programming (SDP) problem satisfying Slater's condition simultaneously at its primal and dual sides. We note that such an oracle might not be able to directly solve general…
We analyze the inverse problem to reconstruct the shape of a three dimensional homogeneous dielectric obstacle from the knowledge of noisy far field data. The forward problem is solved by a system of second kind boundary integral equations.…
We investigate and derive second solutions to linear homogeneous second-order difference equations using a variety of methods, in each case going beyond the purely formal solution and giving explicit expressions for the second solution. We…
Partial differential equations (PDE) often involve parameters, such as viscosity or density. An analysis of the PDE may involve considering a large range of parameter values, as occurs in uncertainty quantification, control and…
This article is the third in a series the aim of which is to use Lie group theory to obtain exact analytic solutions of Delay Ordinary Differential Systems (DODSs). Such a system consists of two equations involving one independent variable…
We present a novel, practical, and provable approach for solving diagonally constrained semi-definite programming (SDP) problems at scale using accelerated non-convex programming. Our algorithm non-trivially combines acceleration motions…
Explicit stabilized methods are highly efficient time integrators for large and stiff systems of ordinary differential equations especially when applied to semi-discrete parabolic problems. However, when local spatial mesh refinement is…
To broaden the range of applicability of variable-order fractional differential models, reliable numerical approaches are needed to solve the model equation. In this paper, we develop Laguerre spectral collocation methods for solving…
Improved local numerical solution for the ADER-DG numerical method with a local DG predictor for solving the initial value problem for a first-order ODE system is proposed. The improved local numerical solution demonstrates convergence…
By extending the classical analysis techniques due to Samokish, Faddeev and Faddeeva, and Longsine and McCormick among others, we prove the convergence of preconditioned steepest descent with implicit deflation (PSD-id) method for solving…