English
Related papers

Related papers: Convergence to minima for the continuous version o…

200 papers

We study the minimization of a convex function $f(X)$ over the set of $n\times n$ positive semi-definite matrices, but when the problem is recast as $\min_U g(U) := f(UU^\top)$, with $U \in \mathbb{R}^{n \times r}$ and $r \leq n$. We study…

Machine Learning · Statistics 2016-04-19 Srinadh Bhojanapalli , Anastasios Kyrillidis , Sujay Sanghavi

We propose a descent subgradient algorithm for minimizing a real function, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Goldstein subdifferential is approximated through…

Optimization and Control · Mathematics 2023-04-11 Morteza Maleknia , Majid Soleimani-damaneh

It was previously shown by Davis and Drusvyatskiy that every Clarke critical point of a generic, semialgebraic (and more generally definable in an o-minimal structure), weakly convex function is lying on an active manifold and is either a…

Optimization and Control · Mathematics 2022-02-14 Sholom Schechtman

In this paper some adaptive mirror descent algorithms for problems of minimization convex objective functional with several convex Lipschitz (generally, non-smooth) functional constraints are considered. It is shown that the methods are…

Optimization and Control · Mathematics 2018-12-20 F. S. Stonyakin , M . S. Alkousa , A. A. Titov

We develop a Levenberg-Marquardt method for minimizing the sum of a smooth nonlinear least-squar es term $f(x) = \tfrac{1}{2} \|F(x)\|_2^2$ and a nonsmooth term $h$. Both $f$ and $h$ may be nonconvex. Steps are computed by minimizing the…

Optimization and Control · Mathematics 2023-01-09 Aleksandr Y. Aravkin , Robert Baraldi , Dominique Orban

This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta\_{n+1} = \theta\_n + \gamma\_{n+1} H\_{\theta\_n}(X\_{n+1})$ where $\{\theta\_nn, n \geq 0\}$ is a $R^d$-valued sequence,…

Statistics Theory · Mathematics 2016-01-27 Gersende Fort , Eric Moulines , Amandine Schreck , Matti Vihola

To compute the spatially distributed dielectric constant from the backscattering data, we study a coefficient inverse problem for a 1D hyperbolic equation. To solve the inverse problem, we establish a new version of Carleman estimate and…

Numerical Analysis · Mathematics 2021-04-26 Michael V. Klibanov , Thuy T. Le , Loc H. Nguyen , Anders Sullivan , Lam Nguyen

For any $n\ge 2$, $\Omega\subset\rn$, and any given convex and coercive Hamiltonian function $H\in C^{0}(\rn)$, we find an optimal sufficient condition on $H$, that is, for any $c\in\mathbb R$, the level set $H^{-1}(c)$ does not contains…

Analysis of PDEs · Mathematics 2019-01-09 Peng Fa , Changyou Wang , Yuan Zhou

Let $M$ be a compact Riemannian manifold and $h$ a smooth function on $M$. Let $\rho^h(x)=\inf_{|v|=1}\left(Ric_x(v,v)-2Hess(h)_x(v,v) \right)$. Here $Ric_x$ denotes the Ricci curvature at $x$ and $Hess(h)$ is the Hessian of $h$. Then $M$…

Differential Geometry · Mathematics 2019-11-19 Xue-Mei Li

This paper introduces a coordinate descent version of the V\~u-Condat algorithm. By coordinate descent, we mean that only a subset of the coordinates of the primal and dual iterates is updated at each iteration, the other coordinates being…

Optimization and Control · Mathematics 2019-01-17 Olivier Fercoq , Pascal Bianchi

Let $f \in C^2(\mathbb{T}^2)$ have mean value 0 and consider $$ \sup_{\gamma~{\tiny \mbox{closed geodesic}}}{~~~ \frac{1}{|\gamma|} \left| \int_{\gamma}{ f ~~d\mathcal{H}^1}\right| },$$ where $\gamma$ ranges over all closed geodesics…

Classical Analysis and ODEs · Mathematics 2018-11-19 Stefan Steinerberger

We characterize the class of separable Banach spaces $X$ such that for every continuous function $f:X\to\mathbb{R}$ and for every continuous function $\epsilon:X\to\mathbb(0,+\infty)$ there exists a $C^1$ smooth function $g:X\to\mathbb{R}$…

Functional Analysis · Mathematics 2007-05-23 D. Azagra , M. Jimenez-Sevilla

In this paper, we propose a general framework for the algorithm New Q-Newton's method Backtracking, developed in the author's previous work. For a symmetric, square real matrix $A$, we define $minsp(A):=\min _{||e||=1} ||Ae||$. Given a…

Optimization and Control · Mathematics 2021-09-24 Tuyen Trung Truong

We consider almost sure convergence of the SDE $dX_t=\alpha_t d t + \beta_t d W_t$ under the existence of a $C^2$-Lyapunov function $F:\mathbb R^d \to \mathbb R$. More explicitly, we show that on the event that the process stays local we…

Probability · Mathematics 2022-07-18 S. Dereich , S. Kassing

We prove local Lipschitz regularity for local minimiser of \[ W^{1,1}(\Omega)\ni v\mapsto \int_\Omega F(Dv)\, dx \] where $\Omega\subseteq {\mathbb R}^N$, $N\ge 2$ and $F:{\mathbb R}^N\to {\mathbb R}$ is a quasiuniformly convex integrand in…

Analysis of PDEs · Mathematics 2023-04-05 Greta Marino , Sunra Mosconi

We study the behavior of stochastic gradient descent applied to $\|Ax -b \|_2^2 \rightarrow \min$ for invertible $A \in \mathbb{R}^{n \times n}$. We show that there is an explicit constant $c_{A}$ depending (mildly) on $A$ such that $$…

Numerical Analysis · Mathematics 2020-09-03 Stefan Steinerberger

We present a new perspective on the celebrated Sinkhorn algorithm by showing that is a special case of incremental/stochastic mirror descent. In order to see this, one should simply plug Kullback-Leibler divergence in both mirror map and…

Machine Learning · Computer Science 2019-09-17 Konstantin Mishchenko

A function $f$ from a subset of $\R^n$ to $\R$ is continuous at the origin, if and only if $\lim_{t\to 0+} f(\bs(t))=f(\bnull)$ for all continuous paths $\bs$ with $\lim_{t\to 0+} \bs(t)=\bnull$. The continuity of $f$ can, however, be…

Classical Analysis and ODEs · Mathematics 2013-02-15 Sigurdur F. Hafstein

In a Hilbert space setting $\mathcal H$, given $\Phi: \mathcal H \to \mathbb R$ a convex continuously differentiable function, and $\alpha$ a positive parameter, we consider the inertial system with Asymptotic Vanishing Damping…

Optimization and Control · Mathematics 2017-06-20 Hedy Attouch , Zaki Chbani , Hassan Riahi

We consider the class of convex minimization problems, composed of a self-concordant function, such as the $\log\det$ metric, a convex data fidelity term $h(\cdot)$ and, a regularizing -- possibly non-smooth -- function $g(\cdot)$. This…

Machine Learning · Statistics 2014-05-14 Anastasios Kyrillidis , Rabeeh Karimi Mahabadi , Quoc Tran-Dinh , Volkan Cevher
‹ Prev 1 3 4 5 6 7 10 Next ›