Browsing CS Technical Reports by Author "Ferris, Michael C"
Now showing items 1-20 of 22
-
Characterization of Solution Sets of Convex Programs
Burke, JV; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1989)This paper gives several characterizations of the solution set of convex programs. No differentiability of the functions involved in the problem definition is assumed. The result is a generalization of the results given ... -
Convergence of Infeasible Interior-Point Algorithms from Arbitrary Starting Points
Billups, Stephen C; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Error Bounds and Strong Upper Semicontinuity for Monotone Affine Variational Inequalities
Ferris, Michael C; Mangasarian, Olvi L (University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Finite Perturbation of Convex Programs
Ferris, Michael C; Mangasarian, Olvi L (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
A Gauss-Newton Method for Convex Composite Optimization
Burke, JV; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1993) -
A Genetic Algorithm for Database Query Optimization
Bennett, Kristin P; Ferris, Michael C; Ioannidis, Yannis E (University of Wisconsin-Madison Department of Computer Sciences, 1991) -
A Genetic Algorithm for the Assembly Line Balancing Problems
Anderson, Edward J; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Globally Convergent Methods for Nonlinear Equations
Ferris, Michael C; Lucidi, S (University of Wisconsin-Madison Department of Computer Sciences, 1991) -
An Interior Point Algorithm for Monotone Affine Variational Inequalities
Cao, Menglin; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Iterative Linear Programming Solution of Convex Programs
Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
MCPLIB: A Collection of Nonlinear Mixed Complementarity Problems
Dirkse, Steven P; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1994) -
Minimum Principle Sufficiency
Ferris, Michael C; Mangasarian, Olvi L (University of Wisconsin-Madison Department of Computer Sciences, 1989)We characterize the property of obtaining a solution to a convex program by minimizing over the feasible region a linearization of the objective function at any of its solution points (Minimum Principle Sufficiency). For ... -
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
Ferris, Michael C; Pang, JS (University of Wisconsin-Madison Department of Computer Sciences, 1994) -
Parallel Constraint Distribution
Ferris, Michael C; Mangasarian, Olvi L (University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Parallel Constraint Distribution in Convex Quadratic Programming
Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Parallel Solution of Extremely Large Knapsack Problems
Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1989)We shall describe a parallel algorithm for solving the knapsack feasibility problem, also known as the subset sum problem. The use of a random branching technique is described and its implementation on a parallel processor ... -
Parallel Variable Distribution
Ferris, Michael C; Mangasarian, Olvi L (University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Partitioning Mathematical Programs for Parallel Solution
Ferris, Michael C; Horn, Jeffrey D (University of Wisconsin-Madison Department of Computer Sciences, 1994) -
The PATH Solver: A Non-Monotone Stabilization Scheme for Mixed Complementarity Problems
Dirkse, Steven P; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1993) -
A Pivotal Method for Affine Variational Inequalities
Cao, Menglin; Ferris, Michael C (University of Wisconsin-Madison Department of Computer Sciences, 1992)