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
Filter
  • Articles  (11)
  • Other Sources
  • Global optimization  (6)
  • Convergence
  • 1990-1994  (6)
  • 1980-1984  (5)
  • Mathematics  (11)
  • Geography
Collection
  • Articles  (11)
  • Other Sources
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 79 (1993), S. 157-181 
    ISSN: 1573-2878
    Keywords: Global optimization ; Lipschitzian optimization ; space covering ; space partitioning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a new algorithm for finding the global minimum of a multivariate function subject to simple bounds. The algorithm is a modification of the standard Lipschitzian approach that eliminates the need to specify a Lipschitz constant. This is done by carrying out simultaneous searches using all possible constants from zero to infinity. On nine standard test functions, the new algorithm converges in fewer function evaluations than most competing methods. The motivation for the new algorithm stems from a different way of looking at the Lipschitz constant. In particular, the Lipschitz constant is viewed as a weighting parameter that indicates how much emphasis to place on global versus local search. In standard Lipschitzian methods, this constant is usually large because it must equal or exceed the maximum rate of change of the objective function. As a result, these methods place a high emphasis on global search and exhibit slow convergence. In contrast, the new algorithm carries out simultaneous searches using all possible constants, and therefore operates at both the global and local level. Once the global part of the algorithm finds the basin of convergence of the optimum, the local part of the algorithm quickly and automatically exploits it. This accounts for the fast convergence of the new algorithm on the test functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 24 (1982), S. 284-313 
    ISSN: 1436-4646
    Keywords: Variational Inequality ; Complementarity ; Iterative Methods ; Convergence ; Traffic Equilibria
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we study both the local and global convergence of various iterative methods for solving the variational inequality and the nonlinear complementarity problems. Included among such methods are the Newton and several successive overrelaxation algorithms. For the most part, the study is concerned with the family of linear approximation methods. These are iterative methods in which a sequence of vectors is generated by solving certain linearized subproblems. Convergence to a solution of the given variational or complementarity problem is established by using three different yet related approaches. The paper also studies a special class of variational inequality problems arising from such applications as computing traffic and economic spatial equilibria. Finally, several convergence results are obtained for some nonlinear approximation methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Constructive approximation 9 (1993), S. 41-58 
    ISSN: 1432-0940
    Keywords: Primary 41A55 ; 65D30 ; 65D32 ; Secondary 42C05 ; Integration rules ; Interpolatory integration rules ; Convergence ; Distribution of points ; Weak convergence ; Potential theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Suppose that, forn≥1, $$I_n [f]: = \sum\limits_{j = 1}^n {w_{jn} f(x_{jn} )} $$ is aninterpolatory integration rule of numerical integration, that is, $$I_n [f]: = \int\limits_{ - 1}^1 {P(x)dx,} degree(P)〈 n.$$ Suppose, furthermore, that, for each continuousf:[−1, 1]→R, $$\mathop {\lim }\limits_{n \to \infty } I_n [f] = \int\limits_{ - 1}^1 {f(x)dx.} $$ What can then be said about thedistribution of the points $$\{ x_{jn} \} _{1 \leqslant j \leqslant n} $$ n→∞? In all the classical examples they havearcsin distribution. More precisely, if $$\mu _n : = \frac{1}{n}\sum\limits_{j = 1}^n {\delta _{x_{jn} } } $$ is the unit measure assigning mass 1/n to each pointx jn, then, asn→∞ $$d\mu _n (x)\mathop \to \limits^* \upsilon (x)dx: = \frac{1}{\pi }(\arcsin x)'dx = \frac{{dx}}{{\pi (1 - x^2 )^{1/2} }}.$$ Surprisingly enough, this isnot the general case. We show that the set of all possible limit distributions has the form 1/2(v(x) dx+dv(x)), wherev is an arbitrary probability measure on [−1, 1]. Moreover, given any suchv, we may find rulesI n,n≥1, with positive weights, yielding the limit distribution 1/2v(x) dx+dv(x)). We also consider generalizations when the quadratures have precision other thann−1, and when we place a weight σ in our integral.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Constructive approximation 9 (1993), S. 59-82 
    ISSN: 1432-0940
    Keywords: Primary 41A55 ; 65D30 ; 65D32 ; Secondary 42C05 ; Integration rules on (−∞, ∞) ; Interpolatory integration rules ; Convergence ; Distribution of points ; Weak convergence ; Potential theory ; Gauss quadrature ; Nevai-Ullmann distribution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Letw be a “nice” positive weight function on (−∞, ∞), such asw(x)=exp(−⋎x⋎α) α〉1. Suppose that, forn≥1, $$I_n [f]: = \sum\limits_{j = 1}^n {w_{jn} } f(x_{jn} )$$ is aninterpolatory integration rule for the weightw: that is for polynomialsP of degree ≤n-1, $$I_n [P]: = \int\limits_{ - \infty }^\infty {P(x)w(x)dx.} $$ Moreover, suppose that the sequence of rules {I n} n=1 t8 isconvergent: $$\mathop {\lim }\limits_{n \to \infty } I_n [f] = \int\limits_{ - \infty }^\infty {f(x)w(x)dx} $$ for all continuousf:R→R satisfying suitable integrability conditions. What then can we say about thedistribution of the points {x jn} j=1 n ,n≥1? Roughly speaking, the conclusion of this paper is thathalf the points are distributed like zeros of orthogonal polynomials forw, and half may bearbitrarily distributed. Thus half the points haveNevai-Ullmann distribution of order α, and the rest are arbitrarily distributed. We also describe the possible distributions of the integration points, when the ruleI n has precision other thann-1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 13 (1982), S. 325-337 
    ISSN: 1432-1416
    Keywords: Population entropy ; Leslie model ; Markov chain ; Convergence ; Stable age distribution ; Ergodic theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Summary The population entropy introduced by Demetrius is shown to have a precise dynamical meaning as a measure of convergence rate to the stable age distribution. First the Leslie population model is transformed exactly into a Markov chain on a state space of age-classes. Next the dynamics of convergence from a nonequilibrium state to the stable state are analyzed. The results provide the first clear biological reason why entropy is a broadly useful population statistic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 13 (1981), S. 241-246 
    ISSN: 1432-1416
    Keywords: Leslie matrix ; Index of primitivity ; Convergence ; Stable age distribution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract An exact expression for the index of primitivity g of a Leslie matrix is obtained, which applies also to time-varying matrices which share an incidence matrix. Elapsed time (not time intervals) to primitivity is shown to depend only weakly on the discretization scheme used. A lower bound for speed of convergence to the stable (fixed or time-dependent as appropriate) state is given which depends sensitively on g.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 42 (1984), S. 19-30 
    ISSN: 1573-2878
    Keywords: Global optimization ; nondifferentiable optimization ; Lipschitz continuous functions ; outer-approximation algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is known that the problem of minimizing a convex functionf(x) over a compact subsetX of ℝ n can be expressed as minimizing max{g(x, y)|y ∈X}, whereg is a support function forf[f(x) ≥g(x, y), for ally ∈X andf(x)=g(x, x)]. Standard outer-approximation theory can then be employed to obtain outer-approximation algorithms with procedures for dropping previous cuts. It is shown here how this methodology can be extended to nonconvex nondifferentiable functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 44 (1984), S. 365-365 
    ISSN: 1573-2878
    Keywords: Global optimization ; nondifferentiable optimization ; Lipschitz continuous functions ; outer-approximation algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Omissions from the list of references of Ref. 1 are corrected.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 80 (1994), S. 513-536 
    ISSN: 1573-2878
    Keywords: Global optimization ; parallel numerical methods ; convergence ; speedup
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We describe a new parallel method for solving global optimization problems. The formulation of the decision rules of this method is presented. We examine convergence conditions of the proposed algorithm and establish conditions which guarantee a considerable speedup with respect to the sequential version of the algorithm. We also present some numerical experiments executed on Alliant FX/80 for one class of multiextremal functions.
    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 70 (1991), S. 377-384 
    ISSN: 1573-2878
    Keywords: Global optimization ; branch-and-bound methods ; convex-concave functions ; DC-problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. The minimization of a DC-function is a special case, where the subproblems connected with the bounding operation can be solved effectively.
    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...