English
Related papers

Related papers: Optimal Triangulation of Saddle Surfaces

200 papers

The saddlepoint approximation gives an approximation to the density of a random variable in terms of its moment generating function. When the underlying random variable is itself the sum of $n$ unobserved i.i.d. terms, the basic classical…

Statistics Theory · Mathematics 2022-01-25 Jesse Goodman

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Optimization and Control · Mathematics 2014-01-13 Bogdan Dumitrescu , Bogdan C. Sicleru , Florin Avram

This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…

Numerical Analysis · Mathematics 2019-10-18 Juan Pablo Borthagaray , Wenbo Li , Ricardo H. Nochetto

In this paper a fourth order asymptotically optimal error bound for a new cubic interpolating spline function, denoted by Q-spline, is derived for the case that only function values at given points are used but not any derivative…

Numerical Analysis · Mathematics 2025-07-08 Florian Jarre

Results on two different settings of asymptotic behavior of approximation characteristics of individual functions are presented. First, we discuss the following classical question for sparse approximation. Is it true that for any individual…

Numerical Analysis · Mathematics 2019-11-11 L. Burusheva , V. Temlyakov

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

Numerical Analysis · Mathematics 2015-12-22 John C. Urschel , Ludmil T. Zikatanov

The success of deep neural networks hinges on our ability to accurately and efficiently optimize high-dimensional, non-convex functions. In this paper, we empirically investigate the loss functions of state-of-the-art networks, and how…

Machine Learning · Computer Science 2017-12-11 Daniel Jiwoong Im , Michael Tao , Kristin Branson

For a translation surface, we define the systole to be the length of the shortest saddle connection. We give a characterization of the maxima of the systole function on a stratum, and give a family of examples providing local but nonglobal…

Metric Geometry · Mathematics 2022-03-30 Corentin Boissy , Slavyana Geninska

This is a continuation of our previous work entitled \enquote{Alternating Proximity Mapping Method for Convex-Concave Saddle-Point Problems}, in which we proposed the alternating proximal mapping method and showed convergence results on the…

Optimization and Control · Mathematics 2023-11-01 Hui Ouyang

We consider the proximal-gradient method for minimizing an objective function that is the sum of a smooth function and a non-smooth convex function. A feature that distinguishes our work from most in the literature is that we assume that…

Optimization and Control · Mathematics 2022-11-07 Yutong Dai , Daniel P. Robinson

In [Kopteva, Math. Comp., 2014] a counterexample of an anisotropic triangulation was given on which the exact solution has a second-order error of linear interpolation, while the computed solution obtained using linear finite elements is…

Numerical Analysis · Mathematics 2019-05-22 Natalia Kopteva

We study the recovery of functions in various norms, including $L_p$ with $1\le p\le\infty$, based on function evaluations. We obtain worst case error bounds for general classes of functions in terms of the best $L_2$-approximation from a…

Numerical Analysis · Mathematics 2025-12-23 David Krieg , Kateryna Pozharska , Mario Ullrich , Tino Ullrich

We deal with a problem of the reconstruction of any holomorphic function $f$ on the unit ball of $\mathbb{C}^2$ from its restricions on a union of complex lines. We give an explicit formula of Lagrange interpolation's type that is…

Complex Variables · Mathematics 2008-03-31 Amadeo Irigoyen

We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to first-order methods, our understanding of second-order…

Optimization and Control · Mathematics 2026-05-27 Tianyi Lin , Panayotis Mertikopoulos , Michael I. Jordan

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

Numerical Analysis · Mathematics 2020-09-28 Andrea Bressan , Michael S. Floater , Espen Sande

This paper studies the approximation of generalized ridge functions, namely of functions which are constant along some submanifolds of $\mathbb{R}^N$. We introduce the notion of linear-sleeve functions, whose function values only depend on…

Numerical Analysis · Mathematics 2017-01-26 Sandra Keiper

We propose an $L_{2}$-based penalization algorithm for functional linear regression models, where the coefficient function is shrunk towards a data-driven shape template $\gamma$, which is constrained to belong to a class of piecewise…

Methodology · Statistics 2020-11-03 Edoardo Belli , Simone Vantini

We give a characterization of completely regular topological spaces. Applying some recent results for supinf problems in completely regular topological spaces we establish a variational principle for saddle points. Well-posedness of saddle…

Optimization and Control · Mathematics 2024-08-05 D. Kamburova , R. Marinov , N. Zlateva

We develop a finite element method for the Laplace-Beltrami operator on a surface with boundary and nonhomogeneous Dirichlet boundary conditions. The method is based on a triangulation of the surface and the boundary conditions are enforced…

Numerical Analysis · Mathematics 2019-02-05 E. Burman , P. Hansbo , M. G. Larson , K. Larsson , A. Massing

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

Geometric Topology · Mathematics 2019-07-16 Mikhail Skopenkov