Ferris Michael C.

Michael C. Ferris

Information about the author Michael C. Ferris will soon be added to the site.
Found 16 papers in total
Limited memory solution of bound constrained convex quadratic problems arising in video games
Limited memory solution of bound constrained convex quadratic problems arising in video games
2007
We describe the solution of a bound constrained convex quadratic problem with limited...
Sampling issues for optimization in radiotherapy
Sampling issues for optimization in radiotherapy
2006
A wide variety of optimization problems and techniques are used in radiation treatment...
Slice models in general purpose modeling systems: An application to data envelopment analysis
Slice models in general purpose modeling systems: An application to data envelopment analysis
2002
Slice models are collections of mathematical programs with the same structure but...
The semismooth algorithm for large scale complementarity problems
The semismooth algorithm for large scale complementarity problems
2001
Complementarity solvers are continually being challenged by modelers demanding...
Radiosurgery treatment planning via nonlinear programming
Radiosurgery treatment planning via nonlinear programming
2003
The Gamma Knife is a highly specialized treatment unit that provides an advanced...
Robust path choice in networks with failures
Robust path choice in networks with failures
2000
The problem of adaptive routing in a network with failures is considered. The network...
FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
2001
We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an...
Partitioning mathematical programs for parallel solution
Partitioning mathematical programs for parallel solution
1998
This paper describes heuristics for partitioning a general M × N matrix into...
Genetic algorithms for combinatorial optimization: The assembly line balancing problem
Genetic algorithms for combinatorial optimization: The assembly line balancing problem
1994
Genetic algorithms are one example of the use of a random element within an algorithm...
A comparison of large scale mixed complementarity problem solvers
A comparison of large scale mixed complementarity problem solvers
1997
This paper provides a means for comparing various computer codes for solving large...
QPCOMP: A quadratic programming based solver for mixed complementarity problems
QPCOMP: A quadratic programming based solver for mixed complementarity problems
1997
QPCOMP is an extemely robust algorithm for solving mixed nonlinear complementarity...
Nonmonotone curvilinear line search methods for unconstrained optimization
Nonmonotone curvilinear line search methods for unconstrained optimization
1996
We present a new algorithmic framework for solving unconstrained minimization problems...
A pathsearch damped Newton method for computing general equilibria
A pathsearch damped Newton method for computing general equilibria
1996
Computable general equilibrium models and other types of variational inequalities play...
Parallel constraint distribution in convex quadratic programming
Parallel constraint distribution in convex quadratic programming
1994
The paper considers convex quadratic programs with large numbers of constraints. It...
On affine scaling and semi-infinite programming
On affine scaling and semi-infinite programming
1992
The authors consider an extension of the affine scaling algorithm for linear...
Finite termination of the proximal point algorithm
Finite termination of the proximal point algorithm
1991
This paper concerns the notion of a sharp minimum on a set and its relationship to the...
Papers per page: