Results 51 to 60 of about 7,318 (258)
Some new error bounds for the linear complementarity problems are obtained when the involved matrices are weakly chained diagonally dominant B-matrices. Numerical examples are given to show the effectiveness of the proposed bounds.
Sun Deshu, Wang Feng
doaj +1 more source
Continuous Homotopies for the Linear Complementarity Problem [PDF]
The linear complementarity problem is formulated as a nonlinear system of equations or a constrained optimization problem. The present paper proposes and analyzes several continuous homotopies for the obtained nonlinear formulation of the linear complementarity problem. Some numerical experiments are verbally reported. A technical report of the authors
Watson, Layne T. +2 more
openaire +2 more sources
ABSTRACT This article examines the evolving role of organizational leadership amidst the rapid advancements in artificial intelligence (AI). It explores a broadly experienced and documented crisis in leadership, due in part to the disruptive nature of AI and emerging technology.
Rachel Wlodarsky, Davin Carr Chellman
wiley +1 more source
Global error bounds of the extended vertical linear complementarity problems for Dashnic–Zusmanovich (DZ) matrices and Dashnic–Zusmanovich-B (DZ-B) matrices are presented, respectively.
Yingxia Zhao, Deshu Sun
doaj +1 more source
ALDOA Promotes Glycolysis and NLRP3/GSDMD Pyroptosis to Accelerate ALS Progression
ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is characterized by progressive motor neuron degeneration. Glycolytic dysregulation is implicated in disease progression, yet the underlying mechanisms remain unclear. This study investigates how Aldolase A (ALDOA) drives ALS progression through glycolysis‐mediated motor neuron pyroptosis.
Kaixin Yan +9 more
wiley +1 more source
An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji +3 more
doaj +1 more source
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs [PDF]
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and ...
Ali Nakhaei Amroudi +2 more
doaj +1 more source
ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source
Projective algorithms for solving complementarity problems
We present robust projective algorithms of the von Neumann type for the linear complementarity problem and for the generalized linear complementarity problem.
Caroline N. Haddad, George J. Habetler
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source

