## Search

Now showing items 1-10 of 19

#### On Numerical Solution of the Maximum Volume Ellipsoid Problem

(2001-08)

In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R n defined by a finite set of affine inequalities. Our goal is to design a ...

#### On the stationary points of the seismic reflection tomography and differential semblance functionals in laterally homogeneous media

(2001-09)

This paper concerns the determination of the reference medium (velocity model) in reflection seismology by optimization. Several objective functionals have been proposed, that attain their minimum or maximum at the correct ...

#### A Linear-Time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances

(2001-06)

We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry ...

#### Solving the Double Digestion Problem as a Mixed-Integer Linear Program

(2001-08)

The double digestion problem for DNA restriction mapping is known to be NP-complete. Several approaches to the problem have been used including exhaustive search, simulated annealing, branch-and-bound. In this paper, we ...

#### On the Matrix Cuts of Lovász and Schrijver and Their Use in Integer Programming

(2001-03)

An important approach to solving many discrete optimization problems is to associate the discrete set (over which we wish to optimize) with the 0-1 vectors in a given polyhedron and to derive linear inequalities valid for ...

#### The Steepest Descent Minimization of Double-Well Stored Energies Does Not Yield Vectorial Microstructures

(2001-03)

We prove that the Steepest Descent algorithm applied to the minimization of total stored energies with rank-one related rotationally symmetric energy wells does not produce relaxing vectorial microstructures with non-trivial ...

#### On Characterizing Graphs with Branchwidth at Most Four

(2001-04)

There are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their brachwidth. In working to characterize the class of graphs with brachwidth at most four beta4 we have ...

#### Comparison of Two Sets of First-order Conditions as Bases of Interior-Point Newton Methods for Optimization with Simple Bounds

(2001-06)

In this paper, we compare the behavior of two Newton interior-point methods derived from two different first-order necessary conditions for the same nonlinear optimization problem with simple bounds. One set of conditions ...

#### A Geometric Build-Up Algorithm for Soving the Molecular Distance Geometry Problem with Sparse Distance Data

(2001-08)

Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate ...

#### An Efficient Algorithm for Calculating the Heat Capacity of a Large-scale Molecular System

(2001-02)

We present an efficient algorithm for computing the heat capacity of a large-scale molecular system. The new algorithm is based on a special Gaussian quadrature whose abscissas and weights are obtained by a simple Lanczos ...