Skip to main content

Solving minmax location problems via epigraphical projection

  • Chapter
  • First Online:
Multi-Composed Programming with Applications to Facility Location

Abstract

For solving minmax location problems in Hilbert spaces Hi, i = 1, …, n, numerically by proximal methods we present in this chapter first a general formula of the projection onto the epigraph of the function h : H1 × … × Hn → ℝ, defined by \( h\left( {x_{1} , \ldots ,x_{n} } \right)\text{: = }\sum\limits_{i = 1}^{n} {\left. {w_{i} } \right\|} \left. {x_{i} } \right\|_{{H_{i} }}^{{\beta_{i} }} \). We consider the situations when βi = 1, i = 1, …, n, and wi = 1, βi = 2, i = 1, …, n, where the formulae given for instance in [3, 33, 34] turn out to be special cases for n = 1 of our considerations.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oleg Wilfer .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wilfer, O. (2020). Solving minmax location problems via epigraphical projection. In: Multi-Composed Programming with Applications to Facility Location. Mathematische Optimierung und Wirtschaftsmathematik | Mathematical Optimization and Economathematics. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-30580-2_5

Download citation

Publish with us

Policies and ethics