ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (41)
  • optimization  (41)
  • Springer  (41)
  • 1995-1999  (41)
  • 1945-1949
  • Mathematics  (34)
  • Process Engineering, Biotechnology, Nutrition Technology  (7)
  • Nature of Science, Research, Systems of Higher Education, Museum Science
  • 1
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 295-321 
    ISSN: 1572-9397
    Keywords: multi-agent systems ; autonomous agents ; cooperation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Experiments over a variety of optimization problems indicate that scale-effective convergence is an emergent behavior of certain computer-based agents, provided these agents are organized into an asynchronous team (A-Team). An A-Team is a problem-solving architecture in which the agents are autonomous and cooperate by modifying one another's trial solutions. These solutions circulate continually. Convergence is said to occur if and when a persistent solution appears. Convergence is said to be scale-effective if the quality of the persistent solution increases with the number of agents, and the speed of its appearance increases with the number of computers. This paper uses a traveling salesman problem to illustrate scale-effective behavior and develops Markov models that explain its occurrence in A-Teams, particularly, how autonomous agents, without strategic planning or centralized coordination, can converge to solutions of arbitrarily high quality. The models also perdict two properties that remain to be experimentally confirmed: • construction and destruction are dual processes. In other words, adept destruction can compensate for inept construction in an A-Team, and vice-versa. (Construction refers to the process of creating or changing solutions, destruction, to the process of erasing solutions.) • solution quality is independent of agent-phylum. In other words, A-Teams provide an organizational framework in which humans and autonomous mechanical agents can cooperate effectively.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Potential analysis 5 (1996), S. 183-205 
    ISSN: 1572-929X
    Keywords: Elliptic equations ; Hamilton-Jacobi equations ; optimization ; rearrangements ; 35J25 ; 35J70 ; 49K20 ; 49K30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study the case of equalities in some comparison results for L 1-norm or L ∞-norm of the solutions of Dirichlet elliptic problem or Hamilton-Jacobi equations. We show that equalities are achieved only in spherically symmetric situations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 379-402 
    ISSN: 1572-9338
    Keywords: Optimal control ; stochastic control ; dynamic systems ; economics ; public-sector applications ; optimization ; budgetary policies ; monetary policy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we determine optimal budgetary and monetary policies for Austria using a small macroeconometric model. We use a Keynesian model of the Austrian economy, called FINPOL1, estimated by ordinary least squares, which relates the main objective variables of Austrian economic policies, such as the growth rate of real gross domestic product, the rate of unemployment, the rate of inflation, the balance of payments, and the ratio of the federal budget deficit to GDP, to fiscal and monetary policy instruments, namely expenditures and revenues of the federal budget and money supply. Optimal fiscal and monetary policies are calculated for the model under a quadratic objective function using the algorithm OPTCON for the optimum control of nonlinear stochastic dynamic systems. Several control experiments are performed in order to assess the influence of different kinds of uncertainty on optimal budgetary and monetary policies. Apart from deterministic optimization runs, different assumptions about parameter uncertainties are introduced; the results of these different stochastic optimum control experiments are compared and interpreted.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 287-311 
    ISSN: 1572-9338
    Keywords: Probability functions ; gradient of integral ; sensitivity analysis ; optimization ; discrete event dynamic systems ; shut-down problem ; probabilistic risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Probability functions depending upon parameters are represented as integrals over sets given by inequalities. New derivative formulas for the intergrals over a volume are considered. Derivatives are presented as sums of integrals over a volume and over a surface. Two examples are discussed: probability functions with linear constraints (random right-hand sides), and a dynamical shut-down problem with sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 3 (1997), S. 63-81 
    ISSN: 1572-9397
    Keywords: Large-step Markov chain ; optimization ; simulated annealing ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The large-step Markov chain (LSMC) approach is the most effective known heuristic for large symmetric TSP instances; cf. recent results of [Martin, Otto and Felten, 1991] and [Johnson, 1990]. In this paper, we examine relationships among (i) the underlying local optimization engine within the LSMC approach, (ii) the “kick move” perturbation that is applied between successive local search descents, and (iii) the resulting LSMC solution quality. We find that the traditional “double-bridge” kick move is not necessarily optimum: stronger local optimization engines (e.g., Lin-Kernighan) are best matched with stronger kick moves. We also propose use of an adaptive temperature schedule to allow escape from deep basins of attraction; the resulting hierarchical LSMC variant outperforms traditional LSMC implementations that use uniformly zero temperatures. Finally, a population-based LSMC variant is studied, wherein multiple solution paths can interact to achieve improved solution quality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 57 (1995), S. 217-232 
    ISSN: 1572-9338
    Keywords: Scheduling ; robotic cell ; tandem machines ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operationsn, an optimalO(n logn)-time algorithm is proposed together with the proof of optimality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 281-287 
    ISSN: 1572-9397
    Keywords: optimization ; benchmarking ; overfitting ; general and targeted methods ; method applicability ; practical relevance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Benchmark problems should be hard. True. Methods for solving problems should be useful for more than just “beating” a particular benchmark. Truer still, we believe. In this paper, we examine the worthiness of the approach consisting of concentration on a particular set of benchmark problems, an issue raised by a recent paper by Ian Gent. We find that such a methodology can easily lead to publications of limited general use as far as our ability to solve practical problems is concerned.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 243-260 
    ISSN: 1572-9338
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; latin hypercube ; optimization ; sampling ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, we provide a polynomial algorithm. For higher dimensions, we offer effective heuristic and bounding procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 47-62 
    ISSN: 1572-9397
    Keywords: tabu search ; frequency ; assignment ; constraints ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the reuse of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage larger cellular networks. This paper presents a new Tabu Search algorithm for this application. The algorithm is tested on realistic and large problem instances and compared with other methods based on simulated annealing, constraint programming and graph coloring algorithms. Empirical evidence shows that the Tabu algorithm is very competitive by giving the best solutions to the tested instances.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 48 (1997), S. 13-32 
    ISSN: 1572-9036
    Keywords: limit cycles ; vector fields ; oscillation theory ; second-order dynamic systems ; qualitative theory of dynamic systems ; phase portrait ; optimization ; 16th Hilbert Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a solution to the problem to find isolated closed trajectories of two-dimensional dynamic systems. In contrast to the method of Bendixson’s ring regions, the new method is constructive. It allows the determination of the location of closed trajectories and therefore gives an upper bound for their number. The method is based on the idea to use inherent geometrical and physical extremal properties of these trajectories to transform the problem into an optimization task (isoperimetric problem of variational calculus) that can be solved by numerical algorithms, e.g., by hillclimbing.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    BIT 36 (1996), S. 494-508 
    ISSN: 1572-9125
    Keywords: Conjugate gradient ; Lanczos ; Newton's Method ; optimization ; signal processing ; electronic structures ; differential geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Numerical analysts, physicists, and signal processing engineers have proposed algorithms that might be called conjugate gradient for problems associated with the computation of eigenvalues. There are many variations, mostly one eigenvalue at a time though sometimes block algorithms are proposed. Is there a correct “conjugate gradient” algorithm for the eigenvalue problem? How are the algorithms related amongst themselves and with other related algorithms such as Lanczos, the Newton method, and the Rayleigh quotient?
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Journal of industrial microbiology and biotechnology 17 (1996), S. 69-72 
    ISSN: 1476-5535
    Keywords: laccase ; Botrytis cinerea ; scaling up ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract After induction, seven strains ofBotrytis cinerea released into the culture broth considerable amounts of laccase in a brief production time. The set-up of a suitable production process was studied with a selected strain in a 10-L fermenter. The optimum fermentation conditions were a 3% inoculum with a high degree of sporulation, a simple medium containing 20 g L−1 of glucose and 2 g L−1 of yeast extract at pH 3.5, 2 g L−1 gallic acid as inducer, added after 2 days of growth, an agitation speed of 300 rpm, an aeration rate of 1.2 vvm and a temperature of 24°C. By optimizing the culture conditions, the enzyme activity reached 28 U ml−1 in 5 days with a specific activity of 560 U mg−1 protein. The best procedure to obtain a suitable crude enzyme preparation was concentration of the supernatant medium to 10% of the initial volume by ultrafiltration, followed by a fractional precipitation with ethanol. The optimum pH and temperature for laccase activity were 5.5 and 40°C, respectively, with syringaldazine as the substrate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 12 (1996), S. 321-346 
    ISSN: 1572-9265
    Keywords: Capillarity ; numerical approximation ; optimization ; 65Dxx ; 65Gxx ; 65K10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose an algorithm to compute an approximation of capillary surfaces in a gravitational field. This algorithm is based on a decomposition-coordination method by augmented lagrangians and the discretization is done using the finite element method. We study the convergence of the algorithm and the error of discretization for the axisymmetric case; some numerical results are given. This method can be generalized to a two-dimensional space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    ISSN: 1573-7594
    Keywords: optimization ; standard clock ; ordinal optimization ; communication network ; voice/data integration ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we apply the ideas of ordinal optimization and the technique of Standard Clock (SC) simulation to the voice-call admission-control problem in integrated voice/data multihop radio networks. This is an important problem in networking that is not amenable to exact analysis by means of the usual network modeling techniques. We first describe the use of the SC approach on sequential machines, and quantify the speedup in simulation time that is achieved by its use in a number of queueing examples. We then develop an efficient simulation model for wireless integrated networks based on the use of the SC approach, which permits the parallel simulation of a large number of admission-control policies, thereby reducing computation time significantly. This model is an extension of the basic SC approach in that it incorporates fixed-length data packets, whereas SC simulation is normally limited to systems with exponentially distributed interevent times. Using this model, we demonstrate the effectiveness of ordinal-optimization techniques, which provide a remarkably good ranking of admission-control policies after relatively short simulation runs, thereby facilitating the rapid determination of good policies. Moreover, we demonstrate that the use of crude, inaccurate analytical and simulation models can provide highly accurate policy rankings that can be used in conjunction with ordinal-optimization methods, provided that they incorporate the key aspects of system operation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 9 (1998), S. 29-48 
    ISSN: 1573-7683
    Keywords: probabilistic relaxation ; relaxation labeling ; optimization ; combining evidence and contextual classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Traditional probabilistic relaxation, as proposed by Rosenfeld, Hummel and Zucker, uses a support function which is a double sum over neighboring nodes and labels. Recently, Pelillo has shown the relevance of the Baum-Eagon theorem to the traditional formulation. Traditional probabilistic relaxation is now well understood in an optimization framework. Kittler and Hancock have suggested a form of probabilistic relaxation with product support, based on an evidence combining formula. In this paper we present a formal basis for Kittler and Hancocks probabilistic relaxation. We show that it too has close links with the Baum-Eagon theorem, and may be understood in an optimization framework. We provide some proofs to show that a stable stationary point must be a local maximum of an objective function. We present a new form of probabilistic relaxation that can be used as an approximate maximizer of the global labeling with maximum posterior probability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 28 (1996), S. 895-907 
    ISSN: 1573-8868
    Keywords: reservoir geometry ; multiple-point histogram ; geological accretion ; optimization ; flow responses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Large-scale reservoir architecture constitutes first-order reservoir heterogeneity and dietates to a large extent reservoir flow behavior. It also manifests geometric characteristics beyond the capability of traditional geostatistical models conditioned only on single-point and two-point statistics. Multiple-point statistics, as obtained by scanning a training image deemed representative of the actual reservoir, if reproduced properly provides stochastic models that better capture the essence of the heterogeneity. A “growth” algorithm, coupled with an optimization procedure, is proposed to reproduce target multiple-point histograms. The growth algorithm makes an analogy between geological accretion process and stochastic process and amounts to restricting the random path of sequential simulation at any given stage to a set of eligible nodes (immediately adjacent to a previously simulated node or sand grain). The proposed algorithm, combined with a multiple-grid approach, is shown to reproduce effectively the geometric essence of complex training images exhibiting long-range and curvilinear structures. Also, by avoiding a rigorous search for global minimum and accepting local minima, the proposed algorithm improves CPU time over traditional optimization procedures by several orders of magnitude. Average flow responses run on simulated realizations are shown to bracket correctly the reference responses of the training image.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Journal of industrial microbiology and biotechnology 17 (1996), S. 100-103 
    ISSN: 1476-5535
    Keywords: immobilized glucose isomerase ; response surface methodology ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract Production of fructose via a continuous glucose isomerization process was optimized using response surface methodology. Glucose isomerization was performed using immobilized glucose isomerase in a flow-through tubular reactor. Process factors eg pH (7.0–7.8), temperature (50–60°C), flow rate (5–17 ml min−1) and glucose content (30–50% w/w) of the feedstock solution were simultaneously tested according to a central composite experimental design. Measured responses such as % isomerization, and fructose yield (gh−1) has an excellent correlation with tested factors. The highest desirability,D, (geometric mean of % isomerization and fructose yield) was obtained when the feedstock (56–60°C) had 34–36% glucose, a pH of 7.4–7.8 and was pumped at 15 ml min−1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    ISSN: 1573-0972
    Keywords: Aspergillus niger ; cellulase ; optimization ; palm oil wastes ; xylanase
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract Optimization of enzyme production from Aspergillus niger ATCC 6275 under both submerged and solid-substrate cultivation was investigated. Results from submerged cultivation using palm oil mill effluent revealed that pretreatment of ground palm cake did not improve enzyme production. Addition of 0.60g NH4NO3/l generated maximum activity of xylanase and cellulase (CMCase). The optimum aeration rate was 1.2 v/v min. Under solid-substrate cultivation, the results indicated that heating and alkali treatment of the ground palm cake gave no further improvement in enzyme production. The optimal N-source was 2% urea. Optimal initial moisture contents for xylanase and CMCase activities were 60% and 50% respectively, with temperature optima of 30°C and 35°C, respectively. The optimal inoculum size was 1× 108 spores/g palm cake with an initial pH of 4.5–5.0. The maximum activities of xylanase (282.9U/g) and CMCase (23.8U/g) were obtained under the optimum conditions. Solid-substrate cultivation was a better method for the production of enzyme, particularly xylanase, from A. niger ATCC 6275. The application of these enzymes to decanter effluent showed the separation of oil and grease and suspended solids from the effluent. This is comparable to the result achieved from using the commercial xylase preparation Meicelase and superior to the effect of Sumyzyme.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 549-574 
    ISSN: 1573-2878
    Keywords: Boundary control ; wave and plate equations ; optimization ; nonstandard Riccati equations ; input dynamics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An optimization problem for a control system governed by an analytic generator with unbounded control actions is considered. The solution to this problem is synthesized in terms of the Riccati operator, arising from a nonstandard Riccati equation. Solvability and uniqueness of the solutions to this Riccati equation are established. This theory is applied to a boundary control problem governed by damped wave and plate equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 199-222 
    ISSN: 1573-2878
    Keywords: Routing ; optimization ; queueing systems ; robustness ; distributed algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 91 (1996), S. 695-728 
    ISSN: 1573-2878
    Keywords: Structural acoustics ; unbounded control input ; coupled wave and beam equations ; hyperbolic and parabolic-like dynamics ; trace regularity ; optimization ; Riccati equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we provide results concerning the optimal feedback control of a system of partial differential equations which arises within the context of modeling a particular fluid/structure interaction seen in structural acoustics, this application being the primary motivation for our work. This system consists of two coupled PDEs exhibiting hyperbolic and parabolic characteristics, respectively, with the control action being modeled by a highly unbounded operator. We rigorously justify an optimal control theory for this class of problems and further characterize the optimal control through a suitable Riccati equation. This is achieved in part by exploiting recent techniques in the area of optimization of analytic systems with unbounded inputs, along with a local microanalysis of the hyperbolic part of the dynamics, an analysis which considers the propagation of singularities and optimal trace behavior of the solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 339-360 
    ISSN: 1573-2878
    Keywords: Approximations ; algorithmic convergence ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In an earlier paper, the authors introduced epigraphical nesting of objective functions as a means to characterize the convergence of global optimization algorithms. Epigraphical nesting of objective functions may be looked upon as a relaxation of epigraphical convergence of objective functions, whereby one ensures that epigraphs of the approximations contain asymptotically the epigraph of the objective function of the original optimization problem. In this paper, we show that, for algorithms which seek only a stationary point, convergence can be assured by objective function approximations whose directional derivatives attain an epigraphical nesting property. We demonstrate that epigraphical nesting provides a unifying thread that ties together a number of different algorithms, including those for the solution of variational inequalities and smooth as well as nonsmooth optimization. We show that the Newton method and its variants for unconstrained optimization, successive quadratic programming methods for constrained optimization, and proximal point algorithms (deterministic and stochastic) all construct approximations in which the directional derivatives attain an epigraphical nesting property, even though the approximations themselves fail to attain such a property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 705-726 
    ISSN: 1573-2878
    Keywords: Nonlinear allocation problems ; networks ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem considered is as follows:m resources are to be allocated ton activities, with resourcei contributing linearly to the potential for activityj according to the coefficientE(i,j). The objective is to minimize some nonlinear function of the potentials. If the objective function is sufficiently well behaved, the problem can be solved in finitely many steps using the method described in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 597-607 
    ISSN: 1573-2878
    Keywords: Optimal control ; gradient flows ; optimization ; decentralized systems ; performance index
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the problem of computing the suboptimal output feedback gains of decentralized control systems is investigated. First, the problem is formulated. Then, the gradient matrices based on the index function are derived and a new algorithm is established based on some nice properties. This algorithm shows that a suboptimal gain can be computed by solving several ordinary differential equations (ODEs). In order to find an initial condition for the ODEs, an algorithm for finding a stabilizing output feedback gain is exploited, and the convergence of this algorithm is discussed. Finally, an example is given to illustrate the proposed algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 95 (1997), S. 467-499 
    ISSN: 1573-2878
    Keywords: Flight mechanics ; astrodynamics ; celestial mechanics ; Earth-to-Mars missions ; departure window ; arrival window ; optimization ; sequential gradient-restoration algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the optimal transfer of a spacecraft from a low Earth orbit (LEO) to a low Mars orbit (LMO). The transfer problem is formulated via a restricted four-body model in that the spacecraft is considered subject to the gravitational fields of Earth, Mars, and Sun along the entire trajectory. This is done to achieve increased accuracy with respect to the method of patched conics. The optimal transfer problem is solved via the sequential gradient-restoration algorithm employed in conjunction with a variable-stepsize integration technique to overcome numerical difficulties due to large changes in the gravitational field near Earth and near Mars. The optimization criterion is the total characteristic velocity, namely, the sum of the velocity impulses at LEO and LMO. The major parameters are four: velocity impulse at launch, spacecraft vs. Earth phase angle at launch, planetary Mars/Earth phase angle difference at launch, and transfer time. These parameters must be determined so that ΔV is minimized subject to tangential departure from circular velocity at LEO and tangential arrival to circular velocity at LMO. For given LEO and LMO radii, a departure window can be generated by changing the planetary Mars/Earth phase angle difference at launch, hence changing the departure date, and then reoptimizing the transfer. This results in a one-parameter family of suboptimal transfers, characterized by large variations of the spacecraft vs. Earth phase angle at launch, but relatively small variations in transfer time and total characteristic velocity. For given LEO radius, an arrival window can be generated by changing the LMO radius and then recomputing the optimal transfer. This leads to a one-parameter family of optimal transfers, characterized by small variations of launch conditions, transfer time, and total characteristic velocity, a result which has important guidance implications. Among the members of the above one-parameter family, there is an optimum–optimorum trajectory with the smallest characteristic velocity. This occurs when the radius of the Mars orbit is such that the associated period is slightly less than one-half Mars day.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 99 (1998), S. 303-330 
    ISSN: 1573-2878
    Keywords: Stability robustness bounds ; optimization ; reduced conservatism bounds ; discrete-time systems ; robust control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, existing stability robustness measures for the perturbation of both continuous-time and discrete-time systems are reviewed. Optimized robustness bounds for discrete-time systems are derived. These optimized bounds are obtained reducing the conservatism of existing bounds by (a) using the structural information on the perturbation and (b) changing the system coordinates via a properly chosen similarity transformation matrix. Numerical examples are used to illustrate the proposed reduced conservatism bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 100 (1999), S. 145-160 
    ISSN: 1573-2878
    Keywords: Nonlinear least squares ; optimization ; regularization ; KKT conditions ; rank-deficient nonlinear constraints ; rank-deficient nonlinear least-square problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In nonlinear least-square problems with nonlinear constraints, the function $$\left. {(1/2)} \right\|\left. {f_2 (x)} \right\|_2^2$$ , where f 2 is a nonlinear vector function, is to be minimized subject to the nonlinear constraints f 1(x)=0. This problem is ill-posed if the first-order KKT conditions do not define a locally unique solution. We show that the problem is ill-posed if either the Jacobian of f 1 or the Jacobian of J is rank-deficient (i.e., not of full rank) in a neighborhood of a solution satisfying the first-order KKT conditions. Either of these ill-posed cases makes it impossible to use a standard Gauss–Newton method. Therefore, we formulate a constrained least-norm problem that can be used when either of these ill-posed cases occur. By using the constant-rank theorem, we derive the necessary and sufficient conditions for a local minimum of this minimum-norm problem. The results given here are crucial for deriving methods solving the rank-deficient problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 157-174 
    ISSN: 1573-2916
    Keywords: Multiple criteria decision aid ; sorting problem ; ELECTRE TRI method ; parameters' elicitation ; inference procedure ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Given a finite set of alternatives, the sorting problem consists in the assignment of each alternative to one of the pre-defined categories. In this paper, we are interested in multiple criteria sorting problems and, more precisely, in the existing method ELECTRE TRI. This method requires the elicitation of parameters (weights, thresholds, category limits,...) in order to construct the Decision Maker's (DM) preference model. A direct elicitation of these parameters being rather difficult, we proceed to solve this problem in a way that requires from the DM much less cognitive effort. We elicit these parameters indirectly using holistic information given by the DM through assignment examples. We propose an interactive approach that infers the parameters of an ELECTRE TRI model from assignment examples. The determination of an ELECTRE TRI model that best restitutes the assignment examples is formulated through an optimization problem. The interactive aspect of this approach lies in the possibility given to the DM to revise his/her assignment examples and/or to give additional information before the optimization phase restarts.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 100 (1999), S. 365-375 
    ISSN: 1573-2878
    Keywords: Theorems of the alternative ; set-valued maps ; optimization ; ordered linear topological spaces ; optimality conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we establish a theorem of the alternative in ordered linear topological spaces. Then, optimality conditions for the optimization of set-valued maps are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 101 (1999), S. 203-211 
    ISSN: 1573-2878
    Keywords: Routing ; optimization ; queueing systems ; robustness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider the routing problem described in Mohanty and Cassandras (Ref. 1). As in Ref. 1, we show that the optimal Bernoulli split to minimize mean time in the system is asymptotically independent of the variance of the service time. We give simple proofs of the results in that paper. We exploit the fact that the optimal split to minimize the mean queueing time is variance independent and the special structure of the Karush–Kuhn–Tucker optimality conditions to derive the optimal solution. Apart from being very straightforward, the proofs also give insight into the reason for the existence of the variance-independent asymptotically optimal routing policy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 649-676 
    ISSN: 1573-2878
    Keywords: Subdifferentials ; convex functions ; quasiconvex functions ; optimization ; minima ; maxima ; necessary conditions ; sufficient conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the γ-subdifferential ∂γ is introduced for investigating the global behavior of real-valued functions on a normed spaceX. Iff: D⊂X → ℝ attains its global minimum onD atx *, then 0∈∂γ f(x *). This necessary condition always holds, even iff is not continuous orx * is at the boundary of its domain. Nevertheless, it is useful because, by choosing a suitable γ∈ℝ+, many local minima cannot satisfy this necessary condition. For the sufficient conditions, the so-called γ-convex functions are defined. The class of these functions is rather large. For example, every periodic function on the real line is a γ-convex function. There are γ-convex functions which are not continuous everywhere. Every function of bounded variation can be represented as the difference of two γ-convex functions. For all that, γ-convex functions still have properties similar to those of convex functions. For instance, each γ-local minimizer off is at the same time a global one. Iff attains its global minimum onD, then it does so at least at one point of its γ-boundary.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 87 (1995), S. 403-417 
    ISSN: 1573-2878
    Keywords: Lyapunov functions ; uncertain systems ; structured uncertainties ; optimization ; multidimensional systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The robust stability problem of a nominally linear system with nonlinear, time-varying structured perturbationsp j ,j=1,...,q, is considered. The system is of the form $$\dot x = A_N x + \sum\limits_{j = 1}^q {p_j A_j x} .$$ When the Lyapunov direct method is utilized to solve the problem, the most frequently chosen Lyapunov function is some quadratic form. The paper presents a procedure of optimization of Lyapunov functions. Under some simple conditions, the weak convergence of the procedure is ensured, making the procedure effective in solving the robust stability problem. The procedure is simple, requiring only numerical routines such as inverting positive-definite symmetric matrices and determining the eigenvalues and eigenvectors of symmetric matrices. It is expected that the optimal Lyapunov function may be used in a robust linear feedback controller design. The examples demonstrate the effectiveness of the method. As shown when considering a system of dimension 24, the method is effective for large-scale systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 90 (1996), S. 279-300 
    ISSN: 1573-2878
    Keywords: Vibration suppression ; actuator placement ; reachable set ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper examines the role of the control objective and the control time in determining fuel-optimal actuator placement for structural control. A general theory is developed that can be easily extended to include alternative performance metrics such as energy and timeoptimal control. The performance metric defines a convex admissible control set which leads to a max-min optimization problem expressing optimal location as a function of initial conditions and control time. A solution procedure based on a nested genetic algorithm is presented and applied to an example problem. Results indicate that the optimal placement varies widely as a function of both control time and disturbance location. An approximate fitness function is presented to alleviate the computational burden associated with finding exact solutions. This function is shown to accurately predict the optimal actuator locations for a 6th-order system, and is further demonstrated on a 12th-order system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 91 (1996), S. 1-22 
    ISSN: 1573-2878
    Keywords: Generalized convexity ; d.c. functions ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A closed subsetM of a Hausdorff locally convex space is called d.c. representable if there are an extended-real valued lsc convex functionf and a continuous convex functionh such that $$M = \{ x \in X:f(x) - h(x) \leqslant 0\} .$$ Using the existence of a locally uniformly convex norm, we prove that any closed subset in a reflexive Banach space is d.c. representable. For d.c. representable subsets, we define an index of nonconvexity, which can be regarded as an indicator for the degree of nonconvexity. In fact, we show that a convex closed subset is weakly closed when it has a finite index of nonconvexity, and optimization problems on closed subsets with a low index of nonconvexity are less difficult from the viewpoint of computation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 99 (1998), S. 331-358 
    ISSN: 1573-2878
    Keywords: Stability robustness bounds ; optimization ; reduced conservatism ; discretized systems ; simulation methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, robustness bounds for the perturbations of continuous-time systems to ensure the stability of their discretized counterparts are developed. Both zero-order hold and P-step matrix integrators are considered. The effect of the sampling time on the robustness bounds is studied via examples. To determine how well a simulated system will retain the robustness properties of the continuous-time system being simulated, a new criterion for the selection of the simulation method and time step is introduced. Both implicit and explicit robustness measures for sampled-data systems are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    World journal of microbiology and biotechnology 14 (1997), S. 171-176 
    ISSN: 1573-0972
    Keywords: Bacteria ; DNA ; evolution ; molecular ; optimization ; RNA ; theory ; time
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract The theory of everything is discussed in relationship to early bacterial molecular evolution. The emphasis is on time, space (or location at the molecular level), the universal construction kit (elements contained in periodic table) and change per units of time that were necessary for early bacterial molecular evolution to occur.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    World journal of microbiology and biotechnology 14 (1998), S. 785-786 
    ISSN: 1573-0972
    Keywords: Biodegradation ; chlorobenzoates ; Corynebacterium liquefaciens ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract Of the nine actinomycete strains screened for their ability to grow on isomeric chlorobenzoates (Cba), Corynebacterium liquefaciens, a sewage isolate, was able to maximally metabolize 3.2mM 2- and 3-Cba in presence of 0.25mM glucose as co-substrate. The degradation of 2-Cba and 3-Cba was 70.3% and 79.37% (w/v), respectively, under optimized conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    World journal of microbiology and biotechnology 14 (1998), S. 917-919 
    ISSN: 1573-0972
    Keywords: Exopolysaccharide ; Klebsiella oxytoca ; lactose ; optimization ; whey
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract Optimization of bioprocess conditions increased exopolysaccharide production by a strain of Klebsiella oxytoca from 6g/l to 15g/l; this corresponded to an increase in medium viscosity from 36cP at 12s−1 to 20,000 cP at 0.6 s−1. A combination of equal proportions of tryptone nitrogen and urea nitrogen proved to be the best nitrogen source. Lactose was shown to be the preferred carbon source. At an optimum temperature of 25°C, a pH of 7 was found to be the best for exopolysaccharide production. The concentration of exopolysaccharide produced on whey, enriched whey, enriched whey permeate and lactose-rich medium was comparable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    World journal of microbiology and biotechnology 13 (1997), S. 683-688 
    ISSN: 1573-0972
    Keywords: C ellobiose-oxidizing enzyme ; Cytophaga sp ; optimization ; production
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract A cell-bound cellobiose-oxidizing enzyme was produced by cellulolytic Cytophaga sp. LX-7. It was found that both the cellulosic substrates and the soluble carbohydrate substrates tested promoted the production of the cellobiose-oxidizing enzyme, and the highest specific activities were obtained with cellulose powder MN300, carboxy- methylcellulose CM22, maltose and cellobiose. Among the nitrogen sources examined, peptone gave the best cellobiose-oxidizing enzyme production, whereas inorganic nitrogen sources gave very poor growth. The medium buffered with Tris/HCl, pH 7.1, yielded the highest levels of cellobiose-oxidizing enzyme activity and the temperature optimum for crude enzyme activity was 40°C.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 5 (1995), S. 175-190 
    ISSN: 1573-1375
    Keywords: Image analysis ; MAP estimation ; optimization ; simulated annealing ; multi-resolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...