Library

X
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
    A new filamentous virus in shallot (1993)
    Oxford, UK : Blackwell Publishing Ltd
    Plant pathology 42 (1993), S. 0 
    Details
    ISSN: 1365-3059
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Serological analysis (ELISA, immunoblotting, and immunoelectron microscopy) of the partially purified virus preparations obtained from shallot plants (selection sample no. 83) inoculated with the Mongolian isolate of onion yellow dwarf potyvirus (OYDV) revealed neither an OYDV coat protein antigen nor virions decorated by the corresponding antiserum. At the same time, these preparations contained many flexuous filamentous virus particles (FFVP) with a modal length of 780 nm. It is suggested that shallot no. 83 is resistant at least to the Mongolian isolate of OYDV, while the discovered FFVPs are the virions of some other viral agent. The nature and origin of a new virus are now under study in this laboratory
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1365-3059.1993.tb01478.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Stochastic quasigradient method for optimizing the parameters of dynamic systems (1990)
    Springer
    Cybernetics and systems analysis 26 (1990), S. 601-608 
    Details
    ISSN: 1573-8337
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Two-stage stochastic optimization of dynamic system parameters is considered. It is shown that the original optimization problem can be approximated with any degree of accuracy by a finite-dimensional minimax stochastic problem. An Arrow—Hurwicz type stochastic quasigradient algorithm is proposed for solving such problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01068202
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Mixed stochastic quasigradient and penalty function method for solving minimax problems with coupled variables (1991)
    Springer
    Cybernetics and systems analysis 27 (1991), S. 883-888 
    Details
    ISSN: 1573-8337
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The minimization of the maximum function of a set-valued map is considered. The problem has a number of applications in game theory, in dynamic system design models, etc.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01246520
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Circular dichroism of DNA-proflavine, DNA-ethidium and DNA-distamycine flow-oriented complexes (1976)
    Springer
    Molecular biology reports 3 (1976), S. 131-138 
    Details
    ISSN: 1573-4978
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract The circular dichroism (CD) spectra of flow-oriented complexes of DNA with proflavine (PF), ethidium (ET) and distamycine (DS) have been studied in the ultraviolet region. The CD spectra with light propagating in parallel to the flow direction were measured by the method of Chung and Holzwarth [1]. Δ∈∥ and Δ∈⊥ values have been obtained by this method. It was shown that all the complexes studied exhibit a strong CD anisotropy so that ‘isotropic’ CD spectra measured with a conventional procedure can be attributed to the mutual compensation of the two components of opposite signs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00423226
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories (1991)
    Springer
    Journal of global optimization 1 (1991), S. 375-388 
    Details
    ISSN: 1573-2916
    Keywords: Projected subgradient method ; global optimization ; trajectory algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The global optimization problem is considered under the assumption that the objective function is convex with respect to some variables. A finite subgradient algorithm for the search of an ε-optimal solution is proposed. Results of numerical experiments are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00130832
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Perturbed steepest-descent technique in multiextremal problems (1996)
    Springer
    Journal of optimization theory and applications 91 (1996), S. 185-214 
    Details
    ISSN: 1573-2878
    Keywords: Gradient methods ; Liapunov direct methods ; global optimization ; stability under perturbations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The steepest-descent technique dealing with the perturbed values of the objective function and its gradients and with nonexact line searches is considered. Attention is given to the case where the perturbations do not decrease on the algorithm trajectories; the aim is to investigate how perturbations at every iteration of the algorithm perturb its original attractor set. Based on the Liapunov direct method for attraction analysis of discrete-time processes, a sharp estimation of the attractor set generated by a perturbed steepest-descent technique with respect to the perturbation magnitudes is obtained. Some global optimization properties of finite-difference analogues of the gradient method are discovered. These properties are not inherent in methods which use exact gradients.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02192289
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Error Stability Properties of Generalized Gradient-Type Algorithms (1998)
    Springer
    Journal of optimization theory and applications 98 (1998), S. 663-680 
    Details
    ISSN: 1573-2878
    Keywords: Error stability ; perturbation analysis ; gradient-type methods ; incremental algorithms ; approximate solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a unified framework for convergence analysis of generalized subgradient-type algorithms in the presence of perturbations. A principal novel feature of our analysis is that perturbations need not tend to zero in the limit. It is established that the iterates of the algorithms are attracted, in a certain sense, to an ɛ-stationary set of the problem, where ɛ depends on the magnitude of perturbations. Characterization of the attraction sets is given in the general (nonsmooth and nonconvex) case. The results are further strengthened for convex, weakly sharp, and strongly convex problems. Our analysis extends and unifies previously known results on convergence and stability properties of gradient and subgradient methods, including their incremental, parallel, and heavy ball modifications.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1022680114518
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    On the global optimization properties of finite-difference local descent algorithms (1993)
    Springer
    Journal of global optimization 3 (1993), S. 67-78 
    Details
    ISSN: 1573-2916
    Keywords: Gradient method ; coordinate descent method ; global optimization ; stability under perturbations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper is devoted to the convergence properties of finite-difference local descent algorithms in global optimization problems with a special γ-convex structure. It is assumed that the objective function can be closely approximated by some smooth convex function. Stability properties of the perturbed gradient descent and coordinate descent methods are investigated. Basing on this results some global optimization properties of finite-difference local descent algorithms, in particular, coordinate descent method, are discovered. These properties are not inherent in methods using exact gradients.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01100240
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints (1990)
    Springer
    Computational mathematics and modeling 1 (1990), S. 383-394 
    Details
    ISSN: 1573-837X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01128287
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Finiteε-subgradient algorithm for approximate solution of the parametric programming problem (1992)
    Springer
    Computational mathematics and modeling 3 (1992), S. 39-43 
    Details
    ISSN: 1573-837X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01127790
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...