Solution of bounded nonlinear systems of equations using homotopies with inexact restoration

International Journal of Computer Mathematics

Volumn 80, Issue 2, 2003, Pages 211-222

  Birgin, E G ^a   Krejic N ^b   Martinez J M ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF NOVI SAD   (Serbia)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Bounded homotopies; Homotopies; Homotopy methods; Inexact restoration; Nonlinear programming; Nonlinear systems

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

HOMOTOPIES; HOMOTOPY METHODS; INEXACT RESTORATION;

NONLINEAR SYSTEMS;

EID: 28344437926     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160304672     Document Type: Article

References (25)

1. Abadie, J. and Carpentier, J. (1968). Generalization of the Wolfe reduced-gradient method to the case of nonlinear constraints. In: Fletcher, R. (Ed.), Optimization. Academic Press, New York, pp. 37-47.
2. Allgower, E. and Georg, K. (1980). Simplicial and continuation methods for approximating fixed points and solutions to systems of equations. SIAM Review, 22, 28-85.
3. Allgower, E. and Georg, K. (1989). Estimates for piecewise linear approximations of implicitly defined manifolds. Applied Mathematics Letters, 5, 1-7.
4. Allgower, E. and Georg, K. (1990). Numerical continuation methods: an introduction, Series in Computational Mathematics 13. Springer, Berlin.
5. Allgower, E. and Georg, K. (1997). Numerical path following. In: Ciarlet, P. G. and Lions, J. L. (Eds.), Handbook of Numerical Analysis, Vol. 5. North Holland, Amsterdam, pp. 3-207.
6. Friedlander, A., Gomes-Ruggiero, M. A., Kozakevich, D. N., Martinez, J. M. and Santos, S. A. (1997). Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy. Optimization Methods and Software, 8, 25-51.
7. Gomes, F. A. M., Maciel, M. C. and Martinez, J. M. (1999). Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. Mathematical Programming, 84, 161-200.
8. Lasdon, L. S. (1982). Reduced Gradient Methods, In: Powell, M. J. D. (Ed.), Nonlinear Optimization 1981. Academic Press, New York, pp. 235-242.
9. Martínez, J. M. (1998). Two-phase model algorithm with global convergence for nonlinear programming. Journal of Optimization Theory and Applications, 96, 397-436.
10. Martinez, J. M. (2001). Inexact-restoration methods with Lagrangian tangent decrease and a new merit function for nonlinear programming. Journal of Optimization Theory and Applications, 111, 39-58.
11. Martínez, J. M. and Pilotta, E. A. (2000). Inexact-restoration algorithm for constrained optimization. Journal of Optimization Theory and Applications, 104, 135-163.
12. Miele, A., Huang, H. Y. and Heideman, J. C. (1969). Sequential gradient-restoration algorithm for the minimization of constrained functions, ordinary and conjugate gradient version. Journal of Optimization Theory and Applications, 4, 113-246.
13. Miele, A., Levy, A. V. and Cragg, E. E. (1971). Modifications and extensions of the conjugate-gradient restoration algorithm for mathematical programming problems. Journal of Optimization Theory and Applications, 7, 450-472.
14. Paloschi, J. R. (1995). Bounded homotopies to solve systems of algebraic nonlinear equations. Computers and Chemical Engineering, 19, 1243-1254.
15. Paloschi, J. R. (1997). Bounded homotopies to solve systems of sparse of algebraic nonlinear equations. Computers and Chemical Engineering, 21, 531-541.
16. Paloschi, J. R. (1998). Using sparse bounded homotopies in the SPEEDUP simulation package. Computers and Chemical Engineering, 9, 1181-1187.
17. Rheinboldt, W. C. (2000). Numerical continuation methods: a perspective. Journal of Computational and Applied Mathematics, 124, 229-244.
18. Rheinboldt, W. C. and Burkardt, J. V. (1983). A locally parametrized continuation process. ACM Transactions on Mathematical Software, 9, 215-235.
19. Rosen, J. B. (1960). The gradient projection method for nonlinear programming, part 1, linear constraints. SIAM Journal on Applied Mathematics, 8, 181-217.
20. Rosen, J. B. (1961). The gradient projection method for nonlinear programming, part 2, nonlinear constraints. SIAM Journal on Applied Mathematics, 9, 514-532.
21. Seader, J. D., Kuno, M., Lin, W., Johnson, S., Unsworth, K. and Wiskin, J. (1990). Mapped continuation methods for computing all solutions to general systems of nonlinear equations. Computers and Chemical Engineering, 14, 71-85.
22. Tanskanen, J. and Pohjola, V. J. (2000). A robust method for predicting state profiles in a reactive distillation. Computers and Chemical Engineering, 24, 81-88.
23. Tanskanen, J. and Pohjola, V. J. (2000). Minimum internal recycle in nonideal homogeneous multicomponent distillation. Chemical Engineering Science, 55, 2713-2726.
24. Watson, L. T., Billups, S. C. and Morgan, A. P. (1987). Algorithm 652 HOMPACK: A suite of codes for globally convergent homotopy algorithms. ACM Transactions on Mathematical Software, 13, 281-310.
25. Watson, L. T., Sosonkina, M., Melville, R. C., Morgan, A. P. and Walker, H. F. (1997). Algorithm 777. HOMPACK90: A suite of Fortran 90 codes for globally convergent homotopy algorithms. ACM Transactions on Mathematical Software, 23, 514-549.