Results 41 to 50 of about 858,678 (186)

Exact Solution Methods for the $k$-item Quadratic Knapsack Problem

open access: yes, 2016
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization.
A Billionnet   +18 more
core   +2 more sources

Exon 7 splicing of ERα predicts poor prognosis and increases phenotypic heterogeneity in luminal a subtype breast cancer

open access: yesFEBS Open Bio, EarlyView.
ERα splice variant ERα∆7 lacks the C‐terminus, and its expression may change phenotypes of breast cancers. Our results showed that ERα∆7 is found in the luminal A subtype, and elevated ERα∆7 levels are linked to improved cell survival with lower proliferation and migration.
Long Wai Tsui   +10 more
wiley   +1 more source

An interior point algorithm for computing equilibria in economies with incomplete asset markets [PDF]

open access: yes, 2004
Computing equilibria in general equilibria models with incomplete asset (GEI) markets is technically difficult. The standard numerical methods for computing these equilibria are based on homotopy methods.
Esteban-Bravo, Mercedes
core   +1 more source

Proteasomal degradation of intracellularly expressed Amblyomin‐X limits suicide gene therapy potential in melanoma cells

open access: yesFEBS Open Bio, EarlyView.
This study explores the feasibility of expressing the antitumoral protein Amblyomin‐X through a suicide gene therapy approach and investigates its intracellular fate after gene delivery. Although the gene is efficiently expressed, melanoma cells rapidly degrade the Amblyomin‐X protein via proteasome activity.
Victor Dal Posolo Cinel   +4 more
wiley   +1 more source

Finding a point in the relative interior of a polyhedron [PDF]

open access: yes, 2007
A new initialization or `Phase I' strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible
Cartis, Coralia, Gould, Nicholas I. M.
core   +1 more source

Crash start of interior point methods [PDF]

open access: yesEuropean Journal of Operational Research, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

UiO‐66 metal–organic frameworks in biomedicine: From structural tunability to bioimaging, photodiagnostics, and photodynamic cancer therapy

open access: yesFEBS Open Bio, EarlyView.
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová   +2 more
wiley   +1 more source

Interior Point Methods with a Gradient Oracle

open access: yesProceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
We provide an interior point method based on quasi-Newton iterations, which only requires first-order access to a strongly self-concordant barrier function. To achieve this, we extend the techniques of Dunagan-Harvey [STOC '07] to maintain a preconditioner, while using only first-order information. We measure the quality of this preconditioner in terms
openaire   +3 more sources

Directed evolution of enzymes at the crossroads of tradition and innovation

open access: yesFEBS Open Bio, EarlyView.
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova   +2 more
wiley   +1 more source

A comparison of general-purpose optimization algorithms forfinding optimal approximate experimental designs [PDF]

open access: yes, 2019
Several common general purpose optimization algorithms are compared for findingA- and D-optimal designs for different types of statistical models of varying complexity,including high dimensional models with five and more factors.
Garcia-Garcia, Jose Carlos   +4 more
core  

Home - About - Disclaimer - Privacy