ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (13)
  • Optimization
  • Springer  (13)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Periodicals Archive Online (PAO)
  • Wiley
  • 2005-2009
  • 1990-1994  (6)
  • 1980-1984  (7)
  • 2008
  • 2007
  • 2005
  • 1994  (6)
  • 1982  (5)
  • 1980  (2)
  • Mathematics  (11)
  • Technology  (1)
  • Process Engineering, Biotechnology, Nutrition Technology  (1)
  • Philosophy
  • Political Science
Collection
  • Articles  (13)
Source
Keywords
Publisher
  • Springer  (13)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Periodicals Archive Online (PAO)
    • +
Years
  • 2005-2009
  • 1990-1994  (6)
  • 1980-1984  (7)
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Conjugate direction methods with variable storage (1982)
    Springer
    Mathematical programming 23 (1982), S. 326-340 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF01583797
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Robust optimal design using a second-order tolerance model (1994)
    Springer
    Research in engineering design 6 (1994), S. 25-37 
    Details
    ISSN: 1435-6066
    Keywords: Optimization ; Robust design ; Tolerances ; Variation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract In this paper we present a general, quantitative method for developing designs that are robust to variation in design variables and parameters. Variation is defined in terms of tolerances which bracket the expected deviation of uncertain quantities about nominal values. We specifically address the case where input variations are assumed to be random variables that are normally distributed. The method incorporates a second-order tolerance model as part of a nonlinear optimization process. The second-order tolerance model makes it possible to estimate the skewness of function distributions, which are modeled with a three-parameter gamma distribution. We apply the method to determine robust designs for 11 test cases that span a variety of problems; robustness is verified with Monte Carlo simulation. The method enables a designer to understand and account for the effects of tolerances, making it possible to build robustness into an engineering design.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588089
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A smoothing-out technique for min—max optimization (1980)
    Springer
    Mathematical programming 19 (1980), S. 61-77 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF01581628
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Allocation of buffer capacities in queueing networks with arbitrary topologies (1994)
    Springer
    Annals of operations research 48 (1994), S. 313-332 
    Details
    ISSN: 1572-9338
    Keywords: Optimization ; heuristics ; open queueing networks ; blocking
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Two algorithms are developed to allocateM buffers toN service stations connected arbitrarily in a feed-forward manner. All service times and the interarrival times are assumed to be exponentially distributed. Both methodologies are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02024519
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    The scale up of mycelial shake flask fermentations: A case study of gamma linolenic acid production byMucor hiemalis IRL 51 (1994)
    Springer
    Journal of industrial microbiology and biotechnology 13 (1994), S. 212-216 
    Details
    ISSN: 1476-5535
    Keywords: Shake flask ; Scale up ; Mycelial ; Medium ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Summary Production of gamma linolenic acid (GLA) by the filamentous fungusMucor hiemalis IRL 51 was studied in both shake flask culture and in a 10-L stirred tank fermenter. This study was conducted to assess how the results from shake flask media screening trials compared to those obtained in a 10-L stirred tank fermenter, which is assumed to be more representative of an industrial system. The results show that the biological performance in 10-L fermenters is usually the same as that in shake flask culture. There were some inconsistencies which could possibly be attributed to scale, but no large differences were systematically seen. These results show that for this filamentous fungus, shake flask culture provides a quick and inexpensive way of optimizing medium composition.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01569750
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A new augmented Lagrangian function for inequality constraints in nonlinear programming problems (1982)
    Springer
    Journal of optimization theory and applications 36 (1982), S. 495-519 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF00940544
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Equivalence theorem for constrained optimization of the LegendreK-transform of a concave function (1982)
    Springer
    Journal of optimization theory and applications 38 (1982), S. 25-31 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF00934320
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    An approach to the solution of the vector optimization problem of dynamic systems (1982)
    Springer
    Journal of optimization theory and applications 38 (1982), S. 409-422 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF00935346
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    System theory: A new approach to wave mechanics (1980)
    Springer
    Journal of optimization theory and applications 32 (1980), S. 463-478 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF00934034
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft (1994)
    Springer
    Journal of optimization theory and applications 82 (1994), S. 219-251 
    Details
    ISSN: 1573-2878
    Keywords: Optimization ; control ; structures ; spacecraft ; fail-safe design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A multicriterion design problem for optimal maneuverability and fault tolerance of flexible spacecraft is considered. The maneuverability index reflects the time required to perform rest-to-rest attitude maneuvers for a given set of angles, with the postmaneuver spillover within a specified bound. The performance degradation is defined to reflect the maximum possible attitude error after maneuver due to the effect of faults. The fault-tolerant design is to minimize the worst performance degradation from all admissible faults by adjusting the design of the spacecraft. It is assumed that admissible faults can be specified by a vector of real parameters. The multicriterion design for optimal maneuverability and fault tolerance is shown to be well defined, leading to a minimax problem. Analysis for this nonsmooth problem leads to closed-form expressions of the generalized gradient of the performance degradation function with respect to the fault parameters and structural design variables. Necessary and sufficient conditions for the optimum are derived, and the closed-form expressions of the generalized gradients are applied for their interpretation. The bundle method is applicable to this minimax problem. Approximate methods which efficiently solve this minimax problem with relatively little computational difficulties are presented. Numerical examples suggest that it is possible to improve the fault tolerance substantially with relatively little loss in maneuverability.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02191852
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Optimized pump scheduling in water distribution systems (1994)
    Springer
    Journal of optimization theory and applications 83 (1994), S. 463-488 
    Details
    ISSN: 1573-2878
    Keywords: Optimization ; generalized reduced gradient method ; water distribution systems ; pump scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A method based on nonlinear programming for determining the optimal operation of general water distribution systems containing multiple sources and reservoirs is presented. The problem is formulated and solved so that, given the forecasted demands for the coming 24 hours, the initial and final conditions in the reservoirs, the unit and maximum demand electricity charge, and the constraints in the hydraulic properties of all system components, an optimized pumping schedule is found. An optimization algorithm which employs the generalized reduced gradient method and the nonlinear sensitivity analysis has been developed for a basic scheduling problem in which only unit charges are considered. The maximum demand charge, which is weighted by varying degrees from day to day, is incorporated into the scheduling problem. The algorithm uses a feasible initial solution as the starting solution and iterates so that all the interim solutions are feasible.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02207638
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    On the convergence, invariance, and related aspects of a modification of Huang's algorithm (1982)
    Springer
    Journal of optimization theory and applications 37 (1982), S. 315-341 
    Details
    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
    URL: http://dx.doi.org/10.1007/BF00935273
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Application of Bayesian approach to numerical methods of global and stochastic optimization (1994)
    Springer
    Journal of global optimization 4 (1994), S. 347-365 
    Details
    ISSN: 1573-2916
    Keywords: Optimization ; global ; Bayesian ; continuous ; stochastic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper a review of application of Bayesian approach to global and stochastic optimization of continuous multimodal functions is given. Advantages and disadvantages of Bayesian approach (average case analysis), comparing it with more usual minimax approach (worst case analysis) are discussed. New interactive version of software for global optimization is discussed. Practical multidimensional problems of global optimization are considered
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01099263
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...