An interval branch and bound method for global Robust optimization

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

     

Dynamics of Bacteriorhodopsin in the Dark-Adapted State from Solution Nuclear Magnetic Resonance Spectroscopy

To achieve efficient proton pumping in the light-driven proton pump bacteriorhodopsin (bR), the protein must be tightly coupled to the retinal to rapidly convert retinal isomerization into protein structural rearrangements. Methyl group dynamics of bR embedded in lipid nanodiscs were determined in the dark-adapted state, and were found to be mostly well ordered at the cytosolic side. Methyl groups in the M145A mutant of bR, which displays only 10 % residual proton pumping activity, are less well ordered, suggesting a link between side-chain dynamics on the cytosolic side of the bR cavity and proton pumping activity. In addition, slow conformational exchange, attributed to low frequency motions of aromatic rings, was indirectly observed for residues on the extracellular side of the bR cavity. This may be related to reorganization of the water network. These observations provide a detailed picture of previously undescribed equilibrium dynamics on different time scales for ground-state bR.