Related papers: Optimal quantitative weak approximation for projec…

Based on a quantitative version of the inverse function theorem and an appropriate saddle-point formulation we derive a quasi-optimal error estimate for the finite element approximation of harmonic maps into spheres with a nodal…

We study convex empirical risk minimization for high-dimensional inference in binary models. Our first result sharply predicts the statistical performance of such estimators in the linear asymptotic regime under isotropic Gaussian features.…

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

We prove an upper bound for the number of rational points of bounded height in a weighted projective stack which lie in a given thin subset. As a consequence, we show that $100\%$ of hyperelliptic curves do not admit a prescribed on-trivial…

Let $n>m>k$ be positive integers and let $a,b,c$ be nonzero rational numbers. We consider the reducibility of some special quadrinomials $x^n+ax^m+bx^k+c$ with $n=4$ and 5, which related to the study of rational points on certain elliptic…

We consider minimization of indefinite quadratics with either trust-region (norm) constraints or cubic regularization. Despite the nonconvexity of these problems we prove that, under mild assumptions, gradient descent converges to their…

Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…

We study quadratic optimization with indicator variables and an M-matrix, i.e., a PSD matrix with non-positive off-diagonal entries, which arises directly in image segmentation and portfolio optimization with transaction costs, as well as a…

We develop a heuristic for the density of integer points on affine cubic surfaces. Our heuristic applies to smooth surfaces defined by cubic polynomials that are log K3, but it can also be adjusted to handle singular cubic surfaces. We…

Given an $n$-sample drawn on a submanifold $M \subset \mathbb{R}^D$, we derive optimal rates for the estimation of tangent spaces $T\_X M$, the second fundamental form $II\_X^M$, and the submanifold $M$.After motivating their study, we…

We introduce a notion of quasilinear parabolic equations over metric measure spaces. Under sharp structural conditions, we prove that local weak solutions are locally bounded and satisfy the parabolic Harnack inequality. Applications…

We study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \geq 1$) of a point $x$ onto a set $A$ consists of points in $A$ the…

We consider control-constrained linear-quadratic optimal control problems on evolving surfaces. In order to formulate well-posed problems, we prove existence and uniqueness of weak solutions for the state equation, in the sense of…

We present an explicit formula for the orthogonal projection onto the subspace of analytic polynomials of degree at most $n$ in the local Dirichlet space $D_\mu$ , where the positive measure $\mu$ consists of a finite number of Dirac…

We establish a gradient estimate for a very weak solution to a quasilinear elliptic equation with a nonstandard growth condition, which is a natural generalization of the $p$-Laplace equation. We investigate the maximum extent for the…

For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original non-convex feasible…

Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…

Given a variety over a number field, are its rational points potentially dense, i.e., does there exist a finite extension over which rational points are Zariski dense? We study the question of potential density for symmetric products of…

We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algorithm with multi-stage convex relaxation based on the…

This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…