ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Journal of global optimization 13 (1998), S. 407-416 
    ISSN: 1573-2916
    Keywords: Cone partitioning ; Convergence ; ω-Subdivision ; (Quasi)concave minimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a new convergence result for the cone partitioning algorithm with a pure ω-subdivision strategy, for the minimization of a quasiconcave function over a polytope. It is shown that the algorithm is finite when ε-optimal solution with ε 〉 0 are looked for, and that any cluster point of the points generated by the algorithm is an optimal solution in the case ε = 0. This result improves on the one given previously by the authors, its proof is simpler and relies more directly on a new class of hyperplanes and its associated simplicial lower bound.
    Type of Medium: Electronic Resource
    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...