Results 1 to 10 of about 1,360 (37)
In this note we provide regularity conditions of closedness type which guarantee some surjectivity results concerning the sum of two maximal monotone operators by using representative functions.
Ioan Boţ Radu, Grad Sorin-Mihai
doaj +2 more sources
Abstract The Team for Infants Exposed to Substance use (TIES) Program is a longstanding home‐based family support program that provides a multidisciplinary, community‐facing model to address the complex needs of families with young children affected by maternal substance use.
Danielle F. Chiang +2 more
wiley +1 more source
Designing experiments informed by observational studies
The increasing availability of passively observed data has yielded a growing interest in “data fusion” methods, which involve merging data from observational and experimental sources to draw causal conclusions.
Rosenman Evan T. R., Owen Art B.
doaj +1 more source
Solving Composite Fixed Point Problems with Block Updates
Various strategies are available to construct iteratively a common fixed point of nonexpansive operators by activating only a block of operators at each iteration.
Combettes Patrick L., Glaudin Lilian E.
doaj +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj +1 more source
First-Order Methods for Convex Optimization
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
New inertial forward–backward algorithm for convex minimization with applications
In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces.
Kankam Kunrada +2 more
doaj +1 more source
Checkerboard copula defined by sums of random variables
We consider the problem of finding checkerboard copulas for modeling multivariate distributions. A checkerboard copula is a distribution with a corresponding density defined almost everywhere by a step function on an m-uniform subdivision of the unit ...
Kuzmenko Viktor +2 more
doaj +1 more source
In this work we investigate dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators.
Boţ Radu Ioan +3 more
doaj +1 more source

