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

Backpropagation Convergence Via Deterministic Nonmonotone Perturbed Minimization
(1994)The fundamental backpropagation (BP) algorithm for training artificial neural networks is cast as a deterministic nonmonotone perturbed gradient method. Under certain natural assumptions, such as the series of learning ... 
Breast Cancer Diagnosis and Prognosis via Linear Programming
(19941219)Two medical applications of linear programming are described in this paper. Specifically, linear programmingbased machine learning techniques are used to increase the accuracy of objectivity of breast cancer diagnosis and ... 
Cancer Diagnosis and Prognosis Via LinearProgrammingBased Machine Learning
(1994)The purpose of the research is twofold. The first purpose is the development of machine learning methods based on linear programming. These advances come in the form of both novel learning algorithms and generalizationimprovement ... 
Case Studies in Complementarity: Improving Model Formulation
(19981109)Over the past several years, many practitioners have been formulating nonlinear variational inequalities as mixed complementarity problems within modeling languages such as GAMS and AMPL. Sometimes the models generated ... 
ChunkingSynthetic Approaches to LargeScale Kernel Machines
(2000)We consider a kernelbased approach to nonlinear classification that combines the generation of ?synthetic? points (to be used in the kernel) with ?chunking? (working with subsets of the data) in order to significantly ... 
A Class of Smoothing Functions for Nonlinear and Mixed Complementarity Problems
(199408)We propose a class of parametric smooth functions that approximate the fundamental plus function, (x)+ =max {0,x}, by twice integrating a probability density function. This leads to classes of smooth parametric nonlinear ... 
Clustering via Concave Minimization
(1996)The problem of assigning m points in the ndimensional real space R^n to k clusters is formulated as that of determining k centers in R^n such that the sum of distance of each point to the nearest center in minimized. If ... 
Complementarity and Related Problems: a Survey
(19981123)This survey gives an introduction to some of the recent developments in the fields of complementarity and related problems. After presenting two typical examples and the basic existence and uniqueness results, we focus on ... 
COMPLEMENTARITY PROBLEMS IN ENGINEERING MECHANICS: MODELS AND SOLUTION
(1999)A large class of problems in engineering mechanics involves a socalled ?complementarity? relationship representing the orthogonality of two signconstrained vectors. Typical instances are plasticity laws and contactlike ... 
Complementarity Problems in GAMS and the PATH Solver
(19980925)A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton?s method. In this paper, we describe ... 
Complementarity Problems in GAMS and the PATH Solver
(19980925)A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton's method. In this paper, we describe ... 
Computing Wardropian Equilibria
(199805)This note considers alternative methods for computingWadropian (traffic network) equilibria using a multicommodity formulation in nonlinear program and complementarity formats. These methods compute exact equilibria, ... 
Crash Techniquees for LargeScale Complementarity Problems
(1995)Most Newtonbased solver for complementarity problems converge rapidly to a solution once they are close to the solution point and the correct active set has been found. We discuss the design and implementation of crash ... 
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 ...