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
  • Articles: DFG German National Licenses  (3)
Source
Material
Years
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 51 (1991), S. 273-278 
    ISSN: 1436-4646
    Keywords: Convexity ; injectivity ; generalized gradient ; supporting hyperplane ; affine invariance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is shown that Lipschitzian functions are strictly convex if and only if their generalized gradients are disjoint at distinct interior points of a given bounded level set.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 27 (1990), S. 253-283 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this tutorial survey we study finite dimensional optimization problems which depend on parameters. It is our aim to work out several basic connections with different mathematical areas. In particular, attention will be paid to unfolding and singularity theory, structural analysis of families of constraint sets, constrained optimization problems and semi-infinite optimization.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 17 (2000), S. 161-165 
    ISSN: 1573-2916
    Keywords: Global optimization ; Gradient flow ; Min-max graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let f be a smooth nondegenerate real valued function on a finite dimensional, compact and connected Riemannian manifold. The bipartite min-max graph Γ is defined as follows. Its nodes are formed by the set of local minima and the set of local maxima. Two nodes (a local minimum and a local maximum) are connected in Γ by means of an edge if some trajectory of the corresponding gradient flow connects them. Given a natural number k, we construct a function f such that the length of the shortest path in Γ between two specific local minima exceeds k. The latter construction is independent of the underlying Riemannian metric.
    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...