This study presents a framework for coordinating multi-area optimal power flow with adjustable network topology in an electric power system. The modelling is accomplished in a coordinated but not a centralised fashion. Each regional operator dispatches its own generation and switches its own transmission network to reach its optimal benefits. The proposed model uses augmented Lagrangian relaxat...

This paper studies the optimization of the effective channel capacity of wideband code division multiple access (WCDMA) systems under Rayleigh fading environments. Firstly, the results for Shannon capacity of fading channels with channel side information are reviewed, where the capacity is achieved by using an optimal power control scheme. Secondly, an optimal interference threshold α0 is set f...

In this paper, the recently proposed technique of constrained optimal transport is used to interpolate between images under specified constraints. The intensity values in both images are considered as mass distributions, and a flow of minimum kinetic energy is computed to transport the initial distribution to the final one, while satisfying specified constraints on the intermediate mass as well...

It is well-known that the Lagrangian dual of an Integer Linear Program (ILP) provides the same bound as a continuous relaxation involving the convex hull of all the optimal solutions of the Lagrangian relaxation. It is less often realized that this equivalence is effective, in that basically all known algorithms for solving the Lagrangian dual either naturally compute an (approximate) optimal s...

In this paper, we investigate the production order scheduling problem derived from the production of steel sheets in Shanghai Baoshan Iron and Steel Complex (Baosteel). A deterministic mixed integer programming (MIP) model for scheduling production orders on some critical and bottleneck operations in Baosteel is presented in which practical technological constraints have been considered. The ob...

In this paper we propose an iterative method using alternating direction method of multipliers (ADMM) strategy to solve linear inverse problems in Hilbert spaces with a general convex penalty term. When the data is given exactly, we give a convergence analysis of our ADMM algorithm without assuming the existence of a Lagrange multiplier. In case the data contains noise, we show that our method ...

Action functionals describing relativistic perfect fluids are presented. Two of these actions apply to fluids whose equations of state are specified by giving the fluid energy density as a function of particle number density and entropy per particle. Other actions apply to fluids whose equations of state are specified in terms of other choices of dependent and independent fluid variables. Parti...

Smear-based variable selection strategies are well-known and commonly used by branch-and-prune interval-based solvers. They estimates the impact of the variables on each constraint of the system by using the partial derivatives and the sizes of the variable domains. Then they aggregate these values, in some way, to estimate the impact of each variable on the whole system. The variable with the ...

Augmented Lagrangian methods with convergence to second-order stationary points in which any constraint can be penalized or carried out to the subproblems are considered in this work. The resolution of each subproblem can be done by any numerical algorithm able to return approximate second-order stationary points. The developed global convergence theory is stronger than the ones known for curre...

A new approach for the effective computation of geodesic regression curves in shape spaces is presented. Here, one asks for a geodesic curve on the shape manifold that minimizes a sum of dissimilarity measures between given twoor three-dimensional input shapes and corresponding shapes along the regression curve. The proposed method is based on a variational time discretization of geodesics. Cur...