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 53 (1992), S. 323-338 
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; global optimization ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 43 (1989), S. 317-328 
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; convex programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 3 (1993), S. 171-192 
    ISSN: 1573-2916
    Keywords: Random search ; Monte Carlo optimization ; algorithm complexity ; global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n5/2) wheren is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2011-08-19
    Description: NASA IRTF reflectance spectra of unprecedented precision, obtained for the leading and trailing sides of Europa, are presently noted to no longer show the apparent absorptions seen in 1980 and 1985. It is presently suggested that if the weak absorptions seen in the 1980 and 1985 data are real, they may indicate the transient spectroscopic presence of a molecular component on Europa's trailing side that differs from the water ice known to be the dominant constituent of the surface.
    Keywords: LUNAR AND PLANETARY EXPLORATION
    Type: Icarus (ISSN 0019-1035); 74; 262-271
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2019-07-12
    Description: The new IR spectra presented for Triton exhibit the 2.3-micron methane band as well as Cruikshank et al.'s (1984) 2.15-micron spectral band. It is found on the basis of comparisons with methane ice spectra, and laboratory spectra of methane dissolved in liquid nitrogen, that the former band cannot be exclusively due to methane's presence. Also, the strength of the 2.3-micron band does not allow any obvious correlation with the satellite's orbital position in the new data set.
    Keywords: LUNAR AND PLANETARY EXPLORATION
    Type: Icarus (ISSN 0019-1035); 74; 413-423
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2019-07-12
    Description: Recent calculations of the energy balance of the Io plasma torus show that the observed UV and EUV radiation cannot be maintained solely via energy input by the ion pickup mechanism. Current theoretical models of the torus must be modified to include non-local energy input. It is argued that the required energy may be supplied by inward diffusion of energetic heavy ions with energies less than about 20 keV.
    Keywords: LUNAR AND PLANETARY EXPLORATION
    Type: Geophysical Research Letters (ISSN 0094-8276); 15; 545-548
    Format: text
    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...