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

On the Identification of Zero Variables in an InteriorPoint Framework
(19980519)We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a new, computationally inexpensive technique that is ... 
Operator Splitting Methods for Monotone Affine Variational Inequalities, with Parallel Application to Optimal Control
(19960730)This paper applies splitting techniques developed for setvalued maximal monotone operators to monotone affine variational inequalities, including as a special case the classical linear complementarity problem. We give a ... 
Optimal and Asymptotically Optimal Equipartition of Rectangular Domains via Stripe Decomposition
(1995)We present an efficient method for assigning any number of processors to tasks associated with the cells of a rectangular uniform grid. Load balancing equipartition constraints are observed while approximately minimizing ... 
Optimal EquiPartition of Rectangular Domains for Parallel Computation
(19950228)We present an efficient method for the partitioning of rectangular domains into equiarea sub domains of minimum total perimeter. For a variety of applications in parallel computation, this corresponds to a loadbalanced ... 
Optimization in Machine Learning
(1995) 
Optimized Regional Caching for OnDemand Data Delivery
(1998)Systems for ondemand delivery of large, widelyshared data can use several techniques to improve cost/performance, including: multicast data delivery, segmented data delivery, and regional (or proxy) servers that cache ... 
Optimizing the Delivery of Radiation Therapy to Cancer Patients
(1998)In the field of radiation therapy, much of the research is aimed at developing new innovative techniques for treating cancer patients with radiation. In recent years, new treatment machines have been developed that provide ... 
Parsimonious Least Norm Approximation
(1997)A theoretically justifiable fast finite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax=b+p, where the corruption p is due to noise or error in ... 
Parsimonious Side Propagation
(1997)A fast parsimonious linearprogrammingbased algorithm for training neural networks is proposed that suppresses redundant features while using a minimal number of hidden units. This is achieved by propagating sideways to ... 
A Pathsearch Damped Newton Method for Computing General Equilibria
(199404)Computable general equilibrium models and other types of variational inequalities play a key role in computational economics. This paper describes the design and implementation of a pathsearchdamped Newton method for ... 
Polyhedral Boundary Projection
(1997)We consider the problem of projecting a point in a polyhedral set onto the boundary of the set using an arbitrary norm for the projection. Two types of polyhedral sets, one defined by a convex combination of k points in ... 
Preprocessing Complementarity Problems
(1999)Preprocessing techniques are extensively used by linear and integer programming communities as a means to improve model formulation by reducing size and complexity. Adaptations and extension of these methods for use within ... 
Projection Support Vector Machines
(2000)Largescale classification is a very active research line in data mining. It can be applied to problems like credit card fraud detection or contentbased document browsing. In recent years, several efficient algorithms for ... 
QPCOMP: A Quadratic Programming Based Solver for Mixed Complementarity Problems
(19960207)QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on NE/SQP method of Pang and Gabriel [14], this algorithm represents a ... 
Regularized Linear Programs with Equilibrium Constraints
(1997)We consider an arbitrary linear program with equilibrium constrains (LPEC) that may possibly be infeasible or have an unbounded objective function. We regularize the LPEC by perturbing it in a minimal way so that the ... 
Robust path choice in networks with failures
(1997)The problem of adaptive routing in a network with failures is considered. The network may be in one of finitely many states characterized by different travel times along the arcs, and transitions between the states occur ... 
ROBUST SOLUTION OF MIXED COMPLEMENTARITY PROBLEMS
(1994)This thesis is concerned with algorithms and software for the solution of the Mixed Complementarity Problem, or MCP. The MCP formulation is useful for expressing systems of nonlinear inequalities and equations; the ... 
The Semismooth Algorithm for Large Scale Complementarity Problems
(19990618)Complementarity solvers are continually being challenged by modelers demanding improved reliability and scalability. Building upon a strong theoretical background, the semismooth algorithm has the potential to meet both ... 
Smooth Methods of Multipliers for Complementarity Problems
(199802)This paper describes several methods for solving nonlinear complementarity problems. A general duality framework for pairs of monotone operators is developed and then applied to the monotone complementarity problem., ... 
Smoothing Methods in Mathematical Programming
(1995)A class of parametric smooth functions that approximate the fundamental plus function, (x)+=max {0,x}, is obtained by twice integrating a probability density function. By means of this approximation, linear and convex ...