相关论文: Orbits of geometric descent

A recent article Li and Lv considered contraction of convex hypersurfaces by certain nonhomogeneous functions of curvature, showing convergence to points in finite time in certain cases where the speed is a function of a degree-one…

The popular BFGS quasi-Newton minimization algorithm under reasonable conditions converges globally on smooth convex functions. This result was proved by Powell in 1976: we consider its implications for functions that are not smooth. In…

We prove that complete submanifolds, on which the Omori-Yau weak maximum principle for the Hessian holds, with low codimension and bounded by cylinders of small radius must have points rich in large positive extrinsic curvature. The lower…

We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…

In this paper, we provide near-optimal accelerated first-order methods for minimizing a broad class of smooth nonconvex functions that are strictly unimodal on all lines through a minimizer. This function class, which we call the class of…

We prove that every transitive and non minimal semigroup with dense minimal points is sensitive. When the system is almost open, we obtain a generalization of this result.

Let S be a complete surface of constant curvature K = + 1 or -1, i.e. the sphere S^2 or the Lobachevskij plane L^2, and D a bounded convex subset of S. If S = S^2, assume also diameter (D) < pi/2. It is proved that the length of any…

We introduce a new technique that allows us to make progress on two long standing conjectures in transcendental dynamics: Baker's conjecture that a transcendental entire function of order less than 1/2 has no unbounded Fatou components, and…

We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…

We develop a rigorous framework for global non-convex optimization by reformulating the minimization problem as a discounted infinite-horizon optimal control problem. For non-convex, continuous, and possibly non-smooth objective functions…

We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…

In this paper, we first study nonsmooth steepest descent method for nonsmooth functions defined on Hilbert space and establish the corresponding algorithm by proximal subgradients. Then, we use this algorithm to find stationary points for…

We consider the general problem of minimizing an objective function which is the sum of a convex function (not strictly convex) and absolute values of a subset of variables (or equivalently the l1-norm of the variables). This problem…

We study the convergence of general abstract descent methods applied to a lower semicontinuous nonconvex function f that satisfies the Kurdyka-Lojasiewicz inequality in a Hilbert space. We prove that any precompact sequence converges to a…

We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…

This note shows that in Bauer's maximum principle, the assumed convexity of the objective function can be relaxed to quasiconvexity.

Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…

While Standard gradient descent is one very popular optimisation method, its convergence cannot be proven beyond the class of functions whose gradient is globally Lipschitz continuous. As such, it is not actually applicable to realistic…

We consider a model convex functional with orthotropic structure and super-quadratic nonstandard growth conditions. We prove that bounded local minimizers are locally Lipschitz, with no restrictions on the ratio between the highest and the…

We consider non oscillatory functions and prove an everywhere Fourier Inversion Theorem for functions of very moderate decrease. The proofs rely on some ideas in nonstandard analysis.