Results 11 to 20 of about 107 (98)

The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints [PDF]

open access: yesFundamental Research
In a mathematical program with generalized complementarity constraints (MPGCC), complementarity relation is imposed between each pair of variable blocks.
Yukuan Hu, Xin Liu
doaj   +2 more sources

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

open access: yesInfant 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

Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound

open access: yesOpen Mathematics, 2022
In this article, we analyze the convergence rate of the modified Levenberg-Marquardt (MLM) method under the Hölderian local error bound condition and the Hölderian continuity of the Jacobian, which are more general than the local error bound condition ...
Zheng Lin, Chen Liang, Tang Yangxin
doaj   +1 more source

Evaluation of the effects of chlorhexidine digluconate with and without cBD103 or cCath against multidrug‐resistant clinical isolates of Staphylococcus pseudintermedius

open access: yesVeterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022
Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro   +3 more
wiley   +1 more source

A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization

open access: yesTopological Algebra and its Applications, 2022
Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements.
Diphofu T., Kaelo P., Tufa A.R.
doaj   +1 more source

Combining the cross-entropy algorithm and ∈-constraint method for multiobjective optimization

open access: yesMoroccan Journal of Pure and Applied Analysis, 2021
This paper aims to propose a new hybrid approach for solving multiobjective optimization problems. This approach is based on a combination of global and local search procedures.
Ezzine Abdelmajid   +2 more
doaj   +1 more source

A Dai-Liao-type projection method for monotone nonlinear equations and signal processing

open access: yesDemonstratio Mathematica, 2022
In this article, inspired by the projection technique of Solodov and Svaiter, we exploit the simple structure, low memory requirement, and good convergence properties of the mixed conjugate gradient method of Stanimirović et al.
Ibrahim Abdulkarim Hassan   +4 more
doaj   +1 more source

Pareto front approximation through a multi-objective augmented Lagrangian method

open access: yesEURO Journal on Computational Optimization, 2021
In this manuscript, we consider smooth multi-objective optimization problems with convex constraints. We propose an extension of a multi-objective augmented Lagrangian Method from recent literature.
Guido Cocchi   +2 more
doaj   +1 more source

A new conjugate gradient method for acceleration of gradient descent algorithms

open access: yesMoroccan Journal of Pure and Applied Analysis, 2021
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

New inertial forward–backward algorithm for convex minimization with applications

open access: yesDemonstratio Mathematica, 2023
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

Home - About - Disclaimer - Privacy