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
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Normal conical algorithm for concave minimization over polytopes (1991)
    Springer
    Mathematical programming 51 (1991), S. 229-245 
    Details
    ISSN: 1436-4646
    Keywords: Concave minimization ; conical algorithm ; convergence condition ; bisection ; normal subdivision process
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01586935
    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...