Results 11 to 20 of about 81 (73)

Development and validation of a goal attainment scale for families affected by maternal substance use

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, Emily A. Siedlik, Oneta J. Templeton   +2 more
wiley   +1 more source

Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in ℝn

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

Iterative algorithms with seminorm‐induced oblique projections

Abstract and Applied Analysis, Volume 2003, Issue 7, Page 387-406, 2003., 2003
A definition of oblique projections onto closed convex sets that use seminorms induced by diagonal matrices which may have zeros on the diagonal is introduced. Existence and uniqueness of such projections are secured via directional affinity of the sets with respect to the diagonal matrices involved. A block‐iterative algorithmic scheme for solving the
Yair Censor, Tommy Elfving
wiley   +1 more source

A global method for some class of optimization and control problems

International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 9, Page 605-616, 2000., 2000
The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley   +1 more source

A proximal point method for nonsmooth convex optimization problems in Banach spaces

Abstract and Applied Analysis, Volume 2, Issue 1-2, Page 97-120, 1997., 1997
In this paper we show the weak convergence and stability of the proximal point method when applied to the constrained convex optimization problem in uniformly convex and uniformly smooth Banach spaces. In addition, we establish a nonasymptotic estimate of convergence rate of the sequence of functional values for the unconstrained case.
Y. I. Alber, R. S. Burachik, A. N. Iusem
wiley   +1 more source

General algorithm and sensitivity analysis for variational inequalities

International Journal of Stochastic Analysis, Volume 5, Issue 1, Page 29-41, 1992., 1991
The fixed point technique is used to prove the existence of a solution for a class of variational inequalities related to odd order boundary value problems, and to suggest a general algorithm. We also study the sensitivity analysis for these variational inequalities and complementarity problems using the projection technique.
Muhammad Aslam Noor
wiley   +1 more source

Two Relaxed Inertial Forward–Reflected–Backward Splitting Algorithms With Momentum Terms

Journal of Mathematics, Volume 2025, Issue 1, 2025.
In this paper, to solve the monotone inclusion problem consisting of the sum of two monotone operators in Hilbert spaces, we propose and study two modifications of Malitsky–Tam’s forward–reflection–backward splitting methods with double momentum terms. Meanwhile, we consider a relaxed inertial version to expand the range of allowable step sizes.
Binbin Zhang, Ximeng Guan, Chenhao Yin, Minh N. Dao   +3 more
wiley   +1 more source

The robust isolated calmness of spectral norm regularized convex matrix optimization problems

Open Mathematics
This article aims to provide a series of characterizations of the robust isolated calmness of the Karush-Kuhn-Tucker (KKT) mapping for spectral norm regularized convex optimization problems. By establishing the variational properties of the spectral norm
Yin Ziran, Chen Xiaoyu, Zhang Jihong
doaj   +1 more source

A projective splitting algorithm for solving generalized mixed variational inequalities

Journal of Inequalities and Applications, 2011
In this paper, a projective splitting method for solving a class of generalized mixed variational inequalities is considered in Hilbert spaces. We investigate a general iterative algorithm, which consists of a splitting proximal point step followed by a ...
Zou Yun-zhi, Xia Fu-quan
doaj