Skip to main content
SpringerLink
Log in

Algorithms of Quasidifferentiable Optimization for the Separation of Point Sets

  • Chapter
  • First Online:
Optimization and Optimal Control

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 39))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bagirov, A.M.: Numerical methods for minimizing quasidifferentiable functions: A survey and comparison. In: V.F. Demyanov, A. Rubinov, (Eds.): Quasidifferentiability and Related Topics (pp. 33–71), Kluwer, Dordrecht (2000)

    Chapter  Google Scholar 

  2. Demyanov, V.F.: On the identification of points of two convexsets. Vestn. St. Petersburg Univ., Math. 34(3), 14–20 (2001)

    MathSciNet  Google Scholar 

  3. Demyanov, V.F., Astorino, A., Gaudioso, M.: Nonsmooth problems in mathematical diagnostics. In: N. Hadjisavvas, P.M. Pardalos (Eds.), Advances in Convex Analysis and Global Optimization (Pythagorion, 2000), Nonconvex Optimization and Applications (Vol. 54, pp. 11–30), Kluwer, Dordrecht, (2001)

    Google Scholar 

  4. Demyanov, V.F., Rubinov, A.M.: Quasidifferentiable functionals. Dokl. Akad. Nauk SSSR 250(1), 21–25 (1980)

    MathSciNet  Google Scholar 

  5. Demyanov, V.F., Rubinov, A.M.: Quasidifferential Calculus, Optimization Software, New York, NY (1986)

    Book  MATH  Google Scholar 

  6. Demyanov, V.F., Rubinov, A.M.: Quasidifferentiability and Related Topics. Kluwer, Dordrecht (2000)

    Book  Google Scholar 

  7. Herklotz, A., Luderer, B.: Identification of point sets by quasidifferentiable functions. Optimization 54, 411–420 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kiwiel, K.C.: A linearization method for minimizing certain quasidifferentiable functions. Math. Program. Study 29, 86–94 (1986)

    MathSciNet  Google Scholar 

  9. Luderer, B., Weigelt, J.: A solution method for a special class of nondifferentiable unconstrained optimization problems. Comput. Optim. Appl. 24, 83–93 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rosen, J.B.: The gradient projection method for nonlinear programming. Part II: nonlinear constraints. J. Ind. Appl. Math. 8, 514–532 (1961)

    Article  Google Scholar 

  11. Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11 (2), 128–149 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Chemnitz University of Technology, Reichenhainer Str., 41 09126, Chemnitz, Germany

    Bernd Luderer

  2. Capgemini, Lyon, France

    Denny Wagner

Authors
  1. Bernd Luderer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denny Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernd Luderer .

Editor information

Editors and Affiliations

  1. South Kensington Campus, London, SW7 2AZ, United Kingdom

    Altannar Chinchuluun

  2. Dept. Industrial & Systems, Engineering, University of Florida, Weil Hall 303, Gainesville, 32611-6595, Florida, USA

    Panos M. Pardalos

  3. The School of Economic Studies, Dept.of Mathematics & Computer Science, National University of Mongolia, Ulaanbaatar, 210646, Mongolia

    Rentsen Enkhbat

  4. Labo. PRISM, Université Versailles, av. des Etats-Unis 45, Versailles CX, 78035, France

    Ider Tseveendorj

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Luderer, B., Wagner, D. (2010). Algorithms of Quasidifferentiable Optimization for the Separation of Point Sets. In: Chinchuluun, ., Pardalos, P., Enkhbat, R., Tseveendorj, I. (eds) Optimization and Optimal Control. Springer Optimization and Its Applications(), vol 39. Springer, New York, NY. https://doi.org/10.1007/978-0-387-89496-6_8

Download citation

Publish with us

Policies and ethics

Search

Navigation