## Search

Now showing items 251-260 of 265

#### A Quadratically Convergent O(sqrt{n}L)-Iteration Algorithm for Linear Programming

(1991-08)

Recently, Ye et al. proposed a large step modification of the Mizuno-Todd-Ye predictor-corrector interior-point algorithm for linear programming. They demonstrated that the large-step algorithm maintains theO (sqrt{n}L)-iteration ...

#### A Superlinearly Convergent O(sqrt{n}L)-Iteration Algorithm for Linear Programming

(1991-07)

In this note we consider a large step modification of the Mizuno-Todd-Ye O (sqrt{n}L) predictor-corrector interior-point algorithm for linear programming. We demonstrate that the modified algorithm maintains its O ...

#### Noniterative Domain Decomposition for Second Order Hyperbolic Problems

(1993-05)

The solutions of damped second order hyperbolic problems can have smooth components which decay slowly and rough components which decay quickly. If the behavior of the solution is of interest on the time scale of the ...

#### Resolving Degeneracy in Linear Programs: Steepest Edge, Steepest Ascent, and Closest Ascent

(1991-07)

While variants of the steepest edge pivoting rule are commonly used in linear programming codes they are not known to have the theoretically attractive property of avoiding an infinite sequence of pivots at points of ...

#### A Home Health Care Routing and Scheduling Problem

(1998-06)

Consider the problem of routing a set of nurses from each individual nurse's home to a set of patients and back home again. Each patient must be visited by a single "feasible" nurse during its time window. Essentially, ...

#### Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration

(1995-05)

The Arnoldi algorithm, or iteration, is a computationally attractive technique for computing a few eigenvalues and associated invariant subspace of large, often sparse, matrices. The method is a generalization of the Lanczos ...

#### A Robust Choice of the Lagrange Multipliers in the Successive Quadratic Programming Method

(1993-09)

We study the choice of the Lagrange multipliers in the successive quadratic programming method (SQP) applied to the equality constrained optimization problem. It is known that the augmented Lagrangian SQP-Newton method ...

#### A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows

(1999-05)

In the vehicle routing problem with time windows a number of identical vehicles must be routed to and from a depot to cover a given set of customers, each of whom has a specified time interval indicating when they are ...