Algorithms of Quasidifferentiable Optimization for the Separation of Point Sets

Bernd Luderer () and Denny Wagner ()
Additional contact information
Bernd Luderer: Chemnitz University of Technology
Denny Wagner: Capgemini

A chapter in Optimization and Optimal Control, 2010, pp 157-167 from Springer

Abstract: Summary An algorithm for finding the intersection of the convex hulls of two sets consisting of finitely many points each is proposed. The problem is modelled by means of a quasidifferentiable (in the sense of Demyanov and Rubinov) optimization problem, which is solved by a descent method for quasidifferentiable functions.

Keywords: quasidifferential calculus; separation of point sets; intersection of sets; hausdorff distance; numerical methods (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-89496-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387894966

DOI: 10.1007/978-0-387-89496-6_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().