Browsing Math Prog Technical Reports by Title
Now showing items 29-48 of 101
-
Fast Equi-Partitioning of Rectangular Domains using Stripe Decomposition
(1996-02-05)This paper presents a fast algorithm that provides optimal or near optimal solutions to the minimum perimeter problem on a rectangular grid. The minimum perimeter problem is to partition a grid of size MxN into P equal ... -
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver
(1999-12)We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers. The solver ... -
Feasible Descent Algorithms for Mixed Complementarity Problems
(1998-11-11)In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, ... -
Feature Selection Via Concave Minimization and Support Vector Machines
(1998)Computational comparison is made between two feature selection approaches for finding a separating plane that discriminates between two point sets in an n-dimensional feature space that utilizes as few of the n features ... -
Feature Selection via Mathematic Programming
(1997-04)The problem of discriminating between two finite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a mathematical program with a parametric ... -
Formulating and Solving Nonlinear Programs as Mixed Complementarity Problems
(1998)We consider a primal-dual approach to solve nonlinear programming problems within AMPL modeling language, via a mixed complementarity formulation. The modeling language supplies the first order and second order derivative ... -
The GAMS Callable Program Library for Variational and Complementarity Solvers
(1994-07-19)The GAMS modeling language has recently been extended to enable the formulation of Mixed Complementarity Problems (MCP). The GAMS Callable Program Library (CPLIB) is a set of Fort ran subroutines developed as an extension ... -
Generalized Support Vector Machines
(1998)By setting apart the two functions of a support vector machine: separation of points by a nonlinear surface in the original space of patterns, and maximizing the distance between separating planes in a higher dimensional ... -
Genetic Algorithms as Multi-Coordinators in Large-Scale Optimization
(1996)We present high-level, decomposition-based algorithms for large-scale block-angular optimization problems containing integer variables, and demonstrate their effectiveness in the solution of large-scale graph partitioning ... -
Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem
(1993-01)Genetic algorithms are one example of the use of a random element within an algorithm for combinatorial optimization. We consider the application of the genetic algorithm to a particular problem, the Assembly Line Balancing ... -
Global Optimization Techniques for Mixed Complementarity Problems
(1998-07-30)We investigates the theoretical and numerical properties of two global optimization techniques for the solution of mixed complementarity problems. More precisely, using a standard semismooth Newton-type method as a basic ... -
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 n-dimensional real space R^n, we consider the NP-complete 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 D-Gap Function
(1997-12-30)A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Netwon-type method is proposed for minimizing the D-gap function. Under ... -
The Ill-Posed 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
(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
(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
(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
(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
(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 ...