Results 41 to 50 of about 10,196 (258)
پژوهشهای ریاضی, 2021 By using a new search direction, we propose an infeasible interior-point method for monotone linear complementarity problem. The algorithm uses only one feasibility step in each iteration, and we prove that it suffices in order to obtain a polynomial ...
Nezameddin Mahdavi-Amiri +1 more
doaj
An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem
Promet (Zagreb), 2017 Continuous network design problem (CNDP) is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a ...
Guangmin Wang, Junwei Yu, Shubin Li
doaj +1 more source
Extensions of P-property, R0-property and semidefinite linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2017 In this manuscript, we present some new results for the semidefinite linear complementarity problem, in the context of three notions for linear transformations, viz., pseudo w-P property, pseudo Jordan w-P property and pseudo SSM property ...
Jeyaraman I. +2 more
doaj +1 more source
Spatial biology in cancer epigenetics
Molecular Oncology, EarlyView.Spatial epigenomics combines molecular profiling with tissue architecture to reveal how gene regulation is organized within intact tissues. In cancer, these technologies uncover the mechanisms driving tumor heterogeneity and microenvironmental interactions, opening new opportunities for biomarker discovery and precision medicine.
Eva Crespo‐García, Manel Esteller
wiley +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Robustness and nondegenerateness for linear complementarity problems [PDF]
Mathematical Programming, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jansen, M.J.M., Tijs, S.H.
openaire +4 more sources
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Projective algorithms for solving complementarity problems
International Journal of Mathematics and Mathematical Sciences, 2002 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