Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a potential reduction algorithm to solve the master problem approximately and a column generation technique to define a sequence of primal linear programming problems. Each subproblem consists of finding a minimum cost flow between an origin and a destination node in an uncapacited network. It is thus formulated as a shortest path problem and solved with Dijkstra's d-heap algorithm. An implementation is described that takes full advantage of the supersparsity of the network in the linear algebra operations. Computational results show the efficiency of this approach on well-known nondifferentiable problems and also large scale randomly generated problems (up to 1000 arcs and 5000 commodities

Solving variational inequalities defined on a domain with infinitely many linear constraints

We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. A discretization method and an analytic center based inexact cutting plane method are proposed. Under proper assumptions, the convergence results for both methods are given. We also provide numerical examples to illustrate the proposed method

Understanding the physiology of Lactobacillus plantarum at zero growth

The physiology of Lactobacillus plantarum at extremely low growth rates, through cultivation in retentostats, is much closer to carbon-limited growth than to stationary phase, as evidenced from transcriptomics data, metabolic fluxes, and biomass composition and viability.Using a genome-scale metabolic model and constraint-based computational analyses, amino-acid fluxes—in particular, the rather paradoxical excretion of Asp, Arg, Met, and Ala—could be rationalized as a means to allow extensive metabolism of other amino acids, that is, that of branched-chain and aromatic amino acids.Catabolic products from aromatic amino acids are known to have putative plant-hormone action. The metabolism of amino acids, as well as transcription data, strongly suggested a plant environment-like response in slow-growing L. plantarum, which was confirmed by significant effects of fermented medium on plant root formation

A micro-architectural evaluation of osteoporotic human femoral heads to guide implant placement in proximal femoral fractures

Peer reviewedPublisher PD

Update on cervical disc arthroplasty: where are we and where are we going?

Despite the very good results of anterior cervical discectomy and fusion, there are concerns of adjacent level degeneration. For this reason, interest has grown in the potential for motion sparing alternatives. Cervical disc arthroplasty is thus evolving as a potential alternative to fusion. Specific design characteristic and implants will be reviewed and outcomes summarized

General models in min-max continous location

In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of th stationary points, we propose a simple central and deep-cut ellipsoid algorithm to solve these problems for the quasiconvex case. Moreover, an elementary convergence proof of this algorithm and some computational results are presented

Oracle-based optimization applied to climate model calibration

In this paper, we show how oracle-based optimization can be effectively used for the calibration of an intermediate complexity climate model. In a fully developed example, we estimate the 12 principal parameters of the C-GOLDSTEIN climate model by using an oracle- based optimization tool, Proximal-ACCPM. The oracle is a procedure that finds, for each query point, a value for the goodness-of-fit function and an evaluation of its gradient. The difficulty in the model calibration problem stems from the need to undertake costly calculations for each simulation and also from the fact that the error function used to assess the goodness-of-fit is not convex. The method converges to a Fbest fit_ estimate over 10 times faster than a comparable test using the ensemble Kalman filter. The approach is simple to implement and potentially useful in calibrating computationally demanding models based on temporal integration (simulation), for which functional derivative information is not readily available