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

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 ... 
Mathematical Programming in Machine Learning
(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
(19990810)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
(20020617)The minimum perimeter of a polyhex with n hexagons is 2?(12n3). 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 ... 
Maximal and minimal polyiamonds
(20020530)The minimum perimeter of an npolyiamond in whichever of ?6nor ?6n+ 1 has the same parity as n. To prove this result, we first obtain a lower bound on the perimeter by considering maximal polyiamonds (i.e., polyiamonds ... 
MinimumPerimeter Domain Assignment
(1997)For certain classes of problems defined over twodimensional domains with grid structure, optimization problems involving the assignment of grid cells to processors present a nonlinear network model for the problem of ... 
MinimumSupport Solutions of Polyhedral Concave Programs
(1997)Motivated by the successful application of mathematical programming techniques to difficult machine learning problems, we seek solutions of concave minimization problems over polyhedral sets with a minimum number of nonzero ... 
Modeliing Solution Environments for MPEC: GAMS & MATLAB
(199801)We describe several new tools for modeling MPEC problems that are built around the introduction of an MPEC model type into the GAMS language. We develop subroutines that allow such models to be communicated directly to ... 
Modeling Languages and Condor: Metacomputing for Optimization
(19981021)A generic framework for utilizing the computational resources provided by a metacomputer to concurrently solve several optimization problems generated by a modeling language is postulated. A mechanism using the Condor ... 
Modified ProjectionType Methods for Monotone Variational Inequalities
(19940524)We propose new methods for solving the variational inequality problem where the underlying function F is monotone. These methods may be viewed as projectiontype methods in which the projection direction is modified by a ...