Browsing Math Prog Technical Reports by Title
Now showing items 4059 of 101

A homotopy method for mixed complementarity problems based on the PATH solver
(1999)Mixed complementarity problems can be recast as zero finding problems for the normal map, a function that is smooth on the interior o each of the cells of a piecewise linear manifold of IR^n, called normal manifold. We ... 
Hybrid Misclassification Minimization
(1995)Given two finite point sets A and B in the ndimensional real space R^n, we consider the NPcomplete problem of minimizing the number of misclassified points by a plane attempting to divide R^n into two halfspaces such ... 
A Hybrid Newton Method for Solving Box Constrained Variational Inequalitiy Problems Via the DGap Function
(19971230)A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the Dgap function. A hybrid Netwontype method is proposed for minimizing the Dgap function. Under ... 
The IllPosed Linear Complementarity Problem
(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
(19961220)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
(19960104)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
(19980505)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
(19971013)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 ... 
kPlane Clustering
(1998)A finite new algorithm is proposed for clustering m given points in ndimensional 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
(19990215)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 CopositivePlus Normal Maps
(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
(19961203)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
(19981202) 
Machine Learning via Polyhedral Concave Minimization
(199511)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
(19990331)A linear support vector machine formulation is used to generate a fast, finitelyterminating linearprogramming algorithm for discriminating between two massive sets in ndimensional space, where the number of points can ... 
A Mathematical Model and Solution Methodologies for Optimal Process Planning on Four Axis CNC Turning Centers
(1999)A new generation of Computer Numerical Control (CNC) machines, called fouraxis 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
(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
(199807)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
(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
(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 ...