Now showing items 8-27 of 101

    • Cancer Diagnosis and Prognosis Via Linear-Programming-Based Machine Learning 

      Street, W. Nick (1994)
      The purpose of the research is twofold. The first purpose is the development of machine learning methods based on linear programming. These advances come in the form of both novel learning algorithms and generalization-improvement ...
    • Case Studies in Complementarity: Improving Model Formulation 

      Munson, Todd; Ferris, Michael (1998-11-09)
      Over the past several years, many practitioners have been formulating nonlinear variational inequalities as mixed complementarity problems within modeling languages such as GAMS and AMPL. Sometimes the models generated ...
    • Chunking-Synthetic Approaches to Large-Scale Kernel Machines 

      Meyer, Robert; Gonzalez-Castano, Francisco (2000)
      We consider a kernel-based approach to nonlinear classification that combines the generation of ?synthetic? points (to be used in the kernel) with ?chunking? (working with subsets of the data) in order to significantly ...
    • A Class of Smoothing Functions for Nonlinear and Mixed Complementarity Problems 

      Mangasarian, Olvi; Chen, Chunhui (1994-08)
      We propose a class of parametric smooth functions that approximate the fundamental plus function, (x)+ =max {0,x}, by twice integrating a probability density function. This leads to classes of smooth parametric nonlinear ...
    • Clustering via Concave Minimization 

      Street, W.N.; Bradley, P.S.; Mangasarian, O.L. (1996)
      The problem of assigning m points in the n-dimensional real space R^n to k clusters is formulated as that of determining k centers in R^n such that the sum of distance of each point to the nearest center in minimized. If ...
    • A comparison of two algorithms for solving closed crack problems 

      Ferris, Micheal; De Bremaecker, Jean-Claude (2000-01)
    • Complementarity and Related Problems: a Survey 

      Kanzow, Christian; Ferris, Michael (1998-11-23)
      This survey gives an introduction to some of the recent developments in the fields of complementarity and related problems. After presenting two typical examples and the basic existence and uniqueness results, we focus on ...

      Ferris, Michael; Tin-Loi, F. (1999)
      A large class of problems in engineering mechanics involves a so-called ?complementarity? relationship representing the orthogonality of two sign-constrained vectors. Typical instances are plasticity laws and contact-like ...
    • Complementarity Problems in GAMS and the PATH Solver 

      Munson, Todd; Ferris, Michael (1998-09-25)
      A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton?s method. In this paper, we describe ...
    • Complementarity Problems in GAMS and the PATH Solver 

      Ferris, Michael C.; Munson, Todd S. (1998-09-25)
      A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton's method. In this paper, we describe ...
    • Computing Wardropian Equilibria 

      Rutherford, Thomas; Meeraus, Alexander; Ferris, Michael (1998-05)
      This note considers alternative methods for computingWadropian (traffic network) equilibria using a multicommodity formulation in nonlinear program and complementarity formats. These methods compute exact equilibria, ...
    • Crash Techniquees for Large-Scale Complementarity Problems 

      Ferris, Michael C.; Dirkse, Steven P. (1995)
      Most Newton-based solver for complementarity problems converge rapidly to a solution once they are close to the solution point and the correct active set has been found. We discuss the design and implementation of crash ...
    • A Direct Search Algorithm for Optimization with Noisy Function Evaluations 

      Ferris, Michael C.; Anderson, Edward J. (1996)
      We consider the unconstrained optimization of a function when each function evaluation is subject to a random noise.We assume that there is some control over the variance of the noise term, in the sense that additional ...
    • Distributed Genetic Algorithms for Partitioning Uniform Grids 

      Christou, Ioannis T. (1996)
      In this thesis the author presents a new method for partitioning general large uniform 5-point grids into sub-domains of given areas having minimum total perimeter. For applications in scientific computing in parallel ...
    • A Dynamic-Programming Heuristic for Regular Grid-Graph Partitioning 

      Meyer, Robert; Donaldson, William (2000-11-15)
      Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. These earlier methods differed in the domains of application ...
    • An e-Relaxation Algorithm for Convex Network Flow Problems 

      Zakarian, Armand; Meyer, Robert R.; De Leone, Renato (1995)
      A relaxation method for separable convex network flow problems is developed that is well-suited for problems with large variation in the magnitude of the nonlinear cost terms. The arcs are partitioned into two sets, one ...

      Pang, J.S.; Ferris, Michael (1995)
      This paper gives an extensive documentation of applications of finite-dimensional nonlinear complementarity problems in engineering and equilibrium modeling. For most applications, w describe the problem briefly, state the ...
    • Error Bounds for Nondifferentiable Convex Inequalities under a Strong Slater Constraint Qualification 

      Mangasarian, O.L. (1996-07)
      A global error bound is given on the distance between an arbitrary point in the n-dimensional real space R^n and its projection on a nonempty convex set determined by m convex, possibly nondifferentiable, inequalities. The ...
    • Exact Penalty Functions for Mathematical Programs with Linear Complementarity Constraints 

      Pang, J.S.; Mangasarian, O.L. (1996)
      We establish a new general exact penalty function result for a constrained optimization problem and apply this result to a mathematical program with linear complementarity constraints.
    • Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers 

      Gay, David; Fourer, Robert; Ferris, Michael (1998)
      Diverse problems in optimization, engineering, and exonomics have natural formulations in terms of complementarity conditions, which state (in their simplest form) that either a certain non-negative variable must be zero ...