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
  • Optimization
  • Springer  (24)
  • Blackwell Publishing Ltd
  • 1980-1984  (23)
  • 1965-1969  (1)
  • 1925-1929
Collection
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 23 (1982), S. 326-340 
    ISSN: 1436-4646
    Keywords: Optimization ; Quasi-Newton ; Conjugate Gradient
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we study conjugate gradient algorithms for large optimization problems. These methods accelerate (or precondition) the conjugate gradient method by means of quasi-Newton matrices, and are designed to utilize a variable amount of storage, depending on how much information is retained in the quasi-Newton matrices. We are concerned with the behaviour of such methods on the underlying quadratic model, and in particular, with finite termination properties.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 61-77 
    ISSN: 1436-4646
    Keywords: Optimization ; Nonlinear Programming ; Unconstrained Optimization ; Nondifferentiable Optimization ; Min—Max Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we suggest approximations for smoothing out the kinks caused by the presence of “max” or “min” operators in many non-smooth optimization problems. We concentrate on the continuous-discrete min—max optimization problem. The new approximations replace the original problem in some neighborhoods of the kink points. These neighborhoods can be made arbitrarily small, thus leaving the original objective function unchanged at almost every point ofR n . Furthermore, the maximal possible difference between the optimal values of the approximate problem and the original one, is determined a priori by fixing the value of a single parameter. The approximations introduced preserve properties such as convexity and continuous differentiability provided that each function composing the original problem has the same properties. This enables the use of efficient gradient techniques in the solution process. Some numerical examples are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 20 (1981), S. 49-62 
    ISSN: 1436-4646
    Keywords: Algorithms ; Optimization ; Minimax ; Quasi-Newton ; Superlinear Convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present an algorithm for minimax optimization that combines LP methods and quasi-Newton methods. The quasi-Newton algorithm is used only if an irregular solution is detected, in which case second-order derivative information is needed in order to obtain a fast final rate of convergence. We prove that the algorithm can converge only to a stationary point and that normally the final rate of convergence will be either quadratic or superlinear. The performance is illustrated through some numerical examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    BIT 7 (1967), S. 216-225 
    ISSN: 1572-9125
    Keywords: Optimization ; error ; control ; simplex
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The present paper describes a simple method to find an indicator of the error in solutions found by a procedure using the simplex-technique, and also describes a method for improving these solutions to any desired accuracy provided certain conditions are met.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 172-181 
    ISSN: 1436-4646
    Keywords: Optimization ; Sparsity ; Matrix Updating
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with two questions relating to quasi-Newton updates for unconstrained optimization that exploit any sparsity present in the second derivative matrix of the objective function. First, a family of such updates is derived, that reduces to any a priori known dense update formula when no sparsity is imposed. This family uses the Frobenius projection of the desired update on the subspace of matrices that satisfy all the needed conditions. In the second part, we prove that, under mild assumptions, a positive definite sparse quasi-Newton update always exists. The proof of this result includes the explicit determination of such an update.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 331-347 
    ISSN: 1436-4646
    Keywords: Optimization ; Nonlinear Programming ; Unconstrained Optimization ; Discrete Optimal Control ; Differential Dynamic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Dynamic programming techniques have proven to be more successful than alternative nonlinear programming algorithms for solving many discrete-time optimal control problems. The reason for this is that, because of the stagewise decomposition which characterizes dynamic programming, the computational burden grows approximately linearly with the numbern of decision times, whereas the burden for other methods tends to grow faster (e.g.,n 3 for Newton's method). The idea motivating the present study is that the advantages of dynamic programming can be brought to bear on classical nonlinear programming problems if only they can somehow be rephrased as optimal control problems. As shown herein, it is indeed the case that many prominent problems in the nonlinear programming literature can be viewed as optimal control problems, and for these problems, modern dynamic programming methodology is competitive with respect to processing time. The mechanism behind this success is that such methodology achieves quadratic convergence without requiring solution of large systems of linear equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 12 (1981), S. 343-354 
    ISSN: 1432-1416
    Keywords: Ecology ; Periodic differential equations ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Summary The theory developed here applies to populations whose size x obeys a differential equation, $$\dot x = r(t)xF(x,t)$$ in which r and F are both periodic in t with period p. It is assumed that the function r, which measures a population's intrinsic rate of growth or intrinsic rate of adjustment to environmental change, is measurable and bounded with a positive lower bound. It is further assumed that the function F, which is determined by the density-dependent environmental influences on growth, is such that there is a closed interval J, with a positive lower bound, in which there lies, for each t, a number K(t) for which $$F(K(t),t) = 0$$ and, as functions on J × ℝ, F is continuous, while ∂F/∂x is continuous, negative, and bounded. Because x(t) = 0, 〉 0, or 〈 0 in accord with whether K(t) = x(t), K(t) 〉 x(t), or K(t) 〈 x(t), the number K(t) is called the “carrying capacity of the environment at time t”. The assumptions about F imply that the number K(t) is unique for each t, depends continuously and periodically on t with period P, and hence attains its extrema, K min and K max. It is, moreover, easily shown that the differential equation for x has precisely one solution x * which has its values in J and is bounded for all t in ℝ; this solution is of period p, is asymptotically stable with all of J in its domain of attraction, and is such that its minimum and maximum values, x min * and x max * , obey $$K_{min} \leqslant x_{min}^* \leqslant x_{max}^* \leqslant K_{max}^* .$$ The following question is discussed: If the function F is given, and the function r can be chosen, which choices of r come close to maximizing, x min * ? The results obtained yield a procedure for constructing, for each F and each ɛ 〉 0, a function r such that x min * 〉 K max − ɛ.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1612-1112
    Keywords: Optimization ; Dead volume ; LC, Reversed phase ; Ternary solvents
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary Described in this paper is a simple method for optimization of separations in reversed-phase liquid chromatography using ternary solvents. The graphical procedure is based on the linearity of the plots of log k′ against solvent composition. This relationship was found to depend critically both on the relative composition of the binary solvents used to prepare the ternary mixtures and the method chosen for dead volume determination.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Geotechnical and geological engineering 1 (1983), S. 331-342 
    ISSN: 1573-1529
    Keywords: Optimization ; geostatistics ; mining ; exploration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences
    Notes: Summary In this paper mathematical programming models and special solution algorithms are presented for the optimal allocation of data points for regionalized variables. Two models are discussed; the first one minimizes the estimation variance subject to a given number of additional measurement points or additional measurement cost. The second model minimizes the number of additional points or additional cost subject to upper bounds given to the estimation variances. The models are based on the theory of kriging and the properties of the estimation variances, which lead to certain multiobject programming problems. As it can be shown, a special branch and bound algorithm can be used for solving the resulting nonlinear programming problems
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 36 (1982), S. 495-519 
    ISSN: 1573-2878
    Keywords: Optimization ; nonlinear programming ; Numerical methods ; computational methods ; augmented Lagrangian functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, a new augmented Lagrangian function is introduced for solving nonlinear programming problems with inequality constraints. The relevant feature of the proposed approach is that, under suitable assumptions, it enables one to obtain the solution of the constrained problem by a single unconstrained minimization of a continuously differentiable function, so that standard unconstrained minimization techniques can be employed. Numerical examples are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 25-31 
    ISSN: 1573-2878
    Keywords: Optimization ; Kuhn-Tucker theorem ; LegendreK-transform ; equilibrium composition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The most common way of determining the steady states of a system is through the optimization of a concave function on a convex set. This applies only to cases where the objective function depends exclusively onextensive variables. In fields such as econometrics, physics, or chemistry, controllable quantities (and therefore constrained variables) are generally referred to asintensive parameters, and the states are described through a potential function. In the following pages, we examine how these two aspects can be connected.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 409-422 
    ISSN: 1573-2878
    Keywords: Optimization ; scalar optimization ; vector optimization ; optimization under vector-valued criteria ; maximum principle ; dynamic programming ; optimization of dynamic systems ; multi-criteria decision problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The optimal control problem with vector-valued criteria is considered. A new approach to the generalization of this problem and a method of constructing the Bellman function are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 32 (1980), S. 463-478 
    ISSN: 1573-2878
    Keywords: Optimization ; control ; relativity ; stochastic processes ; wave mechanics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The intention of this paper is to show how the influence of the work of Bellman has initiated a tentative new approach to quantum mechanics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 40 (1983), S. 595-623 
    ISSN: 1573-2878
    Keywords: Optimization ; partial differential equations ; elasticity ; control ; design sensitivity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The dependence of the static response and the eigenvalues of a membrane on its shape is characterized. A transformation function is defined to determine the shape of the membrane. Differential operator properties and transformation techniques of integral calculus are employed to show that the static response and the eigenvalues of the system depend in a continuous and differentiable way on the shape of the membrane. Explicit and computable formulas are presented for the derivative (first variation) of the structural response and the eigenvalues with respect to the shape. A rigorous proof is provided, and the shape design sensitivity of a typical integral functional is determined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 43 (1984), S. 383-393 
    ISSN: 1573-2878
    Keywords: Optimization ; variable-metric methods ; rational approximations ; switching algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, a new variable-metric method based on a rational, rather than a quadratic, model is proposed. A switching algorithm is also introduced which selects either the standard quadratic model or the new rational model, depending on which has the smallest condition number. Several functions are used to test the new method, and it is concluded that it is as efficient as the standard model in general and is superior for problems of high dimensionality. Considerable improvement is also obtained for high-dimensional problems when the switching algorithm is used.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    ISSN: 1612-1112
    Keywords: Reversed-Phase ; Liquid Chromatography ; Selectivity ; Interaction Indices ; Homologous Series ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary Extrapolation of log k'vs. nc plots for homologous series chromatographed with different mobile phases leads to a common intersection point. Its coordinates depend on the series and the solvent used, and can be rationalized on the basis of the retention model of interaction indices. The existence of this convergence point is reflected in the linear relationship of logα-logβ, which permits the optimization of chromatographic separations in the region of solvent compositions where these two parameters can be varied independently.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Chromatographia 13 (1980), S. 61-67 
    ISSN: 1612-1112
    Keywords: Optimization ; Carrier gas velocity ; Gas chromatography ; Influence of temperature on optimum velocity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Zusammenfassung Die Wahl der mittleren, linearen Trägergasgeschwindigkeit bei der Analyse von Mehrkomponentengemischen unter isothermen und temperaturprogrammierten Bedingungen wird diskutiert. Es wird gezeigt, daß stets eine Trägergasgeschwindigkeit gewählt werden sollte, die mindestens gleich, besser jedoch höher ist, als die optimale Gasgeschwindigkeit für den ersten Peak, gemessen bei der Starttemperatur (Temperaturprogramm) oder bei der eingestellten Ofentemperatur (isotherme Fahrweise).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    ISSN: 1612-1112
    Keywords: Reversed-phase LC ; Ternary mobile-phases ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary A simple rapid procedure is described for estimating optimum compositions of ternary mobile phase mixtures for the separation of samples by reversed-phase liquid chromatography (RPLC). Retention data in two iso-eluotropic binary mobile phase mixtures (mixtures with equal retention times) are required to initiate the procedure. The logarithm of the capacity factor is assumed to vary linearly with the composition of isoeluotropic ternary mixtures formed by mixing the two limiting binaries. Using the product of resolution factors of adjacent peaks as the criterion, an optimum ternary composition is then calculated. After a chromatogram has been obtained with the predicted optimum ternary mobile phase, the procedure is repeated until no further improvement can be achieved. Examples of the application of the present procedure are described to illustrate its effectiveness.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Chromatographia 15 (1982), S. 125-132 
    ISSN: 1612-1112
    Keywords: Capillary columns ; Fast analysis ; Gas chromatography ; Instrumental effects ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary The efficiency of fast GC columns depends largely on the quality of the chromatograph. A theoretical and experimental study shows the relative importance of the various phenomena involved and permits the optimization of a GC System. Extremely good performances, exceeding 2,500 plates per second have been routinely obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Chromatographia 15 (1982), S. 498-504 
    ISSN: 1612-1112
    Keywords: Analytical performance ; Chromatographic response function ; HPLC (or LC) ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary A chromatographic response function is studied that is sensitive to important criteria of analytical performance: selectivity, accuracy, precision and time required to perform the separation. This function can be applied to mixtures of unknown solutes and little computational effort is needed to evaluate the numerical value of the function from the chromatogram. It shows well defined optima at elution strengths that give minimal elution times simultaneously with good separations in high-performance liquid chromatography. No prior chromatographic information characterizing the expected performance of a system is required. It is possible to use this function without a mechanistic model describing the separation process.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    ISSN: 1612-1112
    Keywords: RP-HPLC ; Optimization ; Complex mobile phases ; Iso-eluotropic mixtures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary The stepwise procedure described previously [1] for the selection of optimal mobile phase compositions in reversed phase liquid chromatography (RPLC) is improved in two ways. The optimization criterion is modified to account for variations in analysis time. The iterative approach to the optimal solvent composition makes a more efficient use of previous data. An example illustrates the resulting gain in speed and accuracy.
    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 40 (1983), S. 321-331 
    ISSN: 1573-2878
    Keywords: Optimization ; necessary conditions ; Kuhn-Tucker theorem ; multiplier rules ; separation of convex sets ; mathematical programming ; generalized derivatives
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the following abstract mathematical programming problem: in a setD, find an element that optimizes a real function φ0, subject to inequality constraints φ1⩽0, ..., φ p ⩽0 and equality constraints φ p+1=0, ..., φ p+q =0. Necessary conditions for this problem, like the Karush-Kuhn-Tucker theorem, can be seen as a consequence of separating with a hyperplane two convex sets inR p+q+1, the image space of the map Φ=(φ0, φ1, ..., φ p+q ). This paper reviews this approach and organizes it into a coherent way of looking at necessary conditions in optimization theory.
    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 37 (1982), S. 315-341 
    ISSN: 1573-2878
    Keywords: Optimization ; unconstrained minimization ; updates ; line searches ; convergence ; numerical methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider a certain generalization of the Huang family of updates and discuss, firstly, convergence, dependence on parameters, and descent property; secondly, invariance under nonlinear scaling, conjugacy of search directions, and possibility of achieving a better approximation of the inverse of the Hessian. The last three aspects are shown to be dependent on particular choices of parameters. A numerical experiment is presented comparing the performances of the usual and modified BFGS algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Geotechnical and geological engineering 1 (1983), S. 315-329 
    ISSN: 1573-1529
    Keywords: Optimization ; mine production scheduling ; linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences
    Notes: Summary Computational difficulties arising in the solution of linear programming models have mitigated against their widespread use in mine scheduling. These difficulties are identified and discussed and key avenues for further research are isolated.
    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...