Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • two photon spectroscopy  (2)
  • Theorems of the alternative  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 94 (1997), S. 561-590 
    ISSN: 1573-2878
    Keywords: Theorems of the alternative ; duality ; minimum norm duality theorem ; steepest descent directions ; least norm problems ; alignment ; constructive optimality conditions ; degeneracy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper investigates the relations between theorems of the alternative and the minimum norm duality theorem. A typical theorem of the alternative is associated with two systems of linear inequalities and/or equalities, a primal system and a dual one, asserting that either the primal system has a solution, or the dual system has a solution, but never both. On the other hand, the minimum norm duality theorem says that the minimum distance from a given point z to a convex set $$\mathbb{K}$$ is equal to the maximum of the distances from z to the hyperplanes separating z and $$\mathbb{K}$$ . We consider the theorems of Farkas, Gale, Gordan, and Motzkin, as well as new theorems that characterize the optimality conditions of discrete l 1-approximation problems and multifacility location problems. It is shown that, with proper choices of $$\mathbb{K}$$ , each of these theorems can be recast as a pair of dual problems: a primal steepest descent problem that resembles the original primal system, and a dual least–norm problem that resembles the original dual system. The norm that defines the least-norm problem is the dual norm with respect to that which defines the steepest descent problem. Moreover, let y solve the least norm problem and let r denote the corresponding residual vector. If r=0, which means that z ∈ $$\mathbb{K}$$ , then y solves the dual system. Otherwise, when r≠0 and z ∉ $$\mathbb{K}$$ , any dual vector of r solves both the steepest descent problem and the primal system. In other words, let x solve the steepest descent problem; then, r and x are aligned. These results hold for any norm on $$\mathbb{R}^n $$ . If the norm is smooth and strictly convex, then there are explicit rules for retrieving x from r and vice versa.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1572-9540
    Keywords: proton scattering ; electron scattering ; two photon spectroscopy ; charge and matter radii ; nuclear models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract Nuclear matter and charge distributions, and the radii of light exotic nuclei have been calculated with the Dynamic Correlation Model and compared with those extracted from proton and electron scattering experiments.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1572-9540
    Keywords: charge radii ; halo nuclei ; resonance ionization spectroscopy ; two photon spectroscopy ; lithium atoms ; radioactive atom source
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract Isotope shift measurements by means of laser resonance ionization spectroscopy are a unique tool to determine the charge radii of halo nuclei. The most prominent halo nucleus 11Li is at the same time the best accessible candidate for such studies. The experimental method to determine the charge radius of this exotic nucleus and first test results on 7Li will be presented in this paper.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...