Results 11 to 20 of about 1,574 (118)
Infant Mental Health Journal: Infancy and Early Childhood, Volume 43, Issue 6, Page 899-909, November 2022., 2022 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
Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular [PDF]
Fixed Point Theory and Applications, 2011 Because of Minty's classical correspondence between firmly nonexpansive mappings and maximally monotone operators, the notion of a firmly nonexpansive mapping has proven to be of basic importance in fixed point theory, monotone operator theory, and ...
Heinz H. Bauschke +3 more
semanticscholar +1 more source
Checkerboard copula defined by sums of random variables
Dependence Modeling, 2020 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
Advances in Nonlinear Analysis, 2020 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
The Lax conjecture is true [PDF]
, 2003 In 1958 Lax conjectured that hyperbolic polynomials in three variables are determinants of linear combinations of three symmetric matrices. This conjecture is equivalent to a recent observation of Helton and Vinnikov.Comment: 7 pages, Proceedings to the ...
A. S. Lewis +3 more
core +5 more sources
, 2014 The purpose of this paper is to study the split feasibility problem and fixed point problem involved in the pseudocontractive mappings. We construct an iterative algorithm and prove its strong convergence. MSC:47J25, 47H09, 65J15, 90C25.
Yonghong Yao +3 more
semanticscholar +1 more source
On the linear convergence of the stochastic gradient method with constant step-size [PDF]
, 2018 The strong growth condition (SGC) is known to be a sufficient condition for linear convergence of the stochastic gradient method using a constant step-size $\gamma$ (SGM-CS).
Cevher, Volkan, Vu, Bang Cong
core +2 more sources
Journal of Applied Mathematics, Volume 2004, Issue 5, Page 409-431, 2004., 2004 We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two‐sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient‐type methods for constrained optimization.
Stefan M. Stefanov
wiley +1 more source
Method for solving a convex integer programming problem
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 44, Page 2829-2834, 2003., 2003 We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.
Stefan M. Stefanov
wiley +1 more source
Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
, 2014 This paper presents an algorithm to accelerate the Halpern fixed point algorithm in a real Hilbert space. To this goal, we first apply the Halpern algorithm to the smooth convex minimization problem, which is an example of a fixed point problem for a ...
Kaito Sakurai, Hideaki Iiduka
semanticscholar +1 more source