Interfaces to PATH 3.0: Design, Implementation and Usage

Authors:
Michael C. Ferris;Todd S. Munson
Affiliations:
Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, Wisconsin 53706. ferris@cs.wisc.edu;Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, Wisconsin 53706. tmunson@cs.wisc.edu
Venue:
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Year:
1999

Citing 13
Cited 11

A practical anti-cycling procedure for linearly constrained optimization

Mathematical Programming: Series A and B
A Block-LU update for large-scale linear programming

SIAM Journal on Matrix Analysis and Applications
Normal maps inducted by linear transformations

Mathematics of Operations Research
Nonmonotone stabilization methods for nonlinear equations

Journal of Optimization Theory and Applications
Global convergence of damped Newton's method for nonsmooth equations via the path search

Mathematics of Operations Research
Robust solution of mixed complementary problems

Robust solution of mixed complementary problems
A class of smoothing functions for nonlinear and mixed complementarity problems

Computational Optimization and Applications
Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++

ACM Transactions on Mathematical Software (TOMS)
Algorithms for complementarity problems and generalized equations

Algorithms for complementarity problems and generalized equations
QPCOMP: a quadratic programming based solver for mixed complementarity problems

Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A Comparison of Large Scale Mixed Complementarity Problem Solvers

Computational Optimization and Applications
Applied General Equilibrium Modeling with MPSGE as a GAMS Subsystem: AnOverview of the Modeling Framework and Syntax

Computational Economics - Special issue on programming languages
Improving the Robustness of Complementarity Solvers Using Proximal Perturbations

Improving the Robustness of Complementarity Solvers Using Proximal Perturbations

NEOS and Condor: solving optimization problems over the Internet

ACM Transactions on Mathematical Software (TOMS)
Global Optimization Techniques for Mixed Complementarity Problems

Journal of Global Optimization
A hard-constraint time-stepping approach for rigid multibody dynamics with joints, contact, and friction

Proceedings of the 2003 conference on Diversity in computing
A Mixed Complementarity-Based Equilibrium Model of Natural Gas Markets

Operations Research
Optimization and dynamical systems algorithms for finding equilibria of stochastic games

Optimization Methods & Software
Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
A projected---gradient interior---point algorithm for complementarity problems

Numerical Algorithms
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P0-function

Journal of Global Optimization
Propagation of Data Error and Parametric Sensitivity in Computable General Equilibrium Models

Computational Economics
Integrating complementarity into the 2D displacement discontinuity boundary element method to model faults and fractures with frictional contact properties

Computers & Geosciences
Numerical methods for linear complementarity problems in physics-based animation

ACM SIGGRAPH 2013 Courses

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several new interfaces have recently been developed requiring PATH tosolve a mixed complementarity problem. To overcome the necessity of maintaining a different version of PATH for each interface, the codewas reorganized using object-oriented design techniques. At the same time, robustness issues were considered and enhancements 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 madeand compare the results obtained from PATH 2.9 to the new version.