Quadratic-support functions [Aravkin, Burke, and Pillonetto; J. Mach. Learn. Res. 14(1), 2013] constitute a parametric family of convex functions that includes a range of useful regularization terms found in applications of convex optimization. We show how an interior method can be used to efficiently compute the proximal operator of a quadratic-support function under different metrics. When th...

Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we connect the second type of covering-based rough sets and matroids from the view of closure operators. On one hand, we establish a closure system through the fixed ...

We consider the elliptic operator P(D)+ V in R , d ≥ 2 where P(D) is a constant coefficient elliptic pseudo-differential operator of order 2 with a homogeneous convex symbol P(ξ), and V is a real periodic function in L∞(Rd). We show that the number of gaps in the spectrum of P(D)+V is finite if 4 > d + 1. If in addition, V is smooth and the convex hypersurface {ξ ∈ R : P(ξ) = 1} has positive Ga...

In past work, the author has developed the Operator Method to study the existence of convex classical solutions to convex one-layer and multi-layer freeboundary problems in fluid dynamics (see Trans. Amer. Math. Soc. 350(1998), pp. 2981-3020, for example). The general idea was to obtain the convex free boundary either as a convex functional minimizer (convex variational inequalities), or as the...

Abstract In this article, we study the Bohr operator for operator-valued subordination class $S(f)$ consisting of holomorphic functions subordinate to f in unit disk $\mathbb {D}:=\{z \in \mathbb {C}: |z|<1\}$ , where $f:\mathbb {D} \rightarrow \mathcal {B}(\mathcal {H})$ is and $\mathcal algebra bounded linear operators on a complex Hilbert space {H}$ . We establish several results, which c...

A tournament is a complete directed graph. A convex subset is a vertex subset with the property that every two-path beginning and ending inside the convex subset is contained completely within the subset. This paper shows a relationship between convex subsets and transitive closures which leads to an optimal O(n 3)-time algorithm for nding all convex subsets in a tournament.

Projection and intersection bodies define continuous and GL(n) contravariant valuations. They played a critical role in the solution of the Shephard problem for projections of convex bodies and its dual version for sections, the Busemann– Petty problem. We consider the question whether ΦK ⊆ ΦL implies V (K) ≤ V (L), where Φ is a homogeneous, continuous operator on convex or star bodies which is...

We study the partial differential equation max {Lu− f,H(Du)} = 0 where u is the unknown function, L is a second-order elliptic operator, f is a given smooth function and H is a convex function. This is a model equation for HamiltonJacobi-Bellman equations arising in stochastic singular control. We establish the existence of a unique viscosity solution of the Dirichlet problem that has a Hölder ...

In this paper, we propose two novel inertial forward–backward splitting methods for solving the constrained convex minimization of sum functions, φ1+φ2, in Hilbert spaces and analyze their convergence behavior under some conditions. For first method (iFBS), use operator. The step size depends on a constant Lipschitz continuity ∇φ1, hence weak result proposed is established conditions based fixe...

This paper is devoted to the problem of best recovery a fractional power B-elliptic operator function on R+N by its Fourier–Bessel transform known approximately convex set with estimate difference between and approximation in metric L∞. The optimal method has been found. does not use values beyond ball centered at origin.