Results 41 to 50 of about 17,353,800 (271)
A decomposition-based warm-start method for stochastic programming [PDF]
, 2013 In this paper we propose a warm-start technique for interior point methods applicable to multi-stage stochastic linear programming problems. The main idea is to generate an initial point by decomposing the problem at the second stage and using an ...
Colombo, Marco +3 more
core +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Molecular Oncology, EarlyView.Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla +9 more
wiley +1 more source
Primal-dual Interior-Point Methods for Self-Scaled Cones [PDF]
, 1995 Primal-dual Interior-Point Methods for Self-Scaled ...
Todd, M. J., Yu. E. Nesterov
core +4 more sources
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented.
Mohamed Achache, Naima Boudiaf
doaj +2 more sources
On the simplex, interior-point and objective space approaches to multiobjective linear programming
Journal of Algorithms & Computational Technology, 2021 Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point method of Linear Programming.
Paschal B Nyiam, Abdellah Salhi
doaj +1 more source
Molecular Oncology, EarlyView.We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober +16 more
wiley +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones
Journal of Applied Mathematics, 2010 Optimization problems with second-order cone constraints (SOCs) can be solved efficiently by interior point methods. In order for some of these methods to get started or to converge faster, it is important to have an initial feasible point or near ...
Anna Weigandt +2 more
doaj +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