Browsing Math Prog Technical Reports by Title
Now showing items 61-80 of 101
-
MATLAB and GAMS: Interfacing Optimization and Visualization Software
(1999-08-10)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
(2002-06-17)The minimum perimeter of a polyhex with n hexagons is 2|?(12n-3)|. 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
(2002-05-30)The minimum perimeter of an n-polyiamond in whichever of |?6n|or |?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 ... -
Minimum-Perimeter Domain Assignment
(1997)For certain classes of problems defined over two-dimensional domains with grid structure, optimization problems involving the assignment of grid cells to processors present a nonlinear network model for the problem of ... -
Minimum-Support 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
(1998-01)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
(1998-10-21)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 Projection-Type Methods for Monotone Variational Inequalities
(1994-05-24)We propose new methods for solving the variational inequality problem where the underlying function F is monotone. These methods may be viewed as projection-type methods in which the projection direction is modified by a ... -
Multi-Coordination Mehtods for Parallel Solution of Block-Angular Programs
(1995)This thesis is concerned with the parallel solution of smooth block-angular programs using multiple coordinators. The research herein extends the three phase method of Schultz and Meyer, who use barrier decomposition methods ... -
NEOS AND CONDOR: SOLVING OPTIMIZATION PROBLEMS OVER THE INTERNET
(1998-03)We discuss the use of Condor, a distributed resource management system, as a provider of computational resources for NEOS, an environment for solving optimization problems over the Internet. We also describe how problems ... -
Nonlinear Jacobi and E-Relaxation Methods for Parallel Network Optimization
(1995)In this thesis we develop an efficient decomposition method for large-scale convex cost multi-commodity network flow problems. The coupling constraints are moved to the objective function via augmented Lagrangian terms. A ... -
Nonmonotone and Perturbed Optimization
(1995)The primary purpose of this research is the analysis of nonmonotone optimization algorithms to which standard convergence analysis techniques do not apply. We consider methods that are inherently nonmonotone, as well as ... -
Nonmonotone Curvilinear Line Search Methods for Unconstrained Optimization
(1995-03-20)We present a new algorithmic framework for solving unconstrained minimization problems that incorporates a curvilinear linesearch. The search direction used in our framework is a combination of an approximate Newton direction ... -
On the Identification of Zero Variables in an Interior-Point Framework
(1998-05-19)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
(1996-07-30)This paper applies splitting techniques developed for set-valued 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 Equi-partition 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 equi-partition constraints are observed while approximately minimizing ... -
Optimal Equi-Partition of Rectangular Domains for Parallel Computation
(1995-02-28)We present an efficient method for the partitioning of rectangular domains into equi-area sub domains of minimum total perimeter. For a variety of applications in parallel computation, this corresponds to a load-balanced ... -
Optimization in Machine Learning
(1995) -
Optimized Regional Caching for On-Demand Data Delivery
(1998)Systems for on-demand delivery of large, widely-shared 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 ...