ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass. : Athena Scientific
    Associated volumes
    Call number: PIK M 311-07-0122/2
    In: Dynamic programming and optimal control
    Type of Medium: Monograph available for loan
    Pages: XV, 445 S.
    ISBN: 1886529302
    Series Statement: Dynamic programming and optimal control
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass : Athena Scientific
    Call number: PIK M 370-05-0021
    Type of Medium: Monograph available for loan
    Pages: XIII, 491 S , graph. Darst
    ISBN: 1886529108
    Series Statement: Optimization and neural computation series 3
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass. : Athena Scientific
    Call number: PIK M 311-07-0238
    Type of Medium: Monograph available for loan
    Pages: IX, 416 S. , graph. Darst.
    Edition: 2. printing
    ISBN: 188652940X
    Series Statement: Athena scientific books 1
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass : Athena Scientific
    Associated volumes
    Call number: PIK M 311-01-0011
    In: Dynamic programming and optimal control
    Type of Medium: Monograph available for loan
    Pages: 292 S
    Edition: [Teilw. Nachdr. der Ausg.] 1987, Dynamic programming : deterministic and stochastic models, Prentice-Hall
    ISBN: 1886529132
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass : Athena Scientific
    Associated volumes
    Call number: PIK M 311-01-0010
    In: Dynamic programming and optimal control
    Type of Medium: Monograph available for loan
    Pages: 387 S
    Edition: [Teilw. Nachdr. der Ausg.] 1987, Dynamic programming : deterministic and stochastic models, Prentice-Hall
    ISBN: 1886529124
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Monograph available for loan
    Monograph available for loan
    Belmont, Mass. : Athena Scientific
    Associated volumes
    Call number: PIK M 311-07-0122/1
    In: Dynamic programming and optimal control
    Type of Medium: Monograph available for loan
    Pages: XV, 543 S.
    ISBN: 1886529086
    Series Statement: Dynamic programming and optimal control
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Monograph available for loan
    Monograph available for loan
    Belmont, Massachusetts : Athena Scientific
    Call number: PIK M 370-20-94001
    Type of Medium: Monograph available for loan
    Pages: xiv, 373 Seiten , Diagramme, Illustrationen
    Edition: 2nd printing
    ISBN: 9781886529397 , 1886529396
    Series Statement: Athena scientific optimization and computation series
    Language: English
    Note: Contents:1. Exact Dynamic Programming ; 2. Approximation in Value Space ; 3. Parametric Approximation ; 4. Infinite Horizon Dynamic Programming ; 5. Infinite Horizon Reinforcement Learning ; 6. Aggregation
    Location: A 18 - must be ordered
    Branch Library: PIK Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 60 (1993), S. 1-19 
    ISSN: 1436-4646
    Keywords: Convex programming ; linear programming ; multiplier method ; exponential penalty ; Augmented Lagrangian
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy “proximal” term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 88 (2000), S. 85-104 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We generalize the ε-relaxation method of [14] for the single commodity, linear or separable convex cost network flow problem to network flow problems with positive gains. The method maintains ε-complementary slackness at all iterations and adjusts the arc flows and the node prices so as to satisfy flow conservation upon termination. Each iteration of the method involves either a price change on a node or a flow change along an arc or a flow change along a simple cycle. Complexity bounds for the method are derived. For one implementation employing ε-scaling, the bound is polynomial in the number of nodes N, the number of arcs A, a certain constant Γ depending on the arc gains, and ln(ε0/ ), where ε0 and denote, respectively, the initial and the final tolerance ε.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 293-318 
    ISSN: 1436-4646
    Keywords: Monotone operators ; proximal point algorithm ; decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas—Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special cases of the proximal point algorithm. This observation allows the unification and generalization of a variety of convex programming algorithms. By introducing a modified version of the proximal point algorithm, we derive a new,generalized alternating direction method of multipliers for convex programming. Advances of this sort illustrate the power and generality gained by adopting monotone operator theory as a conceptual framework.
    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...