相关论文: On the {\L}ojasiewicz Exponent of the Quadratic Sp…

We consider the minimization problem with the truncated quadratic regularization with gradient operator, which is a nonsmooth and nonconvex problem. We cooperated the classical preconditioned iterations for linear equations into the…

We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a…

We study an optimal partition problem on the sphere, where the cost functional is associated with the fractional $Q$-curvature in terms of the conformal fractional Laplacian on the sphere. By leveraging symmetries, we prove the existence of…

We consider shape optimization problems with internal inclusion constraints, of the form $$\min\big\{J(\Omega)\ :\ \Dr\subset\Omega\subset\R^d,\ |\Omega|=m\big\},$$ where the set $\Dr$ is fixed, possibly unbounded, and $J$ depends on…

We are concerned with the dependence of the lowest positive eigenvalue of the Dirac operator on the geometry of rectangles, subject to infinite-mass boundary conditions. We conjecture that the square is a global minimiser both under the…

We generalise a result of Bykovskii to the Gaussian integers and prove an asymptotic formula for the prime geodesic theorem in short intervals on the Picard manifold. Previous works show that individually the remainder is bounded by…

In this work, we study the existence and regularity results of anisotropic elliptic equations with a singular lower order term that grows naturally with respect to the gradient and unbounded coefficients. We take up the following model…

In a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inequality. Namely, as discussed in the paper, its area must be bounded above by $4\pi/c$,…

We introduce a notion of inexact model of a convex objective function, which allows for errors both in the function and in its gradient. For this situation, a gradient method with an adaptive adjustment of some parameters of the model is…

In this paper we prove the existence of an optimal domain $\Omega_{opt}$ for the shape optimization problem $$\max\Big\{\lambda_q(\Omega)\ :\ \Omega\subset D,\ \lambda_p(\Omega)=1\Big\},$$ where $q<p$ and $D$ is a prescribed bounded subset…

During recent years the interest of optimization and machine learning communities in high-probability convergence of stochastic optimization methods has been growing. One of the main reasons for this is that high-probability complexity…

We establish a new uniqueness theorem for the three dimensional Schwarzschild-de Sitter metrics. For this some new or improved tools are developed. These include a reverse Lojasiewicz inequality, which holds in a neighborhood of the…

The variation of spectral subspaces for linear self-adjoint operators under an additive bounded off-diagonal perturbation is studied. To this end, the optimization approach for general perturbations in [J. Anal. Math., to appear;…

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…

We derive a singular version of the Sphere Covering Inequality which was recently introduced in [42], suitable for treating singular Liouville-type problems with superharmonic weights. As an application we deduce new uniqueness results for…

We investigate a shape optimization problem of the Polya-Szego type and prove some results on symmetry and asymmetry of extremal domains.

We analyze the global and local behavior of gradient-like flows under stochastic errors towards the aim of solving convex optimization problems with noisy gradient input. We first study the unconstrained differentiable convex case, using a…

For $t \in [-1, 1)$, a set of points on the $(n-1)$-dimensional unit sphere is called $t$-almost equiangular if among any three distinct points there is a pair with inner product $t$. We propose a semidefinite programming upper bound for…

The aim of this paper is to derive convergence results for projected line-search methods on the real-algebraic variety $\mathcal{M}_{\le k}$ of real $m \times n$ matrices of rank at most $k$. Such methods extend Riemannian optimization…

In this paper, we study a variant of the quadratic penalty method for linearly constrained convex problems, which has already been widely used but actually lacks theoretical justification. Namely, the penalty parameter steadily increases…