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
    σ ± lifetimes and longitudinal acceleration (1980)
    [s.l.] : Nature Publishing Group
    Nature 286 (1980), S. 244-245 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] The momentum range of the £* in the HYBUC sample (200-650 MeV/c) is particularly suited to the study of the effects of acceleration on lifetime, because the proper time for decay in the sigma rest frame is a significant fraction of the stopping time as measured in the laboratory. The mean ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/286244a0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A polynomial method of approximate centers for linear programming (1992)
    Springer
    Mathematical programming 54 (1992), S. 295-305 
    Details
    ISSN: 1436-4646
    Keywords: Interior-point method ; linear programming ; Karmarkar's method ; polynomial-time algorithm ; logarithmic barrier function ; path-following method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01586056
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Charged-particle multiplicity distribution in 100-GeV/c $$\bar pd$$ and π− interactions (1980)
    Springer
    The European physical journal 5 (1980), S. 265-274 
    Details
    ISSN: 1434-6052
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract We present data on $$\bar pn$$ and π− n collisions obtained from an exposure of the 30′' FNAL deuterium filled bubble chamber to a mixed $${{\bar p} \mathord{\left/ {\vphantom {{\bar p} {\pi ^ - }}} \right. \kern-\nulldelimiterspace} {\pi ^ - }}$$ beam with a momentum of 100 GeV/c. We find that in 17±2% of the collisions with the antiproton there is an interaction on the spectator while for the collisions with π− mesons the corresponding number is 15±2%. The $$\bar pn$$ and π− n multiplicity distributions have average charged multiplicities of 6.46±0.07 and 6.53±0.08 respectively. The average multiplicities for both types of interactions are slightly smaller than those for the corresponding reactions on hydrogen by an amount that is the same as observed at other energies. As an estimate of $$\bar pn$$ annihilation we have calculated the difference $$\sigma _n (\bar pn) - \sigma _n (pn)$$ for each prong numbern. We find an average multiplicity of 9±1, a value close to that for $$\bar pp$$ annihilation at the same energy. combining our data with lower energy $$\bar pn$$ annihilation data, we observe that the average negative multiplicity is systematically larger than that for $$\bar pp$$ annihilation similar to the difference between neutron and proton target data with other beam projectiles.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01557812
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Degeneracy in interior point methods for linear programming: a survey (1993)
    Springer
    Annals of operations research 46-47 (1993), S. 107-138 
    Details
    ISSN: 1572-9338
    Keywords: Linear programming ; interior point methods ; degeneracy ; polynomial algorithms ; global and local convergence ; basis recovery ; numerical performance ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The publication of Karmarkar's paper has resulted in intense research activity into Interior Point Methods (IPMs) for linear programming. Degeneracy is present in most real-life problems and has always been an important issue in linear programming, especially in the Simplex method. Degeneracy is also an important issue in IPMs. However, the difficulties are different in the two methods. In this paper, we survey the various theoretical and practical issues related to degeneracy in IPMs for linear programming. We survey results, which, for the most part, have already appeared in the literature. Roughly speaking, we shall deal with the effect of degeneracy on the following: the convergence of IPMs, the trajectories followed by the algorithms, numerical performance, and finding basic solutions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02096259
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (1990)
    Springer
    Mathematical programming 46 (1990), S. 79-84 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming ; pivoting rule ; Gray code
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585729
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A survey of search directions in interior point methods for linear programming (1991)
    Springer
    Mathematical programming 52 (1991), S. 481-509 
    Details
    ISSN: 1436-4646
    Keywords: Interior point methods ; linear programming ; potential function ; search direction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A basic characteristic of an interior point algorithm for linear programming is the search direction. Many papers on interior point algorithms only give an implicit description of the search direction. In this report we derive explicit expressions for the search directions used in many well-known algorithms. Comparing these explicit expressions gives a good insight into the similarities and differences between the various algorithms. Moreover, we give a survey of projected gradient and Newton directions for all potential and barrier functions. This is done both for the affine and projective variants.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582902
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A Long-step barrier method for convex quadratic programming (1993)
    Springer
    Algorithmica 10 (1993), S. 365-382 
    Details
    ISSN: 1432-0541
    Keywords: Convex quadratic programming ; Interior-point method ; Logarithmic barrier function ; Polynomial algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we propose a long-step logarithmic barrier function method for convex quadratic programming with linear equality constraints. After a reduction of the barrier parameter, a series of long steps along projected Newton directions are taken until the iterate is in the vicinity of the center associated with the current value of the barrier parameter. We prove that the total number of iterations isO(√nL) orO(nL), depending on how the barrier parameter is updated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01769704
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Intravenous calcium chloride as an antidote to verapamil-induced hypotension (1982)
    Springer
    Intensive care medicine 8 (1982), S. 55-57 
    Details
    ISSN: 1432-1238
    Keywords: Verapamil ; Profound hypotension ; Calcium chloride
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Profound hypotension following the use of intravenous verapamil has been infrequently recorded. This report describes such a case and the correction of the hypotension with intravenous calcium chloride.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01686855
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Determination of C1−C4 fatty acids as p-bromophenacyl esters using glass-capillary gas chromatography and electron-capture detection (1983)
    Springer
    Chromatographia 17 (1983), S. 185-190 
    Details
    ISSN: 1612-1112
    Keywords: Glass-capillary GC ; Electron-capture detection ; C1−C4 carboxylic acids ; p-Bromophenacyl esters ; Reagent degradation products
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary A method for the determination of low relative molecular mass carboxylic acids (C1−C4) in water is reported. The acids are converted to p-bromophenacyl esters prior to a glass-capillary gas chromatographic separation. By utilizing electron-caputre detection the detectability is substantially improved compared to flame-ionization detection. A comparison of three different ways to treat the water samples and to produce the derivatives is made. It is shown that the α, p-dibromoacetophenone reagent decomposes to a small extent which limits the utility of the reagent. Nevertheless a detection limit for formic acid of approximately 2.5 mgl−1 is obtained. The method is applied to the determination of formic and acetic acids in a paper kraft water sample.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02290554
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On the classical logarithmic barrier function method for a class of smooth convex programming problems (1992)
    Springer
    Journal of optimization theory and applications 73 (1992), S. 1-25 
    Details
    ISSN: 1573-2878
    Keywords: Convex programming ; interior point method ; logarithmic barrier function ; Newton method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we describe a natural implementation of the classical logarithmic barrier function method for smooth convex programming. It is assumed that the objective and constraint functions fulfill the so-called relative Lipschitz condition, with Lipschitz constantM〉0. In our method, we do line searches along the Newton direction with respect to the strictly convex logarithmic barrier function if we are far away from the central trajectory. If we are sufficiently close to this path, with respect to a certain metric, we reduce the barrier parameter. We prove that the number of iterations required by the algorithm to converge to an ε-optimal solution isO((1+M 2) $$\sqrt n $$ ∣logε∣) orO((1+M 2)n∣logε∣), depending on the updating scheme for the lower bound.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00940075
    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...