English
Related papers

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

200 papers

We develop a stochastic integration theory for predictable integrands with respect to a L\'evy basis. Our approach is based on decoupling inequalities for tangent sequences and reduces the construction of the stochastic integral essentially…

Probability · Mathematics 2026-05-18 Markus Riedle

We consider minimizing a function consisting of a quadratic term and a proximable term which is possibly nonconvex and nonsmooth. This problem is also known as scaled proximal operator. Despite its simple form, existing methods suffer from…

Optimization and Control · Mathematics 2024-03-01 Yiming Zhou , Wei Dai

In this paper we investigate the well-posedness of the Cauchy problem for a Schr\"odinger operator with singular lower order terms. We allow distributional coefficients and we approach this problem via the regularising methods at the core…

Analysis of PDEs · Mathematics 2024-02-13 Alexandre Arias Junior , Alessia Ascanelli , Marco Cappiello , Claudia Garetto

Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist addressing the…

Optimization and Control · Mathematics 2024-06-18 Zakhar Shumaylov , Jeremy Budd , Subhadip Mukherjee , Carola-Bibiane Schönlieb

We study the approximation of compact linear operators defined over certain weighted tensor product Hilbert spaces. The information complexity is defined as the minimal number of arbitrary linear functionals which is needed to obtain an…

Numerical Analysis · Mathematics 2020-02-03 Peter Kritzer , Friedrich Pillichshammer , Henryk Woźniakowski

We introduce a particular optimization problem that minimizes the sum of a non-convex quadratic function and logarithmic barrier-functions in a $\ell_\infty$-trust-region (i.e. cube). Our paper covers three topics. We explain the relevance…

Numerical Analysis · Mathematics 2018-06-20 Martin Neuenhofen

Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…

Optimization and Control · Mathematics 2026-02-05 Feng-Yi Liao , Lijun Ding , Yang Zheng

This paper concerns the minimization of the composition of a nonsmooth convex function and a $\mathcal{C}^{1,1}$ mapping $F$ over a $\mathcal{C}^2$-smooth embedded closed submanifold $\mathcal{M}$. For this class of nonconvex and nonsmooth…

Optimization and Control · Mathematics 2026-05-12 Hao He , Ruyu Liu , Yitian Qian , Shaohua Pan

We propose a nonsmooth trust-region method for solving optimization problems with locally Lipschitz continuous functions, with application to problems constrained by variational inequalities of the second kind. Under suitable assumptions on…

Optimization and Control · Mathematics 2018-01-17 Constantin Christof , Juan Carlos De Los Reyes , Christian Meyer

This is the first part of a two-part paper describing a new concept of separation of variables applied to the Clebsch integrable case of the Kirchhoff equations. There are two principal novelties: 1) Separating coordinates are constructed…

Exactly Solvable and Integrable Systems · Physics 2021-02-09 Yu. Fedorov , F. Magri , T. Skrypnyk

An algorithm is proposed, analyzed, and tested experimentally for solving stochastic optimization problems in which the decision variables are constrained to satisfy equations defined by deterministic, smooth, and nonlinear functions. It is…

Optimization and Control · Mathematics 2021-07-09 Frank E. Curtis , Daniel P. Robinson , Baoyu Zhou

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

cmp-lg · Computer Science 2008-02-03 Martin Mueller , Joachim Niehren

In machine learning it is common to interpret each data point as a vector in Euclidean space. However the data may actually be functional i.e.\ each data point is a function of some variable such as time and the function is discretely…

Computer Vision and Pattern Recognition · Computer Science 2017-04-14 Stephen Tierney , Junbin Gao , Yi Guo , Zheng Zhang

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…

Artificial Intelligence · Computer Science 2013-07-19 Gianluigi Greco , Francesco Scarcello

We derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrix-valued uncertain parameters. We do this for a broad range of uncertainty sets. In…

Optimization and Control · Mathematics 2022-04-07 Ahmadreza Marandi , Aharon Ben-Tal , Dick den Hertog , Bertrand Melenberg

We establish a new family of Carleman inequalities for wave operators on cylindrical spacetime domains containing a potential that is critically singular, diverging as an inverse square on all the boundary of the domain. These estimates are…

Analysis of PDEs · Mathematics 2020-03-31 Alberto Enciso , Arick Shao , Bruno Vergara

In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing and machine learning research. The traditional alternating direction method of multipliers encounters troubles in both…

Numerical Analysis · Computer Science 2018-10-17 Tao Sun , Hao Jiang , Lizhi Cheng , Wei Zhu

This note is concerned with the problem of minimizing a separable, convex, composite (smooth and nonsmooth) function subject to linear constraints. We study a randomized block-coordinate interpretation of the Chambolle-Pock primal-dual…

Optimization and Control · Mathematics 2024-08-30 Olivier Bilenne

We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…

Computational Complexity · Computer Science 2024-10-22 Dmitriy Zhuk

We consider analytically weak solutions to semilinear stochastic partial differential equations with non-anticipating coefficients driven by cylindrical Brownian motion. The solutions are allowed to take values in general separable Banach…

Probability · Mathematics 2021-03-17 David Criens , Moritz Ritter