Iron (2+ and 3+) is believed to transfer through the three-fold channels in the ferritin shell during iron deposition and release in animal ferritins. However, the rate of iron transit in and out through these channels has not been reported. The recent synthesis of [Fe(CN)6]3-, Prussian Blue (PB) and desferrioxamine (DES) all trapped within the horse spleen ferritin (HoSF) interior makes these ...

Interior-point methods possess strong theoretical properties and have been successfully applied to a wide variety of linear and nonlinear programming applications. This paper presents a class of algorithms, based on interior-point methodology, for performing regularized maximum likelihood reconstructions on 3-D emission tomography data. The algorithms solve a sequence of subproblems that conver...

Abstract The electrical energy grid is currently experiencing a paradigm shift in control. In the future, small and decentralized resources will have to responsibly perform control tasks like frequency or voltage For many use cases, scheduling of necessary. multi-dimensional discrete case–e.g., for step-controlled devices–this an NP-hard problem if some sort intermediate buffer involved. System...

In this paper we present several \infeasible-start" path-following and potential-reduction primal-dual interior-point methods for nonlinear conic problems. These methods try to nd a recession direction of the feasible set of a self-dual homogeneous primal-dual problem. The methods under consideration generate an-solution for an-perturbation of an initial strictly (primal and dual) feasible prob...

In this paper we propose a new large-update primal-dual interior point algorithm for P∗( ) linear complementarity problems (LCPs). We generalize Bai et al.’s [A primal-dual interior-point method for linear optimization based on a new proximity function, Optim. Methods Software 17(2002) 985–1008] primal-dual interior point algorithm for linear optimization (LO) problem to P∗( ) LCPs. New search ...

we present an improved version of a full nesterov-todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (bull. iranian math. soc.,40(3), 541-564, (2014)). in the earlier version, each iteration consistedof one so-called feasibility step and a few -at most three -centering steps. here, each iteration consists of only a feasibilitystep. thus, the new alg...

We discuss a finite method of feasible directions for linear programs. The method begins with a BFS (basic feasible solution) and constructs a profitable direction by combining the updated columns of several nonbasic variables eligible to enter. Moving in this direction as far as possible, while retaining feasibility, leads to a point which is not in general a basic solution of the original pro...

Some Jordan algebras were proved more than a decade ago to be an indispensable tool in the unified study of interior-point methods. By using it, we generalize the infeasible interiorpoint method for linear optimization of Roos [SIAM J. Optim., 16(4):1110–1136 (electronic), 2006] to symmetric optimization. This unifies the analysis for linear, second-order cone and semidefinite optimizations.

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim., 16(4):1110– 1136, 2006). We introduce a special self-regular proximity to induce the feasibility step and to verify quadratic convergence. The result of polynomial complexity coincides with the best-known iteration bound for infeasib...

Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...