Now showing items 43-62 of 101

    • The Ill-Posed Linear Complementarity Problem 

      Mangasarian, Olvi L. (1995)
      A regularization of the linear complementarity problem (LCP) is proposed that leads to an exact solution, if one exists, otherwise a minimizer of a natural residual of the problem is obtained. The regularized LCP (RLCP) ...
    • Improved Generalization via Tolerant Training 

      Mangasarian, O. L.; Street, W. Nick (1996-12-20)
      Theoretical and computational justification is given for improved generalization when the training set is learned with less accuracy. The model used for this investigation is a simple linear one. It is shown that learning ...
    • Individual and Collective Prognostic Prediction 

      Wolberg, W.H.; Mangasarian, O.L.; Street, W. Nick (1996-01-04)
      The prediction of survival time or recurrence time is an important learning problem in medical domains. The Recurrence Surface Approximation (RSA) method is a natural, effective method for predicting recurrence times using ...
    • Interfaces to PATH 3.0: Design, Implementation and Usage 

      Munson, Todd S.; Ferris, Michael C. (1998-05-05)
      Several new interfaces have recently been developed requiring PATH to solve a mixed complementarity problem. To overcome the necessity of maintaining a different version of PATH for each interface, the code was reorganized ...
    • Jacobian Smoothing Methods for General Nonlinear Complementarity Problems 

      Pieper, Heiko; Kanzow, Christian (1997-10-13)
      We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementarity problem as a nonsmooth system of equations by ...
    • k-Plane Clustering 

      Mangasarian, O.L.; Bradley, P.S. (1998)
      A finite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of minimizing the sum of squares ...
    • Limit analysis of frictional block assemblies as a mathematical program with complementarity constraints 

      Tin-Loi, F.; Ferris, Michael (1999-02-15)
      The computation of the collapse loads of discrete rigid block systems, characterized by frictional (nonassociative) and tensionless contact interfaces, is formulated and solved as a special constrained optimization problem ...
    • Lineality Removal for Copositive-Plus Normal Maps 

      Ferris, Michael; Cao, Menglin (1994)
      We are concerned with solving affine variational inequalities defined by a linear map A and a polyhedral set C. Most of the existing pivotal methods for such inequalities or mixed linear complementarity problems depend on ...
    • The Linear Convergence of a Successive Linear Programming Algorithm 

      Zavriev, Sergei K.; Ferris, Michael C. (1996-12-03)
      We present a successive linear programming algorithm for solving constrained nonlinear optimization problems. The algorithm employs an Armijo procedure for updating a trust region radius. We prove the linear convergence ...
    • Linear Programming for Emergency Broadcast Systems 

      Munson, Todd; Ferris, Michael (1998-12-02)
    • Machine Learning via Polyhedral Concave Minimization 

      Mangasarian, O. L. (1995-11)
      Two fundamental problems of machine learning, misclassification minimization [10,24,18] and feature selection, [25, 29, 14] are formulated as the minimization of a concave function on the polyhedral set. Other formulations ...
    • Massive Data Discrimination via Linear Suppot Vector Machines 

      Mangasarian, O.L.; Bradley, P.S. (1999-03-31)
      A linear support vector machine formulation is used to generate a fast, finitely-terminating linear-programming algorithm for discriminating between two massive sets in n-dimensional space, where the number of points can ...
    • A Mathematical Model and Solution Methodologies for Optimal Process Planning on Four- Axis CNC Turning Centers 

      Meyer, Robert; Veeramani, Dharmaraj; Chalermdamrichai, Vatin (1999)
      A new generation of Computer Numerical Control (CNC) machines, called four-axis turning centers has emerged and has been growing in use due to its versatility. Multiple turrets and spindles, automated material handling, ...
    • Mathematical Programming Approaches to Machine Learning and Data Mining 

      Bradley, Paul S. (1998)
      Machine learning problems of supervised classification, unsupervised clustering and parsimonious approximation are formulated as mathematical programs. The feature selection problem arising in the supervised classification ...
    • Mathematical Programming for Data Mining: Formulations and Challenges 

      Mangasarian, Olvi; Fayyad, Usama; Bradley, P.S. (1998-07)
      This paper is intended to serve as an overview of a rapidly emerging research and applications area. In addition to providing a general overview, motivating the importance of data mining problems within the area of ...
    • Mathematical Programming for Data Mining: Formulations and Challenges 

      Mangasarian, O.L.; Fayyad, Usama M.; Bradley, P.S. (1998)
      This paper is intended to serve as an overview of a rapidly emerging research and applications area. in addition to providing a general overview, motivating the importance of data mining problems within the area of knowledge ...
    • Mathematical Programming in Data Mining 

      Mangasarian, O.L. (1996)
      Mathematical programming approaches to three fundamental problems will b described: feature selection clustering and robust representation. The feature selection problem considered is that of discriminating between two ...
    • Mathematical Programming in Machine Learning 

      Mangasarian, Olvi (1995)
      We describe in this work a number of central problems of machine learning and show how they can be modeled and solved as mathematical programs of various complexity
    • MATLAB and GAMS: Interfacing Optimization and Visualization Software 

      Ferris, Michael (1999-08-10)
      This document briefly describes a link between GAMS and MATLAB, both of which the user is assumed to have already. The software gives MATLAB users the ability to use all the optimization capabilities of GAMS, and allows ...
    • Maximal and minimal polyexes 

      Yang, Winston (2002-06-17)
      The minimum perimeter of a polyhex with n hexagons is 2|?(12n-3)|. To prove this result, we first obtain a lower bound on the perimeter by considering maximal polyhexes (i.e., polyhexes with a given perimeter and a maximum ...