Related papers: Calculus rules for proximal {\epsilon}-subdifferen…
Optimization models with non-convex constraints arise in many tasks in machine learning, e.g., learning with fairness constraints or Neyman-Pearson classification with non-convex loss. Although many efficient methods have been developed…
In this paper, we introduce a new subclass of close-to-convex harmonic functions. We present a sufficient coefficient condition for a function to be a member of this class. Furthermore, we establish a distortion theorem. These results lay…
We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…
This paper characterizes the proximal operator of the piece-wise exponential function $1\!-\!e^{-|x|/\sigma}$ with a given shape parameter $\sigma\!>\!0$, which is a popular nonconvex surrogate of $\ell_0$-norm in support vector machines,…
Standard approaches to difference-of-convex (DC) programs require exact solution to a convex subproblem at each iteration, which generally requires noiseless computation and infinite iterations of an inner iterative algorithm. To tackle…
We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…
We propose in this paper a proximal and contraction method for solving a convex mixed variational inequality problem in a real Hilbert space. To accelerate the convergence of our proposed method, we incorporate an inertial extrapolation…
We establish inverse and direct theorems on best approximations in quasi-normed Abelian groups through bilateral Bernstein-Jackson inequalities with exact constants. Using integral representations for quasi-norms of functions $f$ in…
We study the proximity operator of the nonconvex, scale-invariant ratio $h(\vx)=\|\vx\|_{1}/\|\vx\|_{2}$ and show it can be computed exactly in any dimension. By expressing $\vx=r\vu$ and exploiting sign and permutation invariance, we…
We address a deep study of the convexity notions that arise in the study of weak* lower semicontinuity of supremal functionals as well as those raised by the power-law approximation of such functionals. Our quest is motivated by the…
In this paper, we study the existence of the random approximations and fixed points for random almost lower semicontinuous operators defined on finite dimensional Banach spaces, which in addition, are condensing or 1-set-contractive. Our…
We consider weakly coupled LQ optimal control problems and derive estimates on the sensitivity of the optimal value function in dependence of the coupling strength. In order to improve these sensitivity estimates a "coupling adapted" norm…
We propose a proximal variable smoothing algorithm for a nonsmooth optimization problem whose cost function is the sum of three functions including a weakly convex composite function. The proposed algorithm has a single-loop structure…
We consider the saddle point problem where the objective functions are abstract convex with respect to the class of quadratic functions. We propose primal-dual algorithms using the corresponding abstract proximal operator and investigate…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…
Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show…
Let $\varrho\in C^{\infty} ({\Bbb R}^d\setminus\{0\})$ be a non-radial homogeneous distance function satisfying $\varrho(t\xi)=t\varrho(\xi)$. For $f\in\frak S ({\Bbb R}^{d+1})$ and $\delta>0$, we consider convolution operator ${\Cal…
The nonlinear conjugate gradient methods are known to be an effective approach for standard unconstrained optimization problems especially for large-scale problems. This paper proposes a proximal nonlinear conjugate gradient method, which…
Some adaptive analogue of the Mirror Prox method for variational inequalities is proposed. In this work we consider the adaptation not only to the value of the Lipschitz constant, but also to the magnitude of the oracle error. This…