Several new interfaces have recently been developed requiring PATH to solve a mixed complementarity problem. To overcome the necessity of maintaining a different version of PATH for each interface, the code was recognized using object-oriented design techniques. At the same time, robustness issues were considered and enhancement made to the algorithm. In this paper, we document the external interfaces to the PATH code and describe some of the new utilities using PATH. We then discuss the enhancements made and compare the results obtained from PATH 2.9 the new version.
Keywords for this software
References in zbMATH (referenced in 184 articles , 2 standard articles )
Showing results 181 to 184 of 184.
- Ferris, M. C.; Lucidi, S.; Roma, M.: Nonmonotone curvilinear line search methods for unconstrained optimization (1996)
- Fischer, Andreas; Kanzow, Christian: On finite termination of an iterative method for linear complementarity problems (1996)
- Chen, Chunhui; Mangasarian, O. L.: Smoothing methods for convex inequalities and linear complementarity problems (1995)
- Rutherford, Thomas F.: Extension of GAMS for complementarity problems arising in applied economic analysis (1995)