English
Related papers

Related papers: On Weak Tractability of the Clenshaw-Curtis Smolya…

200 papers

The \emph{deterministic} sparse grid method, also known as Smolyak's method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about…

Numerical Analysis · Mathematics 2022-02-11 Marcin Wnuk , Michael Gnewuch

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…

High Energy Physics - Theory · Physics 2015-06-16 Dmitri V. Fursaev , Alexander Patrushev , Sergey N. Solodukhin

We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly…

Machine Learning · Computer Science 2016-11-04 P Balamurugan , Francis Bach

The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or…

Computational Complexity · Computer Science 2014-01-24 Martin C. Cooper , Stanislav Živný

We propose, analyze, and implement a quadrature method for evaluating integrals of the form $\int_0^2 f(s)\exp(zs)\, {\rm d}s$, where $z$ is a complex number with a possibly large negative real part. The integrand may exhibit exponential…

Numerical Analysis · Mathematics 2026-02-10 Victor Dominguez

It is well-known that the problem of sampling recovery in the $L_2$-norm on unweighted Korobov spaces (Sobolev spaces with mixed smoothness) as well as classical smoothness classes such as H\"older classes suffers from the curse of…

Numerical Analysis · Mathematics 2024-02-26 David Krieg

We consider minimization of stochastic functionals that are compositions of a (potentially) non-smooth convex function $h$ and smooth function $c$ and, more generally, stochastic weakly-convex functionals. We develop a family of stochastic…

Optimization and Control · Mathematics 2018-09-25 John Duchi , Feng Ruan

We classify a family of matrices of shift operators that can be factorised in a computationally tractable manner with the Cholesky algorithm. Such matrices arise in the linear quadratic regulator problem, and related areas. We use the…

Optimization and Control · Mathematics 2026-02-04 Julia Adlercreutz , Richard Pates

We study d-variate approximation problems in the average case setting with respect to a zero-mean Gaussian measure. Our interest is focused on measures having a structure of non-homogeneous linear tensor product, where covariance kernel is…

Probability · Mathematics 2012-12-04 M. A. Lifshits , A. Papageorgiou , H. Woźniakowski

We study tractability properties of the weighted $L_p$-discrepancy. The concept of {\it weighted} discrepancy was introduced by Sloan and Wo\'{z}\-nia\-kowski in 1998 in order to prove a weighted version of the Koksma-Hlawka inequality for…

Numerical Analysis · Mathematics 2024-05-22 Erich Novak , Friedrich Pillichshammer

In this paper, we consider a class of nonconvex and nonsmooth fractional programming problems, that involve the sum of a convex, possibly nonsmooth function composed with a linear operator and a differentiable, possibly nonconvex function…

Optimization and Control · Mathematics 2025-03-18 Radu Ioan Boţ , Guoyin Li , Min Tao

We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained…

Optimization and Control · Mathematics 2014-06-04 Radu Ioan Bot , Ernö Robert Csetnek

We present the first numerical approach to D-bar problems having spectral convergence for real analytic rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation which is…

Numerical Analysis · Mathematics 2015-08-11 C. Klein , K. McLaughlin

Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as…

Optimization and Control · Mathematics 2026-05-14 Léo Portales , Elsa Cazelles , Edouard Pauwels

In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm for approximating the value of a discrete and continuous time optimal stopping problem. We prove that in the discrete case the WSM algorithm leads to semi-tractability of…

Computational Finance · Quantitative Finance 2019-06-25 D. Belomestny , M. Kaledin , J. Schoenmakers

In this paper, we focus on the problem of minimizing the sum of a nonconvex differentiable function and a DC (Difference of Convex functions) function, where the differentiable function is not restricted to the global Lipschitz gradient…

Optimization and Control · Mathematics 2021-06-10 Duy Nhat Phan , Hoai An Le Thi

We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…

Numerical Analysis · Mathematics 2022-06-28 Hadrien Montanelli , Matthieu Aussal , Houssem Haddar

In this note we study multivariate integration for permutation-invariant functions from a certain Banach space E_{d,\alpha} of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in…

Numerical Analysis · Mathematics 2013-10-16 Markus Weimar

We show a Dvoretsky-Rogers type Theorem for the adapted version of the $q$-summing operators to the topology of the convergence of the vector valued integrals on Banach function spaces. In the pursuit of this objective we prove that the…

Functional Analysis · Mathematics 2015-07-14 P. Rueda , E. A. Sanchez-Perez

In this paper, we study stochastic constrained minimax optimization problems with nonconvex-nonconcave structure, a central problem in modern machine learning, for which reliable and efficient algorithms remain largely unexplored due to its…

Optimization and Control · Mathematics 2026-02-25 Muhammad Khan , Yangyang Xu