Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
In a recent paper, Birgin, Floudas and MartÃnez introduced an augmented Lagrangian method for global optimization. In their approach, augmented Lagrangian subproblems are solved using the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$\alpha $$</EquationSource> </InlineEquation> <Emphasis Type="SmallCaps">BB method and convergence to global minimizers was obtained assuming feasibility of the original problem. In the present research, the algorithm mentioned above will be improved in several crucial aspects. On the one hand, feasibility of the problem will not be required. Possible infeasibility will be detected in finite time by the new algorithms and optimal infeasibility results will be proved. On the other hand, finite termination results that guarantee optimality and/or feasibility up to any required precision will be provided. An adaptive modification in which subproblem tolerances depend on current feasibility and complementarity will also be given. The adaptive algorithm allows the augmented Lagrangian subproblems to be solved without requiring unnecessary potentially high precisions in the intermediate steps of the method, which improves the overall efficiency. Experiments showing how the new algorithms and results are related to practical computations will be given. Copyright Springer Science+Business Media New York 2014
