Now showing items 1-20 of 101

    • Accessing Realistic Mixed Complementarity Problems within MATLAB 

      Rutherford, Thomas F.; Ferris, Michael C. (1995)
      This paper describes a suite of programs that allow realistic complementarity problems to be accessed from within the MATLAB programming environment. The suite of programs uses data generated from the GAMS/MCP library and ...
    • Algorithms and Environments for Complementarity 

      Munson, Todd (2000)
      Complementarity problems arise in a wide variety of disciplines. Prototypical examples include theWardropian andWalrasian equilibrium models encountered in the engineering and economic disciplines and the first order ...
    • Algorithms for Complementarity Problems and Generalized Equations 

      Billups, Stephen C. (1995)
      Recent improvements in the capabilities of complementarity solvers have led to an increased interest in using the complementarity problem framework to address practical problems arising in mathematical programming, economics, ...
    • Alternating Directions Methods for the Parallel Solution of Large-Scale Block-Structured Optimization Problems 

      Kontogiorgis, Spyridon (1994)
      Prompted by advances in computer technology and the increasing confidence of decision makers in large-scale market models, practitioners of operations research are not tackling problems of increasing detail, complexity and ...
    • Arbitrary-Norm Separating Plane 

      Mangasarian, O.L. (1997)
      A plane separating two point sets in n-dimensional real space is constructed such that it minimized the sum of arbitrary-norm distances of misclassified points to the plane. In contrast the previous approaches used surrogates ...
    • Backpropagation Convergence Via Deterministic Nonmonotone Perturbed Minimization 

      Solodov, Mikhail; Mangasarian, Olvi (1994)
      The fundamental backpropagation (BP) algorithm for training artificial neural networks is cast as a deterministic nonmonotone perturbed gradient method. Under certain natural assumptions, such as the series of learning ...
    • Breast Cancer Diagnosis and Prognosis via Linear Programming 

      Wolberg, William; Street, W. Nick; Mangasarian, Olvi (1994-12-19)
      Two medical applications of linear programming are described in this paper. Specifically, linear programming-based machine learning techniques are used to increase the accuracy of objectivity of breast cancer diagnosis and ...
    • 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 ...
    • COMPLEMENTARITY PROBLEMS IN ENGINEERING MECHANICS: MODELS AND SOLUTION 

      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 ...