The Two-Stage Feasible Directions Method for Non-Linear Programming Problems
Abstract
We present a feasible direction algorithm, based on
duality concepts, for the solution of the non-linear programming problem with equality and inequality constraints.
At each iteration a descent direction is defined, by modifying it, a feasible and descent direction is obtained. The linear search procedure assures the global convergence of the method, and the feasibility of all the iterates.We prove the global eonvergence of the algorithm, and show the results obtained in the resolution of some test problems.
duality concepts, for the solution of the non-linear programming problem with equality and inequality constraints.
At each iteration a descent direction is defined, by modifying it, a feasible and descent direction is obtained. The linear search procedure assures the global convergence of the method, and the feasibility of all the iterates.We prove the global eonvergence of the algorithm, and show the results obtained in the resolution of some test problems.
Full Text:
PDFAsociación Argentina de Mecánica Computacional
Güemes 3450
S3000GLN Santa Fe, Argentina
Phone: 54-342-4511594 / 4511595 Int. 1006
Fax: 54-342-4511169
E-mail: amca(at)santafe-conicet.gov.ar
ISSN 2591-3522