ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 13 (1977), S. 140-155 
    ISSN: 1436-4646
    Keywords: Minimax optimization ; Nonlinear programming ; Computer-aided network design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A constrained minimax problem is converted to minimization of a sequence of unconstrained and continuously differentiable functions in a manner similar to Morrison's method for constrained optimization. One can thus apply any efficient gradient minimization technique to do the unconstrained minimization at each step of the sequence. Based on this approach, two algorithms are proposed, where the first one is simpler to program, and the second one is faster in general. To show the efficiency of the algorithms even for unconstrained problems, examples are taken to compare the two algorithms with recent methods in the literature. It is found that the second algorithm converges faster with respect to the other methods. Several constrained examples are also tried and the results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Circuits, systems and signal processing 17 (1998), S. 243-270 
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper, we study the problem of maximizing an objective function over the discrete set {−1, 1} n using a neural network. It is now known that a binary (two-state) Hopfield network can take, in the worst case, an exponential number of time steps to find even a local maximum of the objective function. In this paper, we carry this argument further by studying theradius of attraction of the global maxima of the objective function. If a binary neural network is used, in general there is no guarantee that a global maximum has a nonzero radius of attraction. In other words, even if the optimization process is started off with the neural network in an initial state that isadjacent to the global maximum, the resulting trajectory of the network may not converge to the nearby maximum, but may instead go off to another maximum. At the same time, another set of recent results shows that, if ananalog neural network is used to optimize the same objective function, thenevery local maximum of the objective function has a nontrivial domain of attraction, and conversely, the only equilibria that are attractive are the local maxima of the objective function. This raises the question as to whether analog neural networks offer some advantages over binary neural networks for optimizing the same objective function. As a motivation for this line of inquiry, we study the problem of decoding an algebraic block code using a neural network. It is shown that the binary neural network implementation has the undesirable property thatall the global maxima of the objective function have azero radius of attraction. In contrast, if an analog neural network is used to maximize exactly the same objective function, the region of attraction of each maximum contains not only the associated “orthant” of the state space, but also some points not in this orthant. In other words, the analog implementation exhibits the desired tolerance to transmission errors, whereas the binary neural network does not have this property. With this motivation, two open questions are posed that provide a program of research for studying the possible superiority of analog neural networks over binary neural networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 7 (1971), S. 287-300 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Four distinct, though closely related, inverse optimal control problems are considered. Given a closed, convex setU in a real Hilbert spaceX and an elementu 0 inU, it is desired to find all functionals of the form (u,Ru) such that (i)R is a self-adjoint positive operator and (u,Ru) is minimized over the setU at the pointu 0, (ii)R is self-adjoint, positive definite and (u,Ru) is minimized overU atu 0, (iv)R is self-adjoint, positive definite and (u,Ru) is uniquely minimized overU atu 0. The interrelationships among the sets of solutions of these problems are pointed out. Necessary and sufficient conditions which explicitly characterize the solutions to each of these problems are derived. The question of existence of a solution (namely, Given a particular setU and a particular elementu 0, under what conditions does there exist an operatorR having certain required properties?) is discussed. The results derived are illustrated by an example.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 7 (1971), S. 173-177 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A well-known perturbation theorem for linear operators is used to provide a series expansion for the inverse of a positive-definite operator in a Hilbert space. With this expansion, feasible computational procedures are obtained for solving some optimal control problems with quadratic cost functionals. The methods presented here are compared to alternate methods available in the literature.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 273-278 
    ISSN: 1573-2878
    Keywords: Optimal control ; existence theorems ; control theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Using a recent result due to Berkovitz, we prove the existence of an optimal control in a broad class of problems, under relatively mild conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 18 (1976), S. 171-175 
    ISSN: 1573-2878
    Keywords: Game theory ; differential games ; linear systems ; nonzero-sum games ; n-person games
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that there exist equilibrium strategies forn-person, nonero-sum, linear differential games if the cost to each player is convex. The approach used is believed to be novel, and is based on a theorem of Fan.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Circuits, systems and signal processing 11 (1992), S. 387-398 
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper we study the problem of designing a neural network that gives the correct binary representation of a given real number. Previously this problem has been studied by Tank and Hopfield. The network proposed by them exhibits “hysteresis” in the sense that the current vector of the network sometimes converges towards a binary vector that isnot the correct binary representation of the input current. The reason for this is that the network proposed by them has multiple asymptotically stable equilibria. In the present paper, we propose another neural network which has the property that it hasa single, globally attractive equilibrium for almost all values of the input current. Hence, irrespective of the initial conditions of the network, the current vector converges towards the correct binary representation of the input current.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Circuits, systems and signal processing 5 (1986), S. 371-387 
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper we study the genericity of simultaneous stabilizability, simultaneous strong stabilizability, and simultaneous pole assignability, in linear multivariable systems. The main results of the paper had been previously established by Ghosh and Byrnes using state-space methods. In contrast, the proofs in the present paper are based on input-output arguments, and are much simpler to follow, especially in the case of simultaneous and simultaneous strong stabilizability. Moreover, the input-output methods used here suggest computationally reliable algorithms for solving these two types of problems. In addition to the main results, we also prove some lemmas on generic greatest common divisors which are of independent interest.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 6 (1970), S. 171-173 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two types of controllability, namely weak controllability and strong controllability, are defined for general linear systems. Both types of controllability are useful in control theory. If the system is finite-dimensional, the two types of controllability are equivalent to each other and to the standard concept of complete state-controllability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 1975-11-01
    Print ISSN: 0022-3239
    Electronic ISSN: 1573-2878
    Topics: Mathematics
    Published by Springer
    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...