Abstract
In this paper we analyze the separability and the strong separability of two given sets in a real normed space by means of a topological hyperplane. The existence of such a separating hyperplane is characterized by the negativity of the optimal value of some related (infinite dimensional) linear optimization problems. In the finite dimensional case, such hyperplane can be effectively calculated by means of well-known linear semi-infinite optimization methods. If the sets to be separated are compact, and they are contained in a separable normed space, a conceptual cutting plane algorithm for their strong separation is proposed. This algorithm solves a semi-infinite programming problem (in the sense that it has finitely many constraints) at each iteration, and its convergence to an optimal solution, providing the desired separating hyperplane, is detailedly studied. Finally, the strong separation of finite sets in the Hadamard space is also approached, and a grid discretization method is proposed in this case.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.F. Bonnans and A. Shapiro. Perturbation Analysis of Optimization Problems, Springer-Verlag, 2000.
N.D. Botkin. Randomized algorithms for the separation of point sets and for solving quadratic programs, Applied Mathematics and Optimization, 32:195–210, 1995.
J.R. Giles. Convex Analysis with Applications in Differentiation of Convex Functions, Pitman, 1982.
M.A. Goberna and M.A. López. Linear Semi-Infinite Optimization, Wiley, 1998.
R.B. Holmes. Geometric Functional Analysis and its Applications, Springer-Verlag, 1975.
G. Köthe. Topological Vector Spaces I, Springer-Verlag, 1969.
J.B. Rosen. Pattern separation by convex programming, Journal of Mathematical Analysis and Applications, 10:123–134, 1965.
Y.J. Zhu. Generalizations of some fundamental theorems on linear inequalities, Acta Mathematica Sinica, 16:25–40, 1966.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Goberna, M.A., López, M.A., Wu, SY. (2001). Separation by Hyperplanes: A Linear Semi-Infinite Programming Approach. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3403-4_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5204-2
Online ISBN: 978-1-4757-3403-4
eBook Packages: Springer Book Archive