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  (130)
  • Other Sources
  • Global optimization  (65)
  • 58F07  (48)
  • Darwin
  • connectionism
  • taxonomy
  • 1995-1999  (130)
  • 1965-1969
  • Mathematics  (114)
  • Philosophy  (16)
Collection
  • Articles  (130)
  • Other Sources
Publisher
Years
Year
  • 1
    ISSN: 1572-9397
    Keywords: evolutionary algorithms ; genetic algorithms ; taxonomy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and accurate way. A classification scheme is introduced and presented in a tabular form called TEA (Table of Evolutionary Algorithms). It distinguishes between different classes of evolutionary algorithms (e.g., genetic algorithms, ant systems) by enumerating the fundamental ingredients of each of these algorithms. At the end, possible uses of the TEA are illustrated on classical evolutionary algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 261-278 
    ISSN: 1572-9338
    Keywords: Global optimization ; Wiener process ; sequential stopping rules ; one-step look-ahead
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper a new algorithm is proposed, based upon the idea of modeling the objective function of a global optimization problem as a sample path from a Wiener process. Unlike previous work in this field, in the proposed model the parameter of the Wiener process is considered as a random variable whose conditional (posterior) distribution function is updated on-line. Stopping criteria for Bayesian algorithms are discussed and detailed proofs on finite-time stopping are provided.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 335-348 
    ISSN: 1572-9036
    Keywords: 35Q53 ; 39A12 ; 58F07 ; evolution equations ; integrability ; singularity analysis ; bilinear formalism ; Painlevé equations ; singularity confinement ; discrete Painlevé equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a review of the various integrability detectors that have been developed based on the study of the singularities of the solutions of a given equation: the Painlevé method for continuous systems, and the singularity confinement approach for discrete ones. In each case the KdV equation was instrumental in the formulation of the conjectures relating the singularity structure to integrability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 349-360 
    ISSN: 1572-9036
    Keywords: 58F07 ; 35Q51 ; evolution equations ; generalized Yang-Mills flows ; Darboux transformations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An evolution equation is added to the generalized self-dual Yang-Mills equations. The evolution equation contains terms of negative powers of the spectral parameter as well as terms of positive powers. The Darboux matrix method is used to obtain explicit solutions, especially single and multiple solitons. All integrable soliton equations in the framework of AKNS system (inR n+1 orR 1+1) can be derived from the generalized Yang-Mills flows by reduction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 489-505 
    ISSN: 1572-9036
    Keywords: 35Q53 ; 58F07 ; Korteweg-de Vries equation ; solitons
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Several constructions and an explicit expression for the right-hand side of the KdV hierarchy are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 507-516 
    ISSN: 1572-9036
    Keywords: 58F07 ; waves ; solitons
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract At the end of the sixties, it was shown that pressure waves in a bubbly liquid obey the KdV equation, the nonlinear term coming from convective acceleration and the dispersive term from volume oscillations of the bubbles. For a variableu, proportional to −p, wherep denotes pressure, the appropriate KdV equation can be casted in the formu t −6uu x +u xxx =0. The theory of this equation predicts that, under certain conditions, solitons evolve from an initial profileu(x,0). In particular, it can be shown that the numberN of those solitons can be found from solving the eigenvalue problemψ xx−u(x,0)ψ=0, withψ(0)=1 andψ′(0)=0.N is found from counting the zeros of the solution of this equation betweenx=0 andx=Q, say,Q being determined by the shape ofu(x,0). We took as an initial pressure profile a Shockwave, followed by an expansion wave. This can be realised in the laboratory and the problem, formulated above, can be solved exactly. In this contribution the solution is outlined and it is shown from the experimental results that from the said initial disturbance, indeed solitons evolve in the predicated quantity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 41 (1995), S. 341-348 
    ISSN: 1572-9036
    Keywords: 58F07 ; 35Q58 ; 15A63 ; KP hierarchy ; constraints ; bilinear method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider generalizedk-constraints of the KP hierarchy where the Lax operatorL is forced to satisfy L − k =q∂−1r. We study the effect of those constraints on the bilinear equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 42 (1996), S. 297-308 
    ISSN: 1572-9036
    Keywords: 58F07 ; 35Q53 ; 14H99 ; KP hierarchy ; Picard sheaves ; Poincaré sheaves
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A family of connections is introduced on a direct limit of Poincaré sheaves of a curve. These connections descend to connections on the corresponding direct limit of Picard sheaves, defined globally on the Jacobian of the curve. All such connections are classified; in particular they are all flat. Krichever's algebro-geometric solutions of the KP equations are recovered upon trivializing the resulting \tdD-modules over the complement of the Θ divisor.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 295-305 
    ISSN: 1572-9036
    Keywords: 58F07 ; initial-boundary value problem ; semi-infinite line ; integrable equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We review a new method for linearizing the initial-boundary value problem of the KdV on the semi-infinite line for decaying initial and boundary data. We also present a novel class of physically important integrable equations. These equations, which include generalizations of the KdV, of the modified KdV, of the nonlinear Schrödinger and of theN-wave interactions, are as generic as their celebrated counterparts and, furthermore it appears that they describe certain physical situations more accurately.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 277-294 
    ISSN: 1572-9036
    Keywords: 35Q53 ; 58F07 ; Painlevé analysis ; Bäcklund transformation ; Kadomtsev-Petviashvili equation ; singular manifold methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The nonlinear equationm ty =(m yxx +m x m y ) x is throughly analyzed. The Painlevé test yields a positive result. The Bäckhand transformations are found and the Darboux-MoutardMatveev formalism arises in the context of this analysis. Some solutions and their interactions are also analyzed. The singular manifold equations are also used to determine symmetry reductions. This procedure can be related with the direct method of Clarkson and Kruskal.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 307-314 
    ISSN: 1572-9036
    Keywords: 58F07 ; functionals ; limit pass ; dispersion ; Cauchy problem ; Galerkin method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present the new approach to the background of approximate methods of convergence based on the theory of functional solutions and solutions in the mean one for conservation laws. The applications to the Cauchy problem to KdV equation, when dispersion tends to zero are considered. Also the Galerkin method for a periodic problem for the KdV equation is considered.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 245-276 
    ISSN: 1572-9036
    Keywords: 58F07 ; symmetry reductions ; exact solutions ; shallow water wave equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study symmetry reductions and exact solutions of the shallow water wave (SWW) equation $$u_{xxxt} + \alpha u_x u_{xt} + \beta u_t u_{xx} - u_{xt} - u_{xx} = 0,$$ whereα andβ are arbitrary, nonzero, constants, which is derivable using the so-called Boussinesq approximation. Two special cases of this equation, or the equivalent nonlocal equation obtained by settingu x =U, have been discussed in the literature. The caseα=2β was discussed by Ablowitz, Kaup, Newell and Segur (Stud. Appl. Math.,53 (1974), 249), who showed that this case was solvable by inverse scattering through a second-order linear problem. This case and the caseα=β were studied by Hirota and Satsuma (J. Phys. Soc. Japan,40 (1976), 611) using Hirota's bi-linear technique. Further, the caseα=β is solvable by inverse scattering through a third-order linear problem. In this paper, a catalogue of symmetry reductions is obtained using the classical Lie method and the nonclassical method due to Bluman and Cole (J. Math. Mech,18 (1969), 1025). The classical Lie method yields symmetry reductions of (1) expressible in terms of the first, third and fifth Painlevé transcendents and Weierstrass elliptic functions. The nonclassical method yields a plethora of exact solutions of (1) withα=β which possess a rich variety of qualitative behaviours. These solutions all like a two-soliton solution fort 〈 0 but differ radically fort 〉 0 and may be viewed as a nonlinear superposition of two solitons, one travelling to the left with arbitrary speed and the other to the right with equal and opposite speed. These families of solutions have important implications with regard to the numerical analysis of SWW and suggests that solving (1) numerically could pose some fundamental difficulties. In particular, one would not be able to distinguish the solutions in an initial-value problem since an exponentially small change in the initial conditions can result in completely different qualitative behaviours. We compare the two-soliton solutions obtained using the nonclassical method to those obtained using the singular manifold method and Hirota's bi-linear method. Further, we show that there is an analogous nonlinear superposition of solutions for two (2+1)dimensional generalisations of the SWW Equation (1) withα=β. This yields solutions expressible as the sum of two solutions of the Korteweg-de Vries equation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 44 (1996), S. 185-206 
    ISSN: 1572-9036
    Keywords: 17B68 ; 35Q58 ; 58F07 ; BKP hierarchy ; pseudo-differential operators ; vertex operators ; differential operators on the circle ; the string equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the BKP hierarchy and its n-reduction, for the case that n is odd. This is related to the principal realization of the basic module of the twisted affine Lie algebra % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqpepeea0dXdb9aqVe% 0larpepe0lb9cs0-LqLs-Jarpepeea0-qqVe0Firpepa0xar-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaadaWfGaqaaiGaco% hacaGGSbWaaSbaaSqaaiaac6gaaeqaaaqabKqaGhaacqWIh4ETaaGc% daahaaWcbeqaaiaacIcacaaIYaGaaiykaaaaaaa!3B2F!\[\mathop {{\mathop{\rm sl}\nolimits} _n }\limits^ ^{(2)} \]. We show that the following two statements for a BKP τ function are equivalent: (1) τ is is n-reduced and satisfies the string equation, i.e., L -1τ=0, where L -1 is an element of some ‘natural’ Virasoro algebra. (2) τ satisfies the vacuum constraints of the BW 1+∞ algebra. Here BW 1+∞ is the natural analog of the W 1+∞ algebra, which plays a role in the KP case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 5 (1995), S. 25-44 
    ISSN: 1572-8641
    Keywords: Cognition ; connectionism ; computationalism ; mental representation ; philosophy of mind
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Computationalist theories of mind require brain symbols, that is, neural events that represent kinds or instances of kinds. Standard models of computation require multiple inscriptions of symbols with the same representational content. The satisfaction of two conditions makes it easy to see how this requirement is met in computers, but we have no reason to think that these conditions are satisfied in the brain. Thus, if we wish to give computationalist explanations of human cognition, without committing ourselvesa priori to a strong and unsupported claim in neuroscience, we must first either explain how we can provide multiple brain symbols with the same content, or explain how we can abandon standard models of computation. It is argued that both of these alternatives require us to explain the execution of complex tasks that have a cognition-like structure. Circularity or regress are thus threatened, unless noncomputationalist principles can provide the required explanations. But in the latter case, we do not know that noncomputationalist principles might not bear most of the weight of explaining cognition. Four possible types of computationalist theory are discussed; none appears to provide a promising solution to the problem. Thus, despite known difficulties in noncomputationalist investigations, we have every reason to pursue the search for noncomputationalist principles in cognitive theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 7 (1997), S. 571-579 
    ISSN: 1572-8641
    Keywords: systematicity ; connectionism ; cognitive architecture ; explanation ; structure-sensitivity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract In his discussion of results which I (with Michael Hayward) recently reported in this journal, Kenneth Aizawa takes issue with two of our conclusions, which are: (a) that our connectionist model provides a basis for explaining systematicity “within the realm of sentence comprehension, and subject to a limited range of syntax” (b) that the model does not employ structure-sensitive processing, and that this is clearly true in the early stages of the network's training. Ultimately, Aizawa rejects both (a) and (b) for reasons which I think are ill-founded. In what follows, I offer a defense of our position. In particular, I argue (1) that Aizawa adopts a standard of explanation that many accepted scientific explanations could not meet, and (2) that Aizawa misconstrues the relevant meaning of ‘structure-sensitive process’.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 8 (1998), S. 353-374 
    ISSN: 1572-8641
    Keywords: connectionism ; explicit ; implicit ; process ; representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Explicitness has usually been approached from two points of view, labelled by Kirsh the structural and the process view, that hold opposite assumptions to determine when information is explicit. In this paper, we offer an intermediate view that retains intuitions from both of them. We establish three conditions for explicit information that preserve a structural requirement, and a notion of explicitness as a continuous dimension. A problem with the former accounts was their disconnection with psychological work on the issue. We review studies by Karmiloff-Smith, and Shanks and St. John to show that the proposed conditions have psychological grounds. Finally, we examine the problem of explicit rules in connectionist systems in the light of our framework.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 5 (1995), S. 161-185 
    ISSN: 1572-8641
    Keywords: Consciousness ; sensation (qualia) ; connectionism ; recurrent networks ; distributed representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Connectionism and phenomenology can mutually inform and mutually constrain each other. In this manifesto I outline an approach to consciousness based on distinctions developed by connectionists. Two core identities are central to a connectionist theory of consciouness: conscious states of mind are identical to occurrent activation patterns of processing units; and the variable dispositional strengths on connections between units store latent and unconscious information. Within this broad framework, a connectionist model of consciousness succeeds according to the degree of correspondence between the content of human consciousness (the world as it is experienced) and the interpreted content of the network. Constitutive self-awareness and reflective self-awareness can be captured in a model through its ability to respond to self-reflexive information, identify self-referential categories, and process information in the absence of simultaneous input. The qualitative “feel” of sensation appears in a model as states of activation that are not fully discriminated by later processing. Connectionism also uniquely explains several specific features of experience. The most important of these is the superposition of information in consciousness — our ability to perceive more than meets the eye, and to apprehend complex categorical and temporal information in a single highly-cognized glance. This superposition in experience matches a superposition of representational content in distributed representations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 5 (1995), S. 219-242 
    ISSN: 1572-8641
    Keywords: Explicit ; implicit ; connectionism ; representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Much of traditional AI exemplifies the “explicit representation” paradigm, and during the late 1980's a heated debate arose between the classical and connectionist camps as to whether beliefs and rules receive an explicit or implicit representation in human cognition. In a recent paper, Kirsh (1990) questions the coherence of the fundamental distinction underlying this debate. He argues that our basic intuitions concerning ‘explicit’ and ‘implicit’ representations are not only confused but inconsistent. Ultimately, Kirsh proposes a new formulation of the distinction, based upon the criterion ofconstant time processing. The present paper examines Kirsh's claims. It is argued that Kirsh fails to demonstrate that our usage of ‘explicit’ and ‘implicit’ is seriously confused or inconsistent. Furthermore, it is argued that Kirsh's new formulation of the explicit-implicit distinction is excessively stringent, in that it banishes virtually all sentences of natural language from the realm of explicit representation. By contrast, the present paper proposes definitions for ‘explicit’ and ‘implicit’ which preserve most of our strong intuitions concerning straightforward uses of these terms. It is also argued that the distinction delineated here sustains the meaningfulness of the abovementioned debate between classicists and connectionists.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 6 (1996), S. 159-172 
    ISSN: 1572-8641
    Keywords: Compositionality ; connectionism ; functionalism ; language of thought ; systematicity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract The paper examines an alleged distinction claimed to exist by Van Gelder between two different, but equally acceptable ways of accounting for the systematicity of cognitive output (two “varieties of compositionality”): “concatenative compositionality” vs. “functional compositionality.” The second is supposed to provide an explanation alternative to the Language of Thought Hypothesis. I contend that, if the definition of “concatenative compositionality” is taken in a different way from the official one given by Van Gelder (but one suggested by some of his formulations) then there is indeed a different sort of compositionality; however, the second variety is not an alternative to the language of thought in that case. On the other hand, if the concept of concatenative compositionality is taken in a different way, along the lines of Van Gelder's explicit definition, then there is no reason to think that there is an alternative way of explaining systematicity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 8 (1998), S. 161-179 
    ISSN: 1572-8641
    Keywords: connectionism ; distributed representation ; frame problem ; systematicity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract This paper investigates connectionism's potential to solve the frame problem. The frame problem arises in the context of modelling the human ability to see the relevant consequences of events in a situation. It has been claimed to be unsolvable for classical cognitive science, but easily manageable for connectionism. We will focus on a representational approach to the frame problem which advocates the use of intrinsic representations. We argue that although connectionism's distributed representations may look promising from this perspective, doubts can be raised about the potential of distributed representations to allow large amounts of complexly structured information to be adequately encoded and processed. It is questionable whether connectionist models that are claimed to effectively represent structured information can be scaled up to a realistic extent. We conclude that the frame problem provides a difficulty to connectionism that is no less serious than the obstacle it constitutes for classical cognitive science.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 9 (1999), S. 383-398 
    ISSN: 1572-8641
    Keywords: classicism ; connectionism ; Klein group ; learning transfer ; normalization ; systematicity ; weight sharing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Minds are said to be systematic: the capacity to entertain certain thoughts confers to other related thoughts. Although an important property of human cognition, its implication for cognitive architecture has been less than clear. In part, the uncertainty is due to lack of precise accounts on the degree to which cognition is systematic. However, a recent study on learning transfer provides one clear example. This study is used here to compare transfer in humans and feedforward networks. Simulations and analysis show, that while feedforward networks with shared weights are capable of exhibiting transfer, they cannot support the same degree of transfer as humans. One interpretation of these results is that common connectionist models lack explicit internal representations permitting rapid learning.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 9 (1999), S. 197-221 
    ISSN: 1572-8641
    Keywords: cognitive architecture ; connectionism ; skills ; modules
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract In the late 1980s, there were many who heralded the emergence of connectionism as a new paradigm – one which would eventually displace the classically symbolic methods then dominant in AI and Cognitive Science. At present, there remain influential connectionists who continue to defend connectionism as a more realistic paradigm for modeling cognition, at all levels of abstraction, than the classical methods of AI. Not infrequently, one encounters arguments along these lines: given what we know about neurophysiology, it is just not plausible to suppose that our brains are digital computers. Thus, they could not support a classical architecture. I argue here for a middle ground between connectionism and classicism. I assume, for argument's sake, that some form(s) of connectionism can provide reasonably approximate models – at least for lower-level cognitive processes. Given this assumption, I argue on theoretical and empirical grounds that most human mental skills must reside in separate connectionist modules or ‘sub-networks’. Ultimately, it is argued that the basic tenets of connectionism, in conjunction with the fact that humans often employ novel combinations of skill modules in rule following and problem solving, lead to the plausible conclusion that, in certain domains, high level cognition requires some form of classical architecture. During the course of argument, it emerges that only an architecture with classical structure could support the novel patterns of information flow and interaction that would exist among the relevant set of modules. Such a classical architecture might very well reside in the abstract levels of a hybrid system whose lower-level modules are purely connectionist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Annalen 303 (1995), S. 47-62 
    ISSN: 1432-1807
    Keywords: 14H40 ; 17B20 ; 32L05 ; 58F07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 443-448 
    ISSN: 1436-4646
    Keywords: Global optimization ; Discrete optimization ; Algorithm complexity ; Random search ; Markov chains
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous global optimization. When a uniform distribution is used in PAS, it has been shown to have complexity which is linear in dimension. We define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for then-dimensional lattice {1,⋯,k} n , the expected number of iterations to find the global optimum is linear inn. Many discrete combinatorial optimization problems, although having intractably large domains, have quite small ranges. The strong version of PAS for all problems, and the weak version of PAS for a limited class of problems, has complexity the order of the size of the range.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 81 (1998), S. 127-146 
    ISSN: 1436-4646
    Keywords: Global optimization ; Lipschitzean first derivatives ; Numerical algorithms ; Convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper new global optimization algorithms are proposed for solving problems where the objective function is univariate and has Lipschitzean first derivatives. To solve this problem, smooth auxiliary functions, which are adaptively improved during the course of the search, are constructed. Three new algorithms are introduced: the first used the exact a priori known Lipschitz constant for derivatives; the second, when this constant is unknown, estimates it during the course of the search and finally, the last method uses neither the exact global Lipschitz constant nor its estimate but instead adaptively estimates the local Lipschitz constants in different sectors of the search region during the course of optimization. Convergence conditions of the methods are investigated from a general viewpoint and some numerical results are also given. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 34 (1995), S. 379-384 
    ISSN: 1573-0530
    Keywords: 35Q58 ; 58F07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract An explanation for the so-called constrained hierarchies is presented by linking them with the symmetries of the KP hierarchy. While the existence of ordinary symmetries (belonging to the hierarchy) allows one to reduce the KP hierarchy to the KdV hierarchies, the existence of additional symmetries allows one to reduce the KP to the constrained KP.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 34 (1995), S. 17-24 
    ISSN: 1573-0530
    Keywords: 58F07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We define Poisson structures which lead to a tri-Hamiltonian formulation for the full Kostant-Toda lattice. In addition, a hierarchy of vector fields called master symmetries are constructed and they are used to generate the nonlinear Poisson brackets and other invariants. Various deformation relations are investigated. The results are analogous to results for the finite nonperiodic Toda lattice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 37 (1996), S. 435-448 
    ISSN: 1573-0530
    Keywords: 58F07 ; Kadomtsev-Petviashvili hierarchy ; super-integrable systems ; super-boson-fermion correspondence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We obtain super-integrable systems from the super-KP hierarchy of Kac and van de Leur and give a method to construct solutions. In particular, we apply the method to get the super-version of the KP 1-soliton solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 37 (1996), S. 475-482 
    ISSN: 1573-0530
    Keywords: 70H99 ; 58F07 ; Nambu-Poisson manifolds ; Lie algebras
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We present recent developments in the theory of Nambu mechanics, which include new examples of Nambu-Poisson manifolds with linear Nambu brackets and new representations of Nambu-Heisenberg commutation relations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 33 (1995), S. 159-169 
    ISSN: 1573-0530
    Keywords: 35Q53 ; 58F07 ; 17B66
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract TheW KP (N) algebra has been identified with the second Hamiltonian structure in theNth Hamiltonian pair of the KP hierarchy. In this Letter, by constructing the Miura map that decomposes the second Hamiltonian structure in theNth pair of the KP hierarchy, we show thatW KP (N) can also be decomposed toN independent copies ofW KP (1) algebras, therefore its free-field realization can be worked out by constructing free fields for each copy ofW KP (1) . In this way, the free fields may consist ofN + 2n number of bosons, among them, 2n are in pairs, wheren is an arbitrary integer between 1 andN. We also express the currents ofW KP (N) in terms of the currents ofN —n copies of U(1) andn copies of SL(2,R) k algebras with levelk = 1. By reductions, we give similar results forW ∞ (N) andW 3 (2) algebra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 36 (1996), S. 117-126 
    ISSN: 1573-0530
    Keywords: 70H99 ; 58F07 ; Nambu mechanics ; Hamiltonian mechanics ; SO(4) Kepler problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract It is shown that several Hamiltonian systems possessing dynamical or hidden symmetries can be realized within the framework of Nambu's generalized mechanics. Among such systems are the SU(n)-isotropic harmonic oscillator and the SO(4) Kepler problem. As required by the formulation of Nambu dynamics, the integrals of motion for these systems necessarily become the so-called generalized Hamiltonians. Furthermore, in most of these problems, the definition of these generalized Hamiltonians is not unique.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 35 (1995), S. 229-236 
    ISSN: 1573-0530
    Keywords: 35Q58 ; 58F07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract A constrained KP hierarchy is discussed that was recently suggested by Aratynet al. and by Bonoraet al. This hierarchy is a restriction of the KP to a submanifold of operators which can be represented as a ratio of two purely differential operators of prescribed orders. Explicit formulas for action of vector fields on these two differential operators are written which gives a new description of the hierarchy and provides a new, more constructive proof of compatibility of the constraint with the hierarchy. Also, the Poisson structure of the constrained hierarchy is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 37 (1996), S. 117-135 
    ISSN: 1573-0530
    Keywords: 58F05 ; 58F07 ; 70Exx ; 70Hxx ; integrable systems ; Euler equations on Lie algebras ; Hamiltonian structures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We propose a bi-Hamiltonian formulation of the Euler equation for the free n-dimensional rigid body moving about a fixed point. This formulation lives on the ‘physical’ phase space so(n), and is different from the bi-Hamiltonian formulation on the extended phase space sl(n), considered previously in the literature. Using the bi-Hamiltonian structure on so(n), we construct new recursion schemes for the Mishchenko and Manakov integrals of motion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 38 (1996), S. 289-296 
    ISSN: 1573-0530
    Keywords: 33E30 ; 39A10 ; 58F07 ; 58F08 ; discrete painlevé equations ; Miura transformations ; particular solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We derive the form of the Miura transformation of the discrete Pv equation and show that it is indeed an auto-Bäcklund transformation, i.e. it relates the discrete Pv to itself. Using this auto-Bäcklund, we obtain the Schlesinger transformations of discrete Pv which relate the solution for one set of the parameters of the equation to that of another set of neighbouring parameters. Finally, we obtain particular solutions of the discrete Pv (i.e. solutions that exist only for some specific values of the parameters). These solutions are of two types: solutions involving the confluent hypergeometric function (on codimension-one submanifold of parameters) and rational solutions (on codimension-two submanifold of parameters).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 38 (1996), S. 389-397 
    ISSN: 1573-0530
    Keywords: 58F07 ; 39A10 ; 82B23 ; discrete integrable systems ; Yang-Baxter equation ; tetrahedron equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract The local Yang-Baxter equation (YBE), introduced by Maillet and Nijhoff, is a proper generalization to three dimensions of the zero curvature relation. Recently, Korepanov has constructed an infinite set of integrable three-dimensional lattice models, and has related them to solutions to the local YBE. The simplest Korepanov model is related to the star-triangle relation in the Ising model. In this Letter the corresponding discrete equation is derived. In the continuous limit it leads to a differential three-dimensional equation, which is symmetric with respect to all permutations of the three coordinates. A similar analysis of the star-triangle transformation in electric networks leads to the discrete bilinear equation of Miwa, associated with the BKP hierarchy. Some related operator solutions to the tetrahedron equation are also constructed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 35 (1995), S. 115-122 
    ISSN: 1573-0530
    Keywords: 35Q51 ; 35Q53 ; 58F07 ; 81R10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We consider the Darboux type transformations for the spectral problems of supersymmetric KdV systems. The supersymmetric analogies of Darboux and Darboux-Levi transformations are established for the spectral problems of Manin-Radul-Mathieu sKdV and Manin-Radul sKdV. Several Bäcklund transformations are derived for the MRM sKdV and MR sKdV systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 36 (1996), S. 1-15 
    ISSN: 1573-0530
    Keywords: 35Q58 ; 58F07 ; constrained KP hierarchies ; tau functions ; Segal-Wilson theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract In this Letter, we study the constrained KP hierarchies by employing Segal-Wilson's theory on the τ-functions of the KP hierarchy. We first describe the elements of the Grassmannian which correspond to solutions of the constrained KP hierarchy, and then we show how to construct its rational and soliton solutions from these elements of the Grassmannian.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 36 (1996), S. 35-44 
    ISSN: 1573-0530
    Keywords: 35Q53 ; 58F07 ; 17B66 ; KP hierarchy ; Hamiltonian structures ; Miura map ; pseudodifferential operators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract It is known that second Hamiltonian structures of the KP hierarchy are parameterized by a continuous complex parameter q and correspond to the W-infinite algebra of W infKP sup(q) . In this Letter, by constructing a Miura map, we first show a generalized decomposition theorem to the second Hamiltonian structures and then establish a relation between those structures which corresponds to values (q+1) and q of the parameter, respectively. This discussion also gives a better understanding to the structures of W infKP sup(q) , its reduced $$\hat W_\infty ^{(q)} $$ algebras, and their free fields realizations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 36 (1996), S. 55-63 
    ISSN: 1573-0530
    Keywords: 33E05 ; 58F07 ; 82B10 ; invariants of motion ; elliptic interaction ; Calogero-Moser equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract It is shown that for a one-parameter set H N of linear combinations of N(N−1)/2 elementary transpositions {P jk } (1≤j〈k≤N) at arbitrary natural N≥3, one can construct a variety {I m } (3≤m≤N) of operators which commute with H N . Being applied to SU(n) spin representations of the permutation group, this proves the integrability of 1D periodic spin chains with elliptic short-range interaction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 36 (1996), S. 223-229 
    ISSN: 1573-0530
    Keywords: 58F07 ; Kadomtsev-Petviashvili hierarchy ; integrable hierarchies ; commuting flows
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract The KP hierarchy has been extended to a large set of integrable hierarchies. The main idea is to utilize the additional symmetry of the KP hierarchy, although not commuting among themselves. But we found that their proper combinations do commute with the original KP flows and among themselves, so as to give rise to an enlarged integrable hierarchy, which we call the generalized KP hierarchy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Letters in mathematical physics 37 (1996), S. 37-47 
    ISSN: 1573-0530
    Keywords: 58F07 ; 34A05 ; Toda hierarchy ; initial-value problem ; QR factorization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Abstract We give an explicit formula for the solution to the initial-value problem of the full symmetric Toda hierarchy. The formula is obtained by the orthogonalization procedure of Szegö, and is also interpreted as a consequence of the QR factorization method of Symes. The sorting property of the dynamics is also proved for the case of a generic symmetric matrix in the sense described in the text, and generalizations of tridagonal formulae are given for the case of matrices with 2M+1 nonzero diagonals.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics & optimization 34 (1996), S. 161-182 
    ISSN: 1432-0606
    Keywords: Global optimization ; Quadratic cost ; Quadratic equality constraints ; Multivariate polynomials ; Resultants ; 49N99 ; 90C26 ; 90C30 ; 65K05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In the area of broad-band antenna array signal processing, the global minimum of a quadratic equality constrained quadratic cost minimization problem is often required. The problem posed is usually characterized by a large optimization space (around 50–90 tuples), a large number of linear equality constraints, and a few quadratic equality constraints each having very low rank quadratic constraint matrices. Two main difficulties arise in this class of problem. Firstly, the feasibility region is nonconvex and multiple local minima abound. This makes conventional numerical search techniques unattractive as they are unable to locate the global optimum consistently (unless a finite search area is specified). Secondly, the large optimization space makes the use of decision-method algorithms for the theory of the reals unattractive. This is because these algorithms involve the solution of the roots of univariate polynomials of order to the square of the optimization space. In this paper we present a new algorithm which exploits the structure of the constraints to reduce the optimization space to a more manageable size. The new algorithm relies on linear-algebra concepts, basic optimization theory, and a multivariate polynomial root-solving tool often used by decision-method algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 93-125 
    ISSN: 1572-9036
    Keywords: 58F07 ; integration ; finite-gap theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 39-67 
    ISSN: 1572-9036
    Keywords: 58F07 ; gravity waves ; internal solitons ; nonlinear accoustics ; plasma physics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 5-37 
    ISSN: 1572-9036
    Keywords: 58F07 ; integrability ; KdV equation ; nonlinear integrable wave functions ; monodromy problems ; automorphic functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The study of integrable systems and the notion of integrability has been re-energized with the discovery that infinite-dimensional systems such as the Korteweg-de Vries equation are integrable. In this paper, the following novel aspects of integrability are described: (i) solutions of Darboux, Brioschi, Halphen-type systems and their relationships to monodromy problems and automorphic functions, (ii) computational chaos in integrable systems, (iii) we explain why we believe that homoclinic structures and homoclinic chaos associated with nonlinear integrable wave problems, will be observed in appropriate laboratory experiments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 69-84 
    ISSN: 1572-9036
    Keywords: 58F07 ; classical inverse scattering method ; nonlinear Schrödinger equation ; soliton theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 85-90 
    ISSN: 1572-9036
    Keywords: 58F07 ; optical solitons ; integrability ; controllability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A brief historical review and recent developments of theories and experiments of optical solitons in fibers are presented with particular emphasis on their integrability and controllability in real systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 175-192 
    ISSN: 1572-9036
    Keywords: 35Q53 ; 58F07 ; Kadomtsev-Petviashvili equation ; spectral transform
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The solutionu(t, x, y) of the Kadomtsev-Petviashvili I (KPI) equation with given initial data u(0,x, y) belonging to the Schwartz space is considered. No additional special constraints, usually considered in the literature as ∝dxu(0,x,y)=0 are required to be satisfied by the initial data. The spectral theory associated with KPI is studied in the space of the Fourier transform of the solutions. The variablesp={p 1,p 1} of the Fourier space are shown to be the most convenient spectral variables to use for spectral data. Spectral data are shown to decay rapidly at largep but to be discontinuous atp=0. Direct and inverse problems are solved with special attention to the behavior of all the quantities involved in the neighborhood oft=0 andp=0. It is shown in particular that the solutionu(t, x, y) has a time derivative discontinuous att = 0 and that at anyt ≠ 0 it does not belong to the Schwartz space no matter how small in norm and rapidly decaying at large distances the initial data are chosen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 193-228 
    ISSN: 1572-9036
    Keywords: 58F07 ; integrable systems ; solitons
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We trace the connections back from the paper by D. J. Korteweg and G. de Vries of 1895 to the sequence of events which began in August 1834 when J. S. Russell observed the soliton and so explain why KdV's paper was so much concerned with ‘change of form of long waves’. From this we trace a forward path which since 1895 has seen the discovery of the inverse method, associated with this a far-reaching mathematical structure, and at 1995 found a basis for two-dimensional quantum gravity intimately connected with the Korteweg-de Vries equation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 229-244 
    ISSN: 1572-9036
    Keywords: 35Q20 ; 58F07 ; integrable PDEs ; integrable dynamical systems ; integrability in multidimensions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The investigation of nonlinear evolution equations and dynamical systems integrable in multidimensions constitutes at present our main research interest. Here we survey findings obtained recently as well as over time: solvable equations (both PDEs and ODEs) are reported, philosophical motivations and methodological approaches are outlined. For more detailed treatments, including the display and analysis of solutions, the interested reader is referred to the original papers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 379-387 
    ISSN: 1572-9036
    Keywords: 58F07 ; Gaussian curvature ; inverse spectral transform
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An intristic geometry of surfaces is discussed. In geodesic coordinates the Gauss equation is reduced to the Schrödinger equation where the Gaussian curvature plays the role of a potential. The use of this fact provides an infinite set of explicit expressions for the curvature and metric of a surface. A special case is governed by the KdV equation for the Gaussian curvature. We consider the integrable dynamics of curvature via the KdV equation, higher KdV equations and (2+1)-dimensional integrable equations with breaking solitons.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 389-403 
    ISSN: 1572-9036
    Keywords: 58F07 ; reductive perturbation method ; multiple time formalism ; higher-order evolution equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract By using the reductive perturbation method of Taniuti with the introduction of an infinite sequence of slow time variablesτ 1,τ 3,τ 5, ..., we study the propagation of long surface-waves in a shallow inviscid fluid. The Korteweg-de Vries (KdV) equation appears as the lowest order amplitude equation in slow variables. In this context, we show that, if the lowest order wave amplitudeζ 0 satisfies the KdV equation in the timeτ 3, it must satisfy the (2n+1)th order equation of the KdV hierarchy in the timeτ n+1, withn=2,3,4, ... As a consequence of this fact, we show with an explicit example that the secularities of the evolution equations for the higher-order terms (ζ 1,ζ 2, ...) of the amplitude can be eliminated whenζ 0 is a solitonic solution to the KdV equation. By reversing this argument, we can say that the requirement of a secular-free perturbation theory implies that the amplitudeζ 0 satisfies the (2n+ 1)th order equation of the KdV hierarchy in the timeτ 2n+1. This essentially means that the equations of the KdV hierarchy do play a role in perturbation theory. Thereafter, by considering a solitary-wave solution, we show, again with an explicit, example that the elimination of secularities through the use of the higher order KdV hierarchy equations corresponds, in the laboratory coordinates, to a renormalization of the solitary-wave velocity. Then, we conclude that this procedure of eliminating secularities is closely related to the renormalization technique developed by Kodama and Taniuti.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 445-455 
    ISSN: 1572-9036
    Keywords: 35Q51 ; 35Q55 ; 58F07 ; bidimensional solitons ; Davey-Stewartson equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Exponentially localized soliton solutions have been found recently for all the equations of the hierarchy related to the Zakharov-Shabat hyperbolic spectral problem in the plane. In particular theN 2-soliton solution of the Davey-Stewartson I equation is considered. It is shown that the boundaries fix the kinematics of solitons, while the dynamics of their mutual interaction is determined by the chosen initial condition. The interacting solitons can have, asymptotically, zero mass and can simulate quantum effects as inelastic scattering, fusion and fission, creation and annihilation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    ISSN: 1572-9036
    Keywords: 58F07 ; cnoidal waves ; solitary waves ; dissipation-modified KdV equation ; stationary waves
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A generalization of the Korteweg-de Vries equation incorporating an energy input-output balance, hence a dissipation-modified KdV equation is considered. The equation is relevant to describe, for instance, nonlinear Marangoni-Bénard oscillatory instability in a liquid layer heated from above. Cnoidal waves and solitary waves of this equation are obtained both asymptotically and numerically.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 405-433 
    ISSN: 1572-9036
    Keywords: 58F07 ; Darboux transformations ; Kadomtsev-Petviashvili equations ; Krichever-Novikov equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that the action of a special ‘rank 2’ or ‘rank 3’ Darboux transformation, calledtransference, upon a pair of commuting ordinary differential operators of orders 4 and 6 implements the Abelian sum on their elliptic joint spectrum. A consequence of this is that, under the deformation of these commuting operators by the KP flow, every ‘rank 2’ KP solution corresponds to a solution of the Krichever-Novikov (KN) equation, and vice versa, with the transference process providing the correspondence between (2+1) and (1+1) dimensions. For a singular joint spectrum, it is further shown that transference at the singular point produces a correspondence between solutions of the singular KN equation and those of the KdV equation. These correspondences are illustrated by considering examples of a nondecaying rational KdV or Boussinesq solutions and the corresponding rational, singular-KN and rational KP solutions which the transference process generates.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 477-487 
    ISSN: 1572-9036
    Keywords: 58F07 ; KP equations ; Cauchy problem ; localized solitary waves
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We survey some recent results concerning the generalized Kadomtsev-Petviashvili equations, which are natural extensions of KdV type equations to higher dimensions. We will focus on rigorous results of the Cauchy problem and on the existence and properties of localized solitary waves.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 41 (1995), S. 57-98 
    ISSN: 1572-9036
    Keywords: 16W30 ; 58F07 ; 57M25 ; multiparameter quantum group ; multiparameterR-matrix ; Yang-Baxter equation ; Hopf algebra ; bialgebra ; PBW-algebra ; knot invariant ; link invariant ; confluent rewriting system ; fundamental communication relations (FCR) ; diamond lemma ; generalized quantum space
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There exists an ( 2 n ) + 1 parameter quantum group deformation of GLn which has been constructed independently by several (groups of) authors. In this note, I give an explicitR-matrix for this multiparameter family. This gives additional information on the nature of this family and facilitates some calculations. This explicitR-matrix satisfies the Yang-Baxter equation. The centre of the paper is Section 3 which describes all solutions of the YBE under the restriction r cd ab =0 unlessa, b=c, d. One kind of the most general constituents of these solutions precisely corresponds to the ( 2 n ) + 1 parameter quantum group mentioned above. I describe solutions which extend to an enhanced Yang-Baxter operator and, hence, define link invariants. The paper concludes with some preliminary results on these link invariants.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Journal of classification 13 (1996), S. 3-18 
    ISSN: 1432-1343
    Keywords: Unidimensional scaling ; Seriation ; Local minima ; Global optimization ; Smoothing technique ; Multidimensional scaling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For the problem of metric unidimensional scaling, the number of local minima is estimated. For locating the globally optimal solution we develop an approach, called the “smoothing technique.” Although not guaranteed inevitably to locate the global optimum, the smoothing technique did so in all computational experiments where the global optimum was known.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 10 (1995), S. 223-228 
    ISSN: 1572-8404
    Keywords: Clade ; class ; definition ; defining property ; individual ; intension ; name ; organism ; ostensive definition ; species ; taxon ; taxonomy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 11 (1996), S. 1-20 
    ISSN: 1572-8404
    Keywords: Darwin ; functionalism ; structuralism ; causal pluralism
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract Historians of Biology have divided nineteenth century naturalists into two basic camps, Functionalists and Structuralists. This division is supposed to demarcate the alternative causal presuppositions working beneath research programs. If one is functionally oriented, then organic form will be contingent upon the causal powers of the environment. If structurally oriented, one argues for nonfunctional mechanisms (e.g., internal laws of growth) to account for organic form. Traditionally, Darwin has been grouped with the functionalists because natural selection (an adaptational mechanism) plays the prominent role in shaping organic form. In this paper, I sketch the dichotomy of functionalism versus structuralism and then argue that Darwin cannot be characterized adequately with this dichotomy. I argue that Darwin can incorporate both causal stories because he makes two important modifications to the traditional metaphysical presuppositions. I then offer some brief reflections on the import of Darwin's causal pluralism for the Philosophy of Science.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 11 (1996), S. 215-244 
    ISSN: 1572-8404
    Keywords: Classes ; classification ; evolution ; Buffon ; Darwin ; Ghiselin ; individuality ; ordering ; concept of species
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract Since the 1970s, there has been a tremendous amount of literature on Ghiselin's proposal that “species are individuals”. After recalling the origins and stakes of this thesis in contemporary evolutionary theory, I show that it can also be found in the writings of the French naturalist Buffon in the 18th Century. Although Buffon did not have the conception that one species could be derived from another, there is an interesting similarity between the modern argument and that of Buffon regarding the “individuality of species’. The analogy is strong enough to force us to recognize that genuine evolutionary (or Darwinian) questions might be of secondary importance in the discussion. In consequence, the third section of the paper proposes an alternative schema for the “logical structure” of the Darwinian concept of species. Darwin distinguished the problem of the designation of a concrete species, and the problem of its signification of species within his theory of descent? The resulting notion of species involves a logical structure based on the fusion of the logical operations of classification and ordering. The difficulty — and interest — is that this interpretation of species does not entail any precise operational definition of species; it can only tell us what the ultimate signification of classification is within the theory of descent with modification through natural selection.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 11 (1996), S. 405-420 
    ISSN: 1572-8404
    Keywords: species ; evolution ; natural selection ; gradualism ; punctuated equilibria ; variation ; Lamarck ; Darwin
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract Species are thought by many to be important units of evolution. In this paper, I argue against that view. My argument is based on an examination of the role of species in the synthetic theory of evolution. I argue that if one adopts a gradualist view of evolution, one cannot make sense of the claim that species are “units” in the minimal sense needed to claim that they are units of evolution, namely, that they exist as discrete entities over time. My second argument is directed against an appeal to Eldredge and Gould's theory of punctuated equilibria to support the claim that species are units of evolution. If one adopts their view, it may be possible to identify discrete temporal entities that can plausibly be termed ‘species’, but there is no reason to claim that those entities are “units of evolution”. Thus, on two plausible interpretations of the role of natural selection in the process of evolution, species are of no special importance. I then consider some of the reasons why species have been thought to be important evolutionary units by many contemporary evolutionary biologists. Finally, I discuss briefly the implications of this conclusion for evolutionary biology.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 11 (1996), S. 519-534 
    ISSN: 1572-8404
    Keywords: Hume ; Darwin ; Dawkins ; Sober ; Mackie ; Penrose ; argument for design ; biological design ; cosmological fine-tuning ; world ensemble ; chance ; theism ; God
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract There seems to be a widespread conviction — evidenced, for example, in the work of Mackie, Dawkins and Sober — that it is Darwinian rather than Humean considerations which deal the fatal logical blow to arguments for intelligent design. I argue that this conviction cannot be well-founded. If there are current logically decisive objections to design arguments, they must be Humean — for Darwinian considerations count not at all against design arguments based upon apparent cosmological fine-tuning. I argue, further, that there are good Humean reasons for atheists and agnostics to resist the suggestion that apparent design — apparent biological design and/or apparent cosmological fine-tuning — establishes (or even strongly supports) the hypothesis of intelligent design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 13 (1998), S. 443-470 
    ISSN: 1572-8404
    Keywords: Buffon ; Darwin ; Gayon ; species ; individuality ; evolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract Gayon's recent claim that Buffon developed a concept of species as physical individuals is critically examined and rejected. Also critically examined and rejected is Gayon's more central thesis that as a consequence of his analysis of Buffon's species concept, and also of Darwin's species concept, it is clear that modern evolutionary theory does not require species to be physical individuals. While I agree with Gayon's conclusion that modern evolutionary theory does not require species to be physical individuals, I disagree with his reasons and instead provide logical rather than historical reasons for the same conclusion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Biology and philosophy 14 (1999), S. 253-278 
    ISSN: 1572-8404
    Keywords: ancestry ; Bayesianism ; creationism ; Darwin ; evolution ; likelihood ; natural selection ; phylogeny ; probability ; Reichenbach
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Philosophy
    Notes: Abstract Modus Darwin is a principle of inference that licenses the conclusion that two species have a common ancestor, based on the observation that they are similar. The present paper investigates the principle's probabilistic foundations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 133-158 
    ISSN: 1572-9036
    Keywords: 58F07 ; lattice equations ; linearization ; discretization ; Miura transformations ; similarity reductions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We review the different aspects of integrable discretizations in space and time of the Korteweg-de Vries equation, including Miura transformations to related integrable difference equations, connections to integrable mappings, similarity reductions and discrete versions of Painlevé equations as well as connections to Volterra systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 39 (1995), S. 159-172 
    ISSN: 1572-9036
    Keywords: 58F07 ; visiometrics ; reduced modeling ; asymptotics ; fluid dynamics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper I give a brief personal review of the history of the early soliton days and how they led to thevisiometrics and reduced modeling paradigm that has been a part of my approach to nonlinear science in the last three decades. I illustrate it with HEC (Hybrid Eiliptic-Contour): a fast, minimal, asymptotically motivated model for unforced, 2-dimensional incompressible weakly dissipative turbulence (U2DIT).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 41 (1995), S. 193-226 
    ISSN: 1572-9036
    Keywords: 18D20 ; 35A99 ; 58G99 ; 81R50 ; 58F07 ; 58A50 ; 35Q53 ; monoidal categories ; symmetries ; colours ; colour commutative algebras ; colour differential forms and de Rham complexes ; colour differential operators and equations ; colour Spencer complexes ; quantizations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A colour calculus linked with an any discrete groupG is developed. Colour differential operators and colour jets are introduced. Algebras colour differential forms and de Rham complexes are constructed. For colour differential equations, Spencer complexes are constructed. Relations between colour commutative algebras and quantizations of usual algebras are considered.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 41 (1995), S. 167-191 
    ISSN: 1572-9036
    Keywords: 58F07 ; 58G07 ; 58H10 ; 58H15 ; 58G37 ; 58A50 ; 35Q53 ; 35Q55 ; 35Q58 ; 58G35 ; 16W55 ; Graded differential equations ; Frölicher-Nijenhuis bracket ; cohomologies ; deformations ; symmetries ; recursion operators ; coverings ; integrable systems ; super KdV equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An algebraic model for nonlinear partial differential equations (PDE) in the category ofn-graded modules is constructed. Based on the notion of the graded Frölicher-Nijenhuis bracket, cohomological invariants H ▽ * (A) are related to each object (A, ▽) of the theory. Within this framework, H ▽ 0 (A) generalizes the Lie algebra of symmetries for PDE's, while H ▽ 1 (A) are identified with equivalence classes of infinitesimal deformations. It is shown that elements of a certain part of H ▽ 1 (A) can be interpreted as recursion operators for the object (A, ▽), i.e. operators giving rise to infinite series of symmetries. Explicit formulas for computing recursion operators are deduced. The general theory is illustrated by a particular example of a graded differential equation, i.e. the Super KdV equation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 41 (1995), S. 247-270 
    ISSN: 1572-9036
    Keywords: 58F07 ; 35Q53 ; soliton equations ; integrable systems ; bi-Hamiltonian manifolds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper aims to suggest a geometric point of view in the theory of soliton equations. The belief is that a deeper understanding of the origin of these equations may provide a better understanding of their remarkable properties. According to the geometric point of view, soliton equations are the outcome of a specific reduction process of a bi-Hamiltonian manifold. The suggestion of the paper is to pay attention also to the ‘unreduced form’ of soliton equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 443-455 
    ISSN: 1573-2878
    Keywords: Global optimization ; nonconvex programming ; mathematical programming ; DC-programming ; branch-and-bound methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In Ref. 1, a general class of branch-and-bound methods was proposed by Horst for solving global optimization problems. One of the main contributions of Ref. 1 was the opportunity of handling partition elements whose feasibility is not known. Deletion-by-infeasibility rules were presented for problems where the feasible set is convex, is defined by finitely many convex and reverse convex constraints, or is defined by Lipschitzian inequalities. In this note, we propose a new deletion-by-infeasibility rule for problems whose feasible set is defined by functions representable as differences of convex functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 88 (1996), S. 561-583 
    ISSN: 1573-2878
    Keywords: Global optimization ; biconcave programming ; concave minimization ; bilinear and quadratic programming ; branch-and-bound algorithms ; outer approximations.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A decomposition approach is proposed for minimizing biconcave functions over polytopes. Important special cases include concave minimization, bilinear and indefinite quadratic programming for which new algorithms result. The approach introduces a new polyhedral partition and combines branch-and-bound techniques, outer approximation, and projection of polytopes in a suitable way.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 90 (1996), S. 417-434 
    ISSN: 1573-2878
    Keywords: Global optimization ; primal-relaxed dual approach ; penalty methods ; nonsmooth optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A generalized primal-relaxed dual algorithm for global optimization is proposed and its convergence is proved. The (GOP) algorithm of Floudas and Visweswaran (Refs. 1–2) is shown to be a special case of this general algorithm. Within the proposed framework, the algorithm of Floudas and Visweswaran (Refs. 1–2) is further extended to the nonsmooth case. A penalty implementation of the extended (GOP) algorithm is studied to improve its efficiency.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 13 (1998), S. 433-444 
    ISSN: 1573-2916
    Keywords: Adaptive search ; Global optimization ; Multi-disciplinary optimization ; Simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Engineering design problems often involve global optimization of functions that are supplied as ‘black box’ functions. These functions may be nonconvex, nondifferentiable and even discontinuous. In addition, the decision variables may be a combination of discrete and continuous variables. The functions are usually computationally expensive, and may involve finite element methods. An engineering example of this type of problem is to minimize the weight of a structure, while limiting strain to be below a certain threshold. This type of global optimization problem is very difficult to solve, yet design engineers must find some solution to their problem – even if it is a suboptimal one. Sometimes the most difficult part of the problem is finding any feasible solution. Stochastic methods, including sequential random search and simulated annealing, are finding many applications to this type of practical global optimization problem. Improving Hit-and-Run (IHR) is a sequential random search method that has been successfully used in several engineering design applications, such as the optimal design of composite structures. A motivation to IHR is discussed as well as several enhancements. The enhancements include allowing both continuous and discrete variables in the problem formulation. This has many practical advantages, because design variables often involve a mixture of continuous and discrete values. IHR and several variations have been applied to the composites design problem. Some of this practical experience is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 55-78 
    ISSN: 1573-2916
    Keywords: Adaptation ; Clustering ; Covering ; Descent ; Global optimization ; Parameter identification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two strategies of randomized search, namely adaptive cluster covering (ACCO), and adaptive cluster covering with descent (ACD), are introduced and positioned in the group of the global optimization techniques. Several algorithms based on these new strategies are compared with other techniques of global randomized search in terms of effectiveness, efficiency and reliability. The other techniques include two versions of multistart, two versions of the controlled random search (CRS2 and CRS4) and the canonical genetic algorithm. Thirteen minimization problems including two parameter identification problems (for a flexible membrane mirror model and a hydrologic model) are solved. The algorithm ACCO, and a version of CRS4 algorithm (Ali and Storey 1994) show the highest efficiency, effectiveness and reliability. The second new algorithm, ACD, is in some runs very efficient and effective, but its reliability needs further improvement.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 6 (1995), S. 1-37 
    ISSN: 1573-2916
    Keywords: Global optimization ; simulated annealing ; Monte Carlo optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A method is presented for attempting global minimization for a function of continuous variables subject to constraints. The method, calledAdaptive Simulated Annealing (ASA), is distinguished by the fact that the fixed temperature schedules and step generation routines that characterize other implementations are here replaced by heuristic-based methods that effectively eliminate the dependence of the algorithm's overall performance on user-specified control parameters. A parallelprocessing version of ASA that gives increased efficiency is presented and applied to two standard problems for illustration and comparison.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 9 (1996), S. 1-22 
    ISSN: 1573-2916
    Keywords: Global optimization ; parallel computing ; interval arithmetic ; branch and bound ; dynamic load balancing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a new parallel method for verified global optimization, using a centralized mediator for the dynamic load balancing. The new approach combines the advantages of two previous models, the master slave model and the processor farm. Numerical results show the efficiency of this new method. For a large number of problems at least linear speedup is reached. The efficiency of this new method is also confirmed by a comparison with other parallel methods for verified global optimization. A theoretical study proves that using the best-first strategy to choose the next box for subdivision, no real superlinear speedup may be expected concerning the number of iterations. Moreover, the potential of parallelization of methods of verified global optimization is discussed in general.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 9 (1996), S. 141-151 
    ISSN: 1573-2916
    Keywords: Global optimization ; optimality condition ; second-order sufficient condition ; verification of convexity ; interval analysis ; primary 90C30 ; secondary 65G10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a new approach to the sufficient conditions of nonlinear programming. Main result is a sufficient condition for the global optimality of a Kuhn-Tucker point. This condition can be verified constructively, using a novel convexity test based on interval analysis, and is guaranteed to prove global optimality of strong local minimizers for sufficiently narrow bounds. Hence it is expected to be a useful tool within branch and bound algorithms for global optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 10 (1997), S. 77-90 
    ISSN: 1573-2916
    Keywords: Global optimization ; parametric quadratic programming ; non-convex quadratic program.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a method which when applied to certain non-convex QP will locatethe globalminimum, all isolated local minima and some of the non-isolated localminima. The method proceeds by formulating a (multi) parametric convex QP interms ofthe data of the given non-convex QP. Based on the solution of the parametricQP,an unconstrained minimization problem is formulated. This problem ispiece-wisequadratic. A key result is that the isolated local minimizers (including theglobalminimizer) of the original non-convex problem are in one-to-one correspondencewiththose of the derived unconstrained problem. The theory is illustrated with several numerical examples. A numericalprocedure isdeveloped for a special class of non-convex QP's. It is applied to a problemfrom theliterature and verifies a known global optimum and in addition, locates apreviously unknown local minimum.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 267-283 
    ISSN: 1573-2916
    Keywords: Polynomial programs ; Reformulation-Linearization Technique (RLT) ; Nonconvex programming ; Global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper considers the solution of nonconvex polynomial programming problems that arise in various engineering design, network distribution, and location-allocation contexts. These problems generally have nonconvex polynomial objective functions and constraints, involving terms of mixed-sign coefficients (as in signomial geometric programs) that have rational exponents on variables. For such problems, we develop an extension of the Reformulation-Linearization Technique (RLT) to generate linear programming relaxations that are embedded within a branch-and-bound algorithm. Suitable branching or partitioning strategies are designed for which convergence to a global optimal solution is established. The procedure is illustrated using a numerical example, and several possible extensions and algorithmic enhancements are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 353-372 
    ISSN: 1573-2916
    Keywords: Multiple objective linear programming ; Optimization over the efficient set ; Interactive methods ; Global optimization ; Citrus rootstockselection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A multiple objective linear programming problem (P) involves the simultaneous maximization of two or more conflicting linear objective functions over a nonempty polyhedron X. Many of the most popular methods for solving this type of problem, including many well-known interactive methods, involve searching the efficient set X E of the problem. Generally, however, X E is a complicated, nonconvex set. As a result, concepts and methods from global optimization may be useful in searching X E. In this paper, we will explain in theory, and show via an actual application to citrus rootstock selection in Florida, how the potential usefulness of the well-known interactive method STEM for solving problem (P) in this way, can depend crucially upon how accurately certain global optimization problems involving minimizations over X E are solved. In particular, we will show both in theory and in practice that the choice of whether to use the popular but unreliable ‘payoff table’ approach or to use one of the lesser known, more accurate global optimization methods to solve these problems can determine whether STEM succeeds or fails as a decision aid. Several lessons and conclusions of transferable value derived from this research are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 325-351 
    ISSN: 1573-2916
    Keywords: Chemical and phase equilibrium ; convexity ; Gibbs free energy ; Global optimization ; Non-convex optimization ; Tangent-plane criterion
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper addresses the problem of finding the number, K, of phases present at equilibrium and their composition, in a chemical mixture of n s substances. This corresponds to the global minimum of the Gibbs free energy of the system, subject to constraints representing m b independent conserved quantities, where m b=n s when no reaction is possible and m b ≤ n e +1 when reaction is possible and n e is the number of elements present. After surveying previous work in the field and pointing out the main issues, we extend the necessary and sufficient condition for global optimality based on the ‘reaction tangent-plane criterion’, to the case involving different thermodynamical models (multiple phase classes). We then present an algorithmic approach that reduces this global optimization problem (involving a search space of m b(n s-1) dimensions) to a finite sequence of local optimization steps inK(n s-1) -space, K ≤ m b, and global optimization steps in (n s-1)-space. The global step uses the tangent-plane criterion to determine whether the current solution is optimal, and, if it is not, it finds an improved feasible solution either with the same number of phases or with one added phase. The global step also determines what class of phase (e.g. liquid or vapour) is to be added, if any phase is to be added. Given a local minimization procedure returning a Kuhn–Tucker point and a global optimization procedure (for a lower-dimensional search space) returning a global minimum, the algorithm is proved to converge to a global minimum in a finite number of the above local and global steps. The theory is supported by encouraging computational results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 369-388 
    ISSN: 1573-2878
    Keywords: Global optimization ; Lipschitz optimization ; systems of inequalities ; branch-and-bounds methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Most numerically promising methods for solving multivariate unconstrained Lipschitz optimization problems of dimension greater than two use rectangular or simplicial branch-and-bound techniques with computationally cheap but rather crude lower bounds. Generalizations to constrained problems, however, require additional devices to detect sufficiently many infeasible partition sets. In this article, a new lower bounding procedure is proposed for simplicial methods yielding considerably better bounds at the expense of two linear programs in each iteration. Moreover, the resulting approach can solve easily linearly constrained problems, since in this case infeasible partition sets are automatically detected by the lower bounding procedure. Finally, it is shown that the lower bounds can be further improved when the method is applied to solve systems of inequalities. Implementation issues, numerical experiments, and comparisons are discussed in some detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 88 (1996), S. 751-763 
    ISSN: 1573-2878
    Keywords: Global optimization ; functions with concave minorants ; d.c. optimization ; branch-and-bounds methods ; systems of inequalities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this note, we show how a recent approach for solving linearly constrained multivariate Lipschitz optimization problems and corresponding systems of inequalities can be generalized to solve optimization problems where the objective function is only assumed to possess a concave minorant at each point. This class of functions includes not only Lipschitz functions and some generalizations, such as certain ρ-convex functions and Hölder functions with exponent greater than one, but also all functions which can be expressed as differences of two convex functions (d.c. functions). Thus, in particular, a new approach is obtained for the important problem of minimizing a d.c. function over a polytope.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 95 (1997), S. 347-369 
    ISSN: 1573-2878
    Keywords: Global optimization ; duality gap ; branch-and-bound techniques ; partly convex programs ; bilinear constraints ; sum of ratios ; reverse convex constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that, for very general classes of nonconvex global optimization problems, the duality gap obtained by solving a corresponding Lagrangian dual in reduced to zero in the limit when combined with suitably refined partitioning of the feasible set. A similar result holds for partly convex problems where exhaustive partitioning is applied only in the space of nonconvex variables. Applications include branch-and-bound approaches for linearly constrained problems where convex envelopes can be computed, certain generalized bilinear problems, linearly constrained optimization of the sum of ratios of affine functions, and concave minimization under reverse convex constraints.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 96 (1998), S. 575-588 
    ISSN: 1573-2878
    Keywords: Global optimization ; convergence ; stochastic algorithms ; deterministic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There are many global optimization algorithms which do not use global information. We broaden previous results, showing limitations on such algorithms, even if allowed to run forever. We show that deterministic algorithms must sample a dense set to find the global optimum value and can never be guaranteed to converge only to global optimizers. Further, analogous results show that introducing a stochastic element does not overcome these limitations. An example is simulated annealing in practice. Our results show that there are functions for which the probability of success is arbitrarily small.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 157-179 
    ISSN: 1573-2916
    Keywords: Global optimization ; Interval methods ; Local nonsmooth optimization ; Scientific computing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An interval method for determining local solutions of nonsmooth unconstrained optimization problems is discussed. The objective function is assumed to be locally Lipschitz and to have appropriate interval inclusions. The method consists of two parts, a local search and a global continuation and termination. The local search consists of a globally convergent descent algorithm showing similarities to ε-bundle methods. While ε-bundle methods use polytopes as inner approximations of the ε-subdifferentials, which are the main tools of almost all bundle concepts, our method uses axes parallel boxes as outer approximations of the ε-subdifferentials. The boxes are determined almost automatically with inclusion techniques of interval arithmetic. The dimension of the boxes is equal to the dimension of the problem and remains constant during the whole computation. The application of boxes does not suffer from the necessity to invest methodical and computational efforts to adapt the polytopes to the latest state of the computation as well as to simplify them when the number of vertices becomes too large, as is the case with the polytopes. The second part of the method applies interval techniques of global optimization to the approximative local solution obtained from the search of the first part in order to determine guaranteed error bounds or to improve the solution if necessary. We present prototype algorithms for both parts of the method as well as a complete convergence theory for them and demonstrate how outer approximations can be obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 205-216 
    ISSN: 1573-2916
    Keywords: Global optimization ; Lipschitz continuity ; Piyavskii's algorithm ; Uniform Continuity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We use the simple, but little-known, result that a uniformly continuous function on a convex set is ε-Lipschitz (as defined below) to extend Piyavskii's algorithm for Lipschitz global optimization to the larger domain of continuous (not-necessarily-Lipschitz) global optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 365-393 
    ISSN: 1573-2916
    Keywords: Branch-and-bound ; Global optimization ; Interval arithmetic ; Interval slopes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we introduce a pruning technique based on slopes in the context of interval branch-and-bound methods for nonsmooth global optimization. We develop the theory for a slope pruning step which can be utilized as an accelerating device similar to the monotonicity test frequently used in interval methods for smooth problems. This pruning step offers the possibility to cut away a large part of the box currently investigated by the optimization algorithm. We underline the new technique's efficiency by comparing two variants of a global optimization model algorithm: one equipped with the monotonicity test and one equipped with the pruning step. For this reason, we compared the required CPU time, the number of function and derivative or slope evaluations, and the necessary storage space when solving several smooth global optimization problems with the two variants. The paper concludes on the test results for several nonsmooth examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 357-364 
    ISSN: 1573-2916
    Keywords: Global optimization ; Nonconvex quadratic programming ; Semidefinite programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper describes a method for computing a lower bound of the global minimum of an indefinite quadratic form over a simplex. The bound is derived by computing an underestimator of the convex envelope by solving a semidefinite program (SDP). This results in a convex quadratic program (QP). It is shown that the optimal value of the QP is a lower bound of the optimal value of the original problem. Since there exist fast (polynomial time) algorithms for solving SDP's and QP's the bound can be computed in reasonable time. Numerical experiments indicate that the relative error of the bound is about 10 percent for problems up to 20 variables, which is much better than a known SDP bound.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 437-447 
    ISSN: 1573-2916
    Keywords: Global optimization ; Problem features ; Problem classes ; Test problems ; Solution techniques
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There is a lack of a representative set of test problems for comparing global optimization methods. To remedy this a classification of essentially unconstrained global optimization problems into unimodal, easy, moderately difficult, and difficult problems is proposed. The problem features giving this classification are the chance to miss the region of attraction of the global minimum, embeddedness of the global minimum, and the number of minimizers. The classification of some often used test problems are given and it is recognized that most of them are easy and some even unimodal. Global optimization solution techniques treated are global, local, and adaptive search and their use for tackling different classes of problems is discussed. The problem of fair comparison of methods is then adressed. Further possible components of a general global optimization tool based on the problem classes and solution techniques is presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 6 (1995), S. 269-292 
    ISSN: 1573-2916
    Keywords: Global optimization ; inventory problems ; discrete Hamilton-Jacobi-Bellman equations ; quasi-variational inequalities ; subsolutions and supersolutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the numerical resolution of hierarchical inventory problems under global optimization. First we describe the model as well as the dynamical stochastic system and the impulse controls involved. Next we characterize the optimal cost function and we formulate the Hamilton-Jacobi-Bellman equations. We present a numerical scheme and a fast algorithm of resolution, with a result on the speed of convergence. Finally, we apply the discretization method to some examples where we show the usefulness of the proposed numerical method as well as the advantages of operating under global optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 7 (1995), S. 297-331 
    ISSN: 1573-2916
    Keywords: 49D37 ; 65G10 ; Global optimization ; interval arithmetic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we give a new branch and bound algorithm for the global optimization problem with bound constraints. The algorithm is based on the use of inclusion functions. The bounds calculated for the global minimum value are proved to be correct, all rounding errors are rigorously estimated. Our scheme attempts to exclude most “uninteresting” parts of the search domain and concentrates on its “promising” subsets. This is done as fast as possible (by involving local descent methods), and uses little information as possible (no derivatives are required). Numerical results for many well-known problems as well as some comparisons with other methods are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 6 (1995), S. 293-311 
    ISSN: 1573-2916
    Keywords: Global optimization ; univariate optimization ; polynomials ; rational functions ; Storm's chain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Sturm's chain technique for evaluation of a number of real roots of polynomials is applied to construct a simple algorithm for global optimization of polynomials or generally for rational functions of finite global minimal value. The method can be applied both to find the global minimum in an interval or without any constraints. It is shown how to use the method to minimize globally a truncated Fourier series. The results of numerical tests are presented and discussed. The cost of the method scales as the square of the degree of the polynomial.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 7 (1995), S. 183-207 
    ISSN: 1573-2916
    Keywords: Global optimization ; interval arithmetic ; branch-and-bound ; interval subdivision
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper investigates the influence of the interval subdivision selection rule on the convergence of interval branch-and-bound algorithms for global optimization. For the class of rules that allows convergence, we study the effects of the rules on a model algorithm with special list ordering. Four different rules are investigated in theory and in practice. A wide spectrum of test problems is used for numerical tests indicating that there are substantial differences between the rules with respect to the required CPU time, the number of function and derivative evaluations, and the necessary storage space. Two rules can provide considerable improvements in efficiency for our model algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 8 (1996), S. 323-348 
    ISSN: 1573-2916
    Keywords: Global optimization ; Hölder functions ; Lipschitz optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We propose a branch-and-bound framework for the global optimization of unconstrained Hölder functions. The general framework is used to derive two algorithms. The first one is a generalization of Piyavskii's algorithm for univariate Lipschitz functions. The second algorithm, using a piecewise constant upper-bounding function, is designed for multivariate Hölder functions. A proof of convergence is provided for both algorithms. Computational experience is reported on several test functions from the literature.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 8 (1996), S. 379-391 
    ISSN: 1573-2916
    Keywords: Global optimization ; optimality condition ; convex function ; numerical algorithm ; simple set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of maximizing a convex function on a so-called simple set is considered. Based on the optimality conditions [19], an algorithm for solving the problem is proposed. This numerical algorithm is shown to be convergent. The proposed algorithm has been implemented and tested on a variety of test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 8 (1996), S. 107-138 
    ISSN: 1573-2916
    Keywords: Global optimization ; range reduction ; branch-and-bound ; polynomial programming ; multiplicative programming ; mixed-integer nonlinear programming ; quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents valid inequalities and range contraction techniques that can be used to reduce the size of the search space of global optimization problems. To demonstrate the algorithmic usefulness of these techniques, we incorporate them within the branch-and-bound framework. This results in a branch-and-reduce global optimization algorithm. A detailed discussion of the algorithm components and theoretical properties are provided. Specialized algorithms for polynomial and multiplicative programs are developed. Extensive computational results are presented for engineering design problems, standard global optimization test problems, univariate polynomial programs, linear multiplicative programs, mixed-integer nonlinear programs and concave quadratic programs. For the problems solved, the computer implementation of the proposed algorithm provides very accurate solutions in modest computational time.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 10 (1997), S. 257-281 
    ISSN: 1573-2916
    Keywords: Global optimization ; multiextremal algorithms ; Lipschitzian first derivatives ; convergence ; numerical experiments.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we propose a new multi-dimensional methodto solve unconstrained global optimization problems with Lipschitzianfirst derivatives. The method is based on apartition scheme that subdivides the search domain into a set of hypercubesin the course of optimization. This partitioning is regulated by thedecision rule that provides evaluation of the "importance"of each generated hypercube and selection of some partition element to performthe next iteration. Sufficient conditions of global convergence for the newmethod are investigated. Results of numerical experiments are alsopresented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 102 (1999), S. 479-495 
    ISSN: 1573-2878
    Keywords: Global optimization ; Gaussian processes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The Wiener process is a widely used statistical model for stochastic global optimization. One of the first optimization algorithms based on a statistical model, the so-called P-algorithm, was based on the Wiener process. Despite many advantages, this process does not give a realistic model for many optimization problems, particularly from the point of view of local behavior. In the present paper, a version of the P-algorithm is constructed based on a stochastic process with smooth sampling functions. It is shown that, in such a case, the algorithm has a better convergence rate than in the case of the Wiener process. A similar convergence rate is proved for a combination of the Wiener model-based P-algorithm with quadratic fit-based local search.
    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...