36 Result(s)
within
D. F. **
Theory of Computation
-
Chapter and Conference Paper
Verfahren zur Sicherung und Wiederherstellung von Datenbeständen
Die zunehmende Komplexität und der enorme Umfang von Datenbeständen, wie sie bei modernen Datensystemen anfallen, werden zukünfig an die Integrität der Daten Anforderungen stellen, die heute noch weitgehend un...
-
Article
Time required for reference count management in retention block-structured languages. Part 1
In this paper, two implementations of generalized block-structured languages are presented and their time requirements compared. One implementation, the lifetime stack model (LSM), implements the deletion stra...
-
Article
On the time required for reference count management in retention block-structured languages. Part 2
In this paper, two implementations of generalized block-structured languages are presented and compared for time requirements. One implementation, the Lifetime Stack Model, implements the deletion strategy wit...
-
Article
Numerical comparison of several variable-metric algorithms
The paper compares the numerical performances of the LDL′ decomposition of the BFGS variable-metric algorithm, the Dennis-Mei dogleg algorithm on the BFGS update, and Davidon's projections with the BFGS update...
-
Article
Inverse programming and the linear vector maximization problem
This paper presents a new concept of efficient solution for the linear vector maximization problem. Briefly, these solutions are efficient with respect to the constraints, in addition to being efficient with r...
-
Article
Computational experience with methods for estimating sparse hessians for nonlinear optimization
The paper compares a factorized sparse quasi-Newton update of Goldfarb with a nonfactorized BFGS sparse update of Shanno on a series of test problems, with numerical results strongly favoring the unfactorized ...
-
Article
A pathological semi-infinite program verifying Karlovitz's conjecture
In 1965, Duffin and Karlovitz approximated semi-infinite linear programs by a sequence of linear programs where thenth approximating program minimizes the objective function, subject to the firstn constraints. At...
-
Article
A note on solving nonlinear minimax problems via a differentiable penalty function
The note demonstrates that modeling a nonlinear minimax problem as a nonlinear programming problem and applying a classical differentiable penalty function to attempt to solve the problem can lead to convergen...
-
Article
An example of numerical nonconvergence of a variable-metric method
An example is given where truncation error, caused by finite computer arithmetic, leads to the BFGS variable-metric method becoming stuck, despite the approximated Hessian matrix, the gradient vector, and the ...
-
Article
Limiting Lagrangians: A primal approach
In this paper, we consider a convex program with either a finite or an infinite number of constraints and its formal Lagrangian dual. We show that either the primal program satisfies a general condition which ...
-
Article
Adding variables to quasi-Newton Hessian approximations
The paper examines methods for increasing the dimension of a quasi-Newton approximation to a Hessian matrix when the dimension of the problem is increased. A new method is proposed, and numerical results given...
-
Article
A reduced-gradient variant of Karmarkar's algorithm and null-space projections
This paper discusses the relationship between Karmarkar's new method for linear programming and the traditional simplex method. It is shown how null-space Karmarkar projections can be done using a basis matrix...
-
Article
Floorplan design of VLSI circuits
In this paper we present two algorithms for the floorplan design problem. The algorithms are quite similar in spirit. They both use Polish expressions to represent floorplans and employ the search method of si...
-
Article
Probabilistic analysis of a grou** algorithm
We study thegrou** by swap** problem, which occurs in memory compaction and in computing the exponential of a matrix. In this problem we are given a sequence ofn numbers drawn from {0,1, 2,...,m−1} with repet...
-
Chapter
The Impact of New Architectures on the Ubiquitous Operational Amplifier
The operational amplifier has steadily evolved since its inception almost fifty years ago. Sometimes though, radically new architectures appear to fill market requirements. Also, the availability of new I.C. p...
-
Article
Exact model matching of generalized state space systems
The problem of exact model matching for generalized state space (GSS) systems via pure proportional state and output feedback is studied. The following two major issues are resolved here for the first time: Th...
-
Chapter
Computational Methods For Linear Programming
The paper examines two methods for the solution of linear programming problems, the simplex method and interior point methods derived from logarithmic barrier methods. Recent improvements to the simplex algori...
-
Article
Network reliability and the probabilistic estimation of damage from fire spread
An efficient generalization of Shanthikumar's upper bound on two-terminal reliability is developed, that leads to efficient methods for the probabilistic assessment of damage from fire spread and other invasiv...
-
Article
A review of Goal Programming and its applications
This paper presents a review of the current literature on the branch of multi-criteria decision modelling known as Goal Programming (GP). The result of our indepth investigations of the two main GP methods, le...
-
Chapter and Conference Paper
Behavioural Analysis Methodology Oriented to Configuration of Parallel, Real-Time and Embedded Systems
This paper describes a methodology suitable for behavioural analysis of parallel real-time and embedded systems. The main goal of the methodology is to achieve a proper configuration of the system in order to ...
