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  (4)
  • global optimization
  • Springer  (4)
  • American Chemical Society (ACS)
  • Cell Press
  • 2010-2014
  • 1995-1999  (4)
  • 1980-1984
  • 1999  (4)
  • Mathematics  (4)
  • Economics  (1)
Collection
  • Articles  (4)
Publisher
  • Springer  (4)
  • American Chemical Society (ACS)
  • Cell Press
Years
  • 2010-2014
  • 1995-1999  (4)
  • 1980-1984
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Methodology and computing in applied probability 1 (1999), S. 127-190 
    ISSN: 1387-5841
    Keywords: combinatorial optimization ; global optimization ; importance sampling ; markov chain monte carlo ; simulated annealing ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a new and fast method, called the cross-entropy method, for finding the optimal solution of combinatorial and continuous nonconvex optimization problems with convex bounded domains. To find the optimal solution we solve a sequence of simple auxiliary smooth optimization problems based on Kullback-Leibler cross-entropy, importance sampling, Markov chain and Boltzmann distribution. We use importance sampling as an important ingredient for adaptive adjustment of the temperature in the Boltzmann distribution and use Kullback-Leibler cross-entropy to find the optimal solution. In fact, we use the mode of a unimodal importance sampling distribution, like the mode of beta distribution, as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization. In the later case we show almost surely convergence of our algorithm to the optimal solution. Supporting numerical results for both continuous and combinatorial optimization problems are given as well. Our empirical studies suggest that the cross-entropy method has polynomial in the size of the problem running time complexity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 50 (1999), S. 121-134 
    ISSN: 1432-5217
    Keywords: Key words: Risk measurement ; global optimization ; quadratic programming ; nonlinear programming ; polynomial-approximation algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. Effective risk management requires adequate risk measurement. A basic problem herein is the quantification of market risks: what is the overall effect on a portfolio if market rates change? First, a mathematical problem statement is given and the concept of `Maximum Loss' (ML) is introduced as a method for identifying the worst case in a given set of scenarios, called `Trust Region'. Next, a technique for calculating efficiently the Maximum Loss for quadratic functions is described; the algorithm is based on the Levenberg-Marquardt theorem, which reduces the high dimensional optimization problem to a one dimensional root finding.  Following this, the idea of the `Maximum Loss Path' is presented: repetitive calculation of ML for growing trust regions leads to a sequence of worst case scenarios, which form a complete path; similarly, the path of `Maximum Profit' (MP) can be determined. Finally, all these concepts are applied to nonquadratic portfolios: so-called `Dynamic Approximations' are used to replace arbitrary profit and loss functions by a sequence of quadratic functions, which can be handled with efficient solution procedures. A description of the overall algorithm rounds off the discussion of nonlinear portfolios.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 103 (1999), S. 1-43 
    ISSN: 1573-2878
    Keywords: DC functions ; DC programming ; global optimization ; nonconvex programming ; optimality conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Mathematical programming problems dealing with functions, each of which can be represented as a difference of two convex functions, are called DC programming problems. The purpose of this overview is to discuss main theoretical results, some applications, and solution methods for this interesting and important class of programming problems. Some modifications and new results on the optimality conditions and development of algorithms are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 102 (1999), S. 289-298 
    ISSN: 1573-2878
    Keywords: Concave minimization ; γ-valid cut ; Tuy cut ; global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The concept of a γ-valid cutting plane has been used in many types of algorithms for solving concave minimization problems. Unfortunately, the procedures proposed to date for constructing these cuts are valid only under certain assumptions that often may not hold in practice. Chief among these is the requirement that the feasible region of the concave minimization problem in question have full dimension, and that the objective function of this problem be concave rather than quasiconcave. In this article, we propose, validate, and show how to implement a more general γ-valid cutting plane procedure which eliminates these restrictions.
    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...