Searcharxiv⌕ Search

arXiv subjects

Felipe Lara

Publications and source records attributed to Felipe Lara.

22 records · Page 2Linked to original sources

Strongly quasiconvex functions: what we know (so far)

Introduced by Polyak in 1966, the class of strongly quasiconvex functions includes some interesting nonconvex members, like the square root of the Euclidean norm or ratios with a nonnegative strongly convex numerator and a concave and positive denominator. This survey collects the vast majority of the results involving strongly quasiconvex functions available in the literature at the moment, presenting, in particular, algorithms for minimizing such functions, and suggests some directions where additional investigations would be welcome.

math.OC↗

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis

We develop sufficient conditions for the existence of the weak sharp minima at infinity property for nonsmooth optimization problems via asymptotic cones and generalized asymptotic functions. Next, we show that these conditions are also useful for studying the solution stability of nonconvex optimization problems under linear perturbations. Finally, we provide applications for a subclass of quasiconvex functions which is stable under linear additivity and includes the convex ones.

math.OC↗

Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions

We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthemore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this for establishing exponential convergence for first- and second-order gradient systems without relying on the usual Lipschitz continuity assumption on the gradient of the function. The explicit discretization of the first-order dynamical system leads to the gradient descent method while discretization of the second-order dynamical system with viscous damping recovers the heavy ball method. We establish the linear convergence of both methods under suitable conditions on the parameters as well as comparisons with other classes of nonconvex functions used in the gradient descent literature.

math.OC↗

An extension of the proximal point algorithm beyond convexity

We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly convex, and DC (difference of convex) functions that are prox-convex, however none of these classes fully contains the one of prox-convex functions or is included into it. We show that the classical proximal point algorithm remains convergent when the convexity of the proper lower semicontinuous function to be minimized is relaxed to prox-convexity.

math.OC↗