Browsing Computational and Applied Mathematics by Title
Now showing items 120 of 777

2D and 2.5D Kirchhoff Inversion Using Upwind Finite Difference Amplitudes
(199607)Finite difference solution of the transport equation provides an efficient and accurate method for computation of 2.5D geometric acoustics amplitudes. These amplitudes can be used in simulation, migration and inversion ... 
A Block Coordinate Descent Method for MultiConvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
(201208)This paper considers block multiconvex optimization, where the feasible set and objective function are generally nonconvex but convex in each block of variables. We review some of its interesting examples and propose a ... 
A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming
(199901)We present a branch and cut algorithm that yields in finite time, a globally epsilonoptimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. ... 
A Branch Decomposition Algorithm for the pMedian Problem
(2017)In this paper, we use a branch decomposition technique to improve approximations to the pmedian problem. Starting from a support graph produced either by a combination of heuristics or by linear programming, we use dynamic ... 
A C++ Class Supporting AdjointState Methods
(200909)The adjointstate method is widely used for computing gradients in simulation driven optimization problems. The adjointstate evolution equation requires access to the entire history of the system states. There are ... 
A CharacteristicMixed Method for Contaminant Transport and Miscible Displacement
(199202)Recently, Arbogast and Wheeler have formulated and analyzed a modified method of characteristicsmixed method for approximating solutions to convectiondiffusion equations. This scheme is theoretically mass conservative ... 
A CharacteristicsMixed Finite Element Method for Advection Dominated Transport Problems
(199211)We define a new finite element method, called the characteristicsmixed method, for approximating the solution to an advection dominated transport problem. The method is based on a spacetime variational form of the ... 
A Chemical Compositional Reservoir Simulator on Distributed Memory Parallel Computers: Comparative ParallelUTCHEM Simulation Performance Study (Part I)
(199411)This paper presents the application of distributed memory parallel computers to field scale reservoir simulations using a parallel version of UTCHEM, The University of Texas Chemical Flooding Simulator. The model is a ... 
A Closer Look at Drawbacks of Minimizing Weighted Sums of Objectives for Pareto Set Generation in Multicriteria Optimization Problems
(199612)A standard technique for generating the Pareto set in multicriteria optimization problems is to minimize (convex) weighted sums of the different objectives for various different settings of the weights. However, it is ... 
A Combinatorial Abstraction of One Shortest Path Problem and Its Relationship to Greedoids
(198805)A natural generalization of the shortest path problem to arbitrary set systems is presented that captures a number of interesting problems, including the usual graphtheoretic shortest path problem and the problem of finding ... 
A Combined ShapeNewton and Topology Optimization Technique in RealTime Image Segmentation
(200407)In this paper, for solving a class of shape optimization problems, a new algorithmic concept combining shape and topological sensitivities is presented. The geometry of interest is represented by means of geometrical ... 
A Comparison of Three Total Variation Based Texture Extraction Models
(200701)This paper qualitatively compares three recently proposed models for signal/image texture extraction based on total variation minimization:the Meyer, VeseOsher, and TVL1 models. We formulate discrete versions of these ... 
A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing
(201101)Hyperspectral data processing typically demands enormous computational resources in terms of storage, computation and I/O throughputs, especially when realtime processing is desired. In this paper, we investigate a ... 
A Computational Note on Markov Decision Processes Without Discounting
(198707)The Markov decision process is treated in a variety of forms or cases: finite or infinite horizon, with or without discounting. The finite horizon cases and the case of infinite horizon with discounting have received ... 
A Computational Study of a GradientBased LogBarrier Algorithm for a Class of LargeScale SDPs
(200106)The authors of this paper recently introduced a transformation that converts a class of semidefinite programs (SDPs) into nonlinear optimization problems free of matrixvalued constraints and variables. This transformation ... 
A Computational Study of Vehicle Routing Applications
(199905)This thesis examines three specific routing applications. In the first model, the scheduling of home health care providers from their homes, to a set of patients, and then back to their respective homes, is performed both ... 
A Consortium Proposal: "The Rice Inversion Project"
(199211)This document details a proposal for an industrially sponsored consortium for research in seismic inversion at Rice University. This consortium project will be directed by Professor William W. Symes in the Department of ... 
A Convergence Theory for a Class of QuasiNewton Methods for Constrained Optimization
(198305)In this paper we develop a general convergence theory for a class of quasiNewton methods for equality constrained optimization. The theory is set in the framework of the diagonalized multiplier method defined by Tapia ... 
A Convergence Theory for the Structured BFGS Secant Method with an Application to Nonlinear Least Squares
(198705)In 1981, Dennis and Walker developed a convergence theory for structured secant methods which included the PSB and the DFP secant methods, but not the straightforward structured version of the BFGS secant method. Here we ...