相关论文: Remarks on the $\Gamma $-regularization of Non-con…

In this paper we give a simple proof of inequalities of integrals of functions which are the composition of nonnegative continous convex functions on a vector space ${\bf R}^m$ and vector-valued functions in a weakly compact subset of a…

We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the…

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…

We study a class of nonconvex nonsmooth optimization problems in which the objective is a sum of two functions: One function is the average of a large number of differentiable functions, while the other function is proper, lower…

We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonconvex part is smooth and the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this fundamental problem…

This paper presents a nonsmooth proximal point technique for convex optimization in a special class of Hadamard manifold called homogeneous domains of positivity. The method is based on the particularization of the Rham decomposition…

We show that if the curvature of a Cartan-Hadamard $n$-manifold is constant near a convex hypersurface $\Gamma$, then the total Gauss-Kronecker curvature $\mathcal{G}(\Gamma)$ is not less than that of any convex hypersurface nested inside…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

In this paper, in particular, we prove the following result: Let $E$ be a reflexive real Banach space and let $C\subset E$ be a closed convex set, with non-empty interior, whose boundary is sequentially weakly closed and non-convex. Then,…

We consider convex monotone $C_0$-semigroups on a Banach lattice, which is assumed to be a Riesz subspace of a $\sigma$-Dedekind complete Banach lattice. Typical examples include the space of all bounded uniformly continuous functions and…

Motivated by variational models in continuum mechanics, we introduce a novel algorithm to perform nonsmooth and nonconvex minimizations with linear constraints in Euclidean spaces. We show how this algorithm is actually a natural…

Let $\Gamma$ be a Polish space and let $K$ be a separable and pointwise compact set of real-valued functions on $\Gamma$. It is shown that if each function in $K$ has only countably many discontinuities then $C(K)$ may be equipped with a…

We prove implicit function theorems for mappings on topological vector spaces over valued fields. In the real and complex cases, we obtain implicit function theorems for mappings from arbitrary (not necessarily locally convex) topological…

In this paper we propose an extension of the iteratively regularized Gauss--Newton method to the Banach space setting by defining the iterates via convex optimization problems. We consider some a posteriori stopping rules to terminate the…

This paper is concerned with the low Tucker-rank tensor completion problem, which is about reconstructing a tensor $ T \in\mathbb{R}^{n\times n \times n}$ of low multilinear rank from partially observed entries. Riemannian optimization…

Let $\gamma$ be a smooth, non-closed, simple curve whose image is symmetric with respect to the $y$-axis, and let $D$ be a planar domain consisting of the points on one side of $\gamma$, within a suitable distance $\delta$ of $\gamma$.…

In this paper, we propose a coupled tensor norm regularization that could enable the model output feature and the data input to lie in a low-dimensional manifold, which helps us to reduce overfitting. We show this regularization term is…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex…

In this paper we study nonconvex and nonsmooth optimization problems with semi-algebraic data, where the variables vector is split into several blocks of variables. The problem consists of one smooth function of the entire variables vector…