Related papers: The necessary and sufficient conditions for repres…
In this paper, we provide a generalization of the forward-backward splitting algorithm for minimizing the sum of a proper convex lower semicontinuous function and a differentiable convex function whose gradient satisfies a locally…
We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.
We propose two algorithms for solving global optimization problems on a hyperrectangle with an objective function satisfying the Vanderbei condition (this function is also called an $\varepsilon$-Lipschitz continuous function). 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…
In this paper, we begin by investigating a particular subclass of boundary measures of Herglotz-Nevanlinna functions in two variables. Based on this, we then proceed to solve the convex combination problem for Herglotz-Nevanlinna functions…
We identify a class of continuous compactly supported functions for which the known part of the Gabor frame set can be extended. At least for functions with support on an interval of length two, the curve determining the set touches the…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
The (global) Lipschitz smoothness condition is crucial in establishing the convergence theory for most optimization methods. Unfortunately, most machine learning and signal processing problems are not Lipschitz smooth. This motivates us to…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
We propose a sufficient condition for invertibility of a polynomial mapping function defined on a cube or simplex. This condition is applicable to finite element analysis using curved meshes. The sufficient condition is based on an analysis…
We study the set of curvature functions which a given compact manifold with boundary can possess. First, we prove that the sign demanded by the Gauss-Bonnet Theorem is a necessary and sufficient condition for a given function to be the…
In multicentric holomorphic calculus one represents the function $\varphi$ using a new polynomial variable $w=p(z)$ in such a way that when it is evaluated at the operator $A,$ then $p(A)$ is small in norm. Usually it is assumed that $p$…
We consider a composite optimization problem where the sum of a continuously differentiable and a merely lower semicontinuous function has to be minimized. The proximal gradient algorithm is the classical method for solving such a problem…
The general methods which are powerful for the necessity of bounded commutators are given. As applications, some necessary conditions for bounded commutators are first obtained in certain endpoint cases, and several new characterizations of…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…
Recently some specific classes of non-smooth and non-Lipschitz convex optimization problems were selected by Yu.~Nesterov along with H.~Lu. We consider convex programming problems with similar smoothness conditions for the objective…
We derive two types of representation results for increasing convex functionals in terms of countably additive measures. The first is a max-representation of functionals defined on spaces of real-valued continuous functions and the second a…