Abstract We revisit a unified methodology for the iterative solution of nonlinear equations in Hilbert spaces. Our key observation is that general approach from [P. Heid and T. P. Wihler, Adaptive linearization Galerkin methods problems, Math. Comp. 89 2020, 326, 2707–2734; On convergence adaptive linearized methods, Calcolo 57 Paper No. 24] satisfies an energy contraction property context (abs...

Ding, G., Monotone clutters, Discrete Mathematics 119 (1993) 67-77. A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k-monotone, completely monotone or threshold, respectively. A characterization of k-monotone clutters in terms ofexcluded minors is presented here. This result is used to derive a characterization of 2-monotone matroids and of 3-m...

Amonotone drawing of a planar graph G is a planar straightline drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this pap...

in this paper, we study the existence of generalized solutions for the infinite dimensional nonlinear stochastic differential inclusions $dx(t) in f(t,x(t))dt +g(t,x(t))dw_t$ in which the multifunction $f$ is semimonotone and hemicontinuous and the operator-valued multifunction $g$ satisfies a lipschitz condition. we define the it^{o} stochastic integral of operator set-valued stochastic pr...

This paper considers k-monotone estimation and the related asymptotic performance analysis over a suitable Hölder class for general k. A novel two stage k-monotone B-spline estimator is proposed: in the first stage, an unconstrained estimator with optimal asymptotic performance is considered; in the second stage, a k-monotone B-spline estimator is constructed by projecting the unconstrained est...

We study the complexity of approximating monotone Boolean functions with disjunctive normal form (DNF) formulas, exploring two main directions. First, we construct DNF approximators for arbitrary monotone functions achieving one-sided error: we show that every monotone f can be ε-approximated by a DNF g of size 2n−Ωε( √ n) satisfying g(x) ≤ f(x) for all x ∈ {0, 1}. This is the first non-trivial...

| The simplest nontrivial monotone functions are \staircases." The problem arises: what is the best approximation of some monotone function f(x) by a staircase with M jumps? In particular: what if f(x) is itself a staircase with N, N > M, steps? This paper considers algorithms for solving, and theorems relating to, this problem. All of the algorithms we propose are space-optimal up to a constan...

Such a set G is said to be maximal monotone if it is maximal among monotone sets in the sense of set inclusion, and a mapping T is said to be maximal monotone if its graph G(T) is a maximal monotone set. For reflexive Banach spaces X and mappings T with D(T)~X, the basic result obtained independently by Browder [2] and Minty [20] states that if T is a monotone operator from D(T)=X to X* which i...