Sharif Digital Repository

Exact linear search algorithm recently have been proposed in the literature by Byrd, Lopez-Calvaz and Nocedal for solving nonlinear programming problems. Line search algorithms for nonlinear programming problems must include safeguards to have global convergence properties. We explain an exact penalization approach that extends the class of problems that can be solved with line search SQP methods. In the algorithm, the penalty parameter is adjusted at every iteration to ensure sufficient progress in linear feasibilility and to promote acceptance of the step. A trust region is used to assist in the determination of the penalty parameter. It is shown that the algorithm enjoys favorable... 

There are many limitations to determine relationships within biological systems. Among the limitations of these systems, one can consider the lack of sufficient information about them, such as the complete knowledge of many networks, the lack of reaction information, the complexity of the analysis of these reactions, etc. One of the methods to analyze these systems is called flux balance analysis. This method consists of three parts: objective function, equal constraints and unequal constraints. Among the features available in this method, we can mention less need for experimental information and no need for high processing systems. In order to determine the objective functions in this...