Related papers: Higher order quasiconvexity reduces to quasiconvex…
We introduce higher order mean curvatures of screen almost conformal (SAC) half-lightlike submanifolds of indefinite contact manifolds, admitting a semi-symmetric non-metric connection, and use them to generalize some known results of [6].…
This paper investigates the asymptotic convergence behavior of high-order proximal-point algorithms (HiPPA) toward global minimizers, extending the analysis beyond sublinear convergence rate results. Specifically, we consider the proximal…
Previous algorithms can solve convex-concave minimax problems $\min_{x \in \mathcal{X}} \max_{y \in \mathcal{Y}} f(x,y)$ with $\mathcal{O}(\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been…
The regularity of the Hardy-Littlewood maximal function, in both discrete and continuous contexts, and for both centered and noncentered variants, has been subjected to intense study for the last two decades. But efforts so far have…
This paper addresses the optimization problem of minimizing non-convex continuous functions, which is relevant in the context of high-dimensional machine learning applications characterized by over-parametrization. We analyze a randomized…
Understanding the role that subgradients play in various second-order variational analysis constructions can help us uncover new properties of important classes of functions in variational analysis. Focusing mainly on the behavior of the…
A partial regularity theorem is presented for minimisers of $k$th-order functionals subject to a quasiconvexity and general growth condition. We will assume a natural growth condition governed by an $N$-function satisfying the $\Delta_2$…
Let $P(h),h\in]0,1]$ be a semiclassical scalar differential operator of order $2$. The existence of a supersymmetric structure given by a matrix $G(x;h)$ was exhibited in \cite{HeHiSj13} under rather general assumptions. In this note we…
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
We continue the analysis in [3] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [5]. We amend and improve some…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on $\mathbb{R}^d$ that are convex with respect to the L\"{o}wner partial order can have a complicated structure and might be very difficult to compute…
In this article we have studied some properties of subharmonic functions in a strongly symmetric Riemannian manifold with a pole. As a generalization of polynomial growth of a function we have introduced the notion of polynomial growth of…
The paper is devoted to deriving novel second-order necessary and sufficient optimality conditions for local minimizers in rather general classes of nonsmooth unconstrained and constrained optimization problems in finite-dimensional spaces.…
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…
We show that a smooth bounded domain in $\mathbb{C}^n$ admitting partial pseudoconvex exhaustion remains partial pseudoconvex. The main ingredient of the proof is based on a new characterization of hyper-$q$-convex domains. Furthermore, we…
In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently…
We establish partial regularity results for minimizers of a class of functionals depending on differential expressions based on elliptic operators. Specifically, we focus on functionals of Orlicz growth with a natural strong quasiconvexity…
We show that the augmented primal-dual gradient algorithms can achieve global exponential convergence with partially strongly convex functions. In particular, the objective function only needs to be strongly convex in the subspace…
By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…