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  (5)
  • Optimization  (5)
  • Springer  (5)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
  • 2005-2009
  • 1990-1994
  • 1980-1984  (5)
  • 2008
  • 2006
  • 1982  (5)
  • Mathematics  (5)
  • Economics
Collection
  • Articles  (5)
Source
Keywords
Publisher
  • Springer  (5)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
    • +
Years
  • 2005-2009
  • 1990-1994
  • 1980-1984  (5)
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
    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
  • 3
    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
  • 4
    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
  • 5
    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
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...