Piecewise linear methods for nonlinear equations and optimization

Journal of Computational and Applied Mathematics

Volumn 124, Issue 1-2, 2000, Pages 245-261

  Allgower, Eugene L ^a   Georg, Kurt ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER GRAPHICS; NONLINEAR EQUATIONS; OPTIMIZATION;

LEMKE'S ALGORITHM; LINEAR COMPLEMENTARY PROBLEMS;

PIECEWISE LINEAR TECHNIQUES;

EID: 0034538701     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00427-1     Document Type: Article

References (37)

1. E.L. Allgower K. Georg Estimates for piecewise linear approximations of implicitly defined manifolds Appl. Math. Lett. 1 5 1989 1 7
2. E.L. Allgower, K. Georg, Numerical Continuation Methods: An Introduction, Series in Computational Mathematics, Vol. 13, Springer, Berlin, 1990, p. 388.
3. E.L. Allgower K. Georg Numerical path following P.G. Ciarlet J.L. Lions Handbook of Numerical Analysis, Vol. 5 1997 North-Holland Amsterdam 3 207
4. E.L. Allgower K. Georg R. Widmann Volume integrals for boundary element methods J. Comput. Appl. Math. 38 1991 17 29
5. E.L. Allgower S. Gnutzmann An algorithm for piecewise linear approximation of implicitly defined two-dimensional surfaces SIAM J. Numer. Anal. 24 1987 452 469
6. E.L. Allgower Ph.H. Schmidt An algorithm for piecewise-linear approximation of an implicitly defined manifold SIAM J. Numer. Anal. 22 1985 322 346
7. J. Bloomenthal Introduction to Implicit Surfaces 1997 Morgan Kaufmann San Francisco
8. A. Charnes Optimality and degeneracy in linear programming Econometrica 20 1952 160 170
9. R.W. Cottle Solution rays for a class of complementarity problems Math. Programming Study 1 1974 58 70
10. R.W. Cottle J.-S. Pang R.E. Stone The Linear Complementarity Problem 1992 Academic Press New York
11. H.S.M. Coxeter Discrete groups generated by reflections Ann. Math. 6 1934 13 29
12. H.S.M. Coxeter Regular Polytopes 3rd ed 1963 MacMillan New York
13. R.-X. Dai W.C. Rheinboldt On the computation of manifolds of fold points for parameter-dependent problems SIAM J. Numer. Anal. 27 1990 437 466
14. C. Dang Triangulations and Simplicial Methods Lecture Notes in Economics and Mathematical Systems 1995 Springer Berlin
15. C. Dang H. van Maaren A simplicial approach to integer programming Math. Oper. Res. 23 1998 403 415
16. G.B. Dantzig Linear Programming and Extensions 1963 Princeton University Press Princeton, NJ
17. B.C. Eaves Homotopies for the computation of fixed points Math. Programming 3 1972 1 22
18. B.C. Eaves A short course in solving equations with PL homotopies R.W. Cottle C.E. Lemke Nonlinear Programming, SIAM-AMS Proceedings, Vol. 9 1976 American Mathematical Society Providence, RI 73 143
19. B.C. Eaves A Course in Triangulations for Solving Equations with Deformations Lecture Notes in Economics and Mathematical Systems Vol. 234 1984 Springer Berlin
20. B.C. Eaves R. Saigal Homotopies for computation of fixed points on unbounded regions Math. Programming 3 1972 225 237
21. H. Freudenthal Simplizialzerlegungen von beschränkter Flachheit Ann. Math. 43 1942 580 582
22. K. Georg Approximation of integrals for boundary element methods SIAM J. Sci. Statist. Comput. 12 1991 443 453
23. P.J.J. Herings A.J.J. Talman Intersection theorems with a continuum of intersection points J. Optim. Theory Appl. 96 1998 311 335
24. A. Kirman (Ed.) Elements of General Equilibrium Analysis 1998 Blackwell Oxford
25. M. Kojima N. Megiddo T. Noma A. Yoshise A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Lecture Notes in Computer Science Vol. 538 1991 Springer Berlin
26. C.E. Lemke Bimatrix equilibrium points and mathematical programming Management Sci. 11 1965 681 689
27. C.E. Lemke J.T. Howson Equilibrium points of bimatrix games SIAM J. Appl. Math. 12 1964 413 423
28. O. Merrill, Applications and extensions of an algorithm that computes fixed points of a certain upper semi-continuous point to set mapping, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1972.
29. Yu.E. Nesterov A. Nemirovskii Interior-Point Polynomial Algorithms in Convex Programming 1993 SIAM Philadelphia, PA
30. W.C. Rheinboldt On the computation of multi-dimensional solution manifolds of parameterized equations Numer. Math. 53 1988 165 182
31. R. Saigal M.J. Todd Efficient acceleration techniques for fixed point algorithms SIAM J. Number. Anal. 15 1978 997 1007
32. H.E. Scarf The approximation of fixed points of a continuous mapping SIAM J. Appl. Math. 15 1967 1328 1343
33. H.E. Scarf T. Hansen The Computation on Economic Equilibria 1973 Yale University Press New Haven, CT
34. M.J. Todd The Computation of Fixed Points and Applications Lecture Notes in Economics and Mathematical Systems Vol. 124 1976 Springer Berlin
35. M.J. Todd Piecewise-linear homotopy algorithms for sparse systems of nonlinear equations SIAM J. Control Optim. 21 1983 204 214
36. G. van der Laan, A.J.J. Talman, Z. Yang, Existence and approximation of robust stationary points on polytopes, SIAM J. Control Optim., in preparation.
37. S.J. Wright Primal–Dual Interior-Point Methods 1997 SIAM Philadelphia, PA