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

A Direct Search Algorithm for Optimization with Noisy Function Evaluations
(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 ... 
Distributed Genetic Algorithms for Partitioning Uniform Grids
(1996)In this thesis the author presents a new method for partitioning general large uniform 5point grids into subdomains of given areas having minimum total perimeter. For applications in scientific computing in parallel ... 
A DynamicProgramming Heuristic for Regular GridGraph Partitioning
(20001115)Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. These earlier methods differed in the domains of application ... 
An eRelaxation Algorithm for Convex Network Flow Problems
(1995)A relaxation method for separable convex network flow problems is developed that is wellsuited for problems with large variation in the magnitude of the nonlinear cost terms. The arcs are partitioned into two sets, one ... 
ENGINEERING AND ECONOMIC APPLICATIONS OF COMPLEMENTARITY PROBLEMS
(1995)This paper gives an extensive documentation of applications of finitedimensional nonlinear complementarity problems in engineering and equilibrium modeling. For most applications, w describe the problem briefly, state the ... 
Error Bounds for Nondifferentiable Convex Inequalities under a Strong Slater Constraint Qualification
(199607)A global error bound is given on the distance between an arbitrary point in the ndimensional real space R^n and its projection on a nonempty convex set determined by m convex, possibly nondifferentiable, inequalities. The ... 
Exact Penalty Functions for Mathematical Programs with Linear Complementarity Constraints
(1996)We establish a new general exact penalty function result for a constrained optimization problem and apply this result to a mathematical program with linear complementarity constraints. 
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
(1998)Diverse problems in optimization, engineering, and exonomics have natural formulations in terms of complementarity conditions, which state (in their simplest form) that either a certain nonnegative variable must be zero ... 
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
(1998)Diverse problems in optimization, engineering, and economics have natural formulations in terms of complementarity conditions, which state (in their simplest form) that either a certain nonnegative variable must be zero ... 
Fast EquiPartitioning of Rectangular Domains using Stripe Decomposition
(19960205)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 CondorPVM Mixed Integer Programming Solver
(199912)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
(19981111)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 welldefined 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 ndimensional feature space that utilizes as few of the n features ... 
Feature Selection via Mathematic Programming
(199704)The problem of discriminating between two finite point sets in ndimensional 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 primaldual 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
(19940719)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 MultiCoordinators in LargeScale Optimization
(1996)We present highlevel, decompositionbased algorithms for largescale blockangular optimization problems containing integer variables, and demonstrate their effectiveness in the solution of largescale graph partitioning ... 
Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem
(199301)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
(19980730)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 Newtontype method as a basic ...