activity
20182021
most citedStochastic Subspace Descent

8 citations · 8 across the 1 of their papers we have counts for

collaborators

5 papers

math.OC2021

Zeroth order optimization with orthogonal random directions

David Kozak, Cesare Molinari, Lorenzo Rosasco +2

We propose and analyze a randomized zeroth-order approach based on approximating the exact gradient byfinite differences computed in a set of orthogonal random directions that chan…

math.OC2020

A stochastic subspace approach to gradient-free optimization in high dimensions

David Kozak, Stephen Becker, Alireza Doostan +1

We present a stochastic descent algorithm for unconstrained optimization that is particularly efficient when the objective function is slow to evaluate and gradients are not easily…

math.OC2019★ 8 cited

Stochastic Subspace Descent

David Kozak, Stephen Becker, Alireza Doostan +1

We present two stochastic descent algorithms that apply to unconstrained optimization and are particularly efficient when the objective function is slow to evaluate and gradients a…

math.NA2018

Sampled Tikhonov Regularization for Large Linear Inverse Problems

J. Tanner Slagel, Julianne Chung, Matthias Chung +2

In this paper, we investigate iterative methods that are based on sampling of the data for computing Tikhonov-regularized solutions. We focus on very large inverse problems where a…

stat.CO2018

A Nonstationary Designer Space-Time Kernel

Michael McCourt, Gregory Fasshauer, David Kozak

In spatial statistics, kriging models are often designed using a stationary covariance structure; this translation-invariance produces models which have numerous favorable properti…