The distance between two convex sets

Linear Algebra and Its Applications

Volumn 416, Issue 1, 2006, Pages 184-213

  Dax, Achiya ^a  

^a Hydrological Service of Israel   (Israel)

Author keywords

A new minimum norm duality theorem; Constructive optimality conditions; Inconsistent systems of linear inequalities; Linear least norm problems; Steepest descent directions; The distance between two convex polytopes; The distance between two ellipsoids; The double role of duality in least norm problems; The polar decomposition of the least deviation problem; Theorems of the alternatives

Indexed keywords

LINEAR EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

CONSTRUCTIVE OPTIMALITY CONDITIONS; INCONSISTENT SYSTEMS OF LINEAR INEQUALITIES; LINEAR LEAST NORM PROBLEMS; NEW MINIMUM NORM DUALITY THEOREM; STEEPEST DESCENT DIRECTIONS; THE DISTANCE BETWEEN TWO CONVEX POLYTOPES; THE DISTANCE BETWEEN TWO ELLIPSOIDS; THE DOUBLE ROLE OF DUALITY IN LEAST NORM PROBLEMS; THE POLAR DECOMPOSITION OF THE LEAST DEVIATION PROBLEM; THEOREMS OF THE ALTERNATIVES;

SET THEORY;

EID: 33646697381     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.03.022     Document Type: Article

References (54)

1. Ben-Tal A., and Nemirovski A. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (2001), SIAM, Philadelphia
2. Bennett K.P., and Mangasarian O.L. Robust linear programming discrimination of two linearly inseparable sets. Optimiz. Methods Softw. 1 (1992) 23-34
3. Bloomfield P., and Steiger W.L. Least Absolute Deviations (1983), Birkhauser, Boston
4. Briec W. Minimum distance to the complement of a convex set: a duality result. J. Optimiz. Theory Appl. 93 (1997) 301-319
5. Censor Y., Altschuler M.D., and Powlis W.D. A computational solution of the inverse problem in radiation-therapy treatment planning. Appl. Math. Comput. 25 (1988) 57-87
6. Censor Y., and Elfving T. New methods for linear inequalities. Linear Algebra Appl. 42 (1982) 199-211
7. Censor Y., and Zenios S.A. Parallel Optimization, Theory, Algorithms, and Applications (1997), Oxford University Press
8. Ciarlet P.G. Introduction to Numerical Linear Algebra and Optimization (1989), Cambridge University Press, Cambridge
9. Dax A. Linear programming via least squares. Linear Algebra Appl. 111 (1988) 313-324
10. Dax A. The smallest point of a polytope. J. Optimiz. Theory Appl. 64 (1990) 419-422
11. Dax A. A new theorem of the alternative. Math. Program. 47 (1990) 297-299
12. Dax A. On minimum norm solutions. J. Optimiz. Theory Appl. 76 (1993) 183-193
13. Dax A. The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: a review. Ann. Oper. Res. 46 (1993) 11-60
14. Dax A. Loss and retention of accuracy in affine scaling methods. Optimiz. Methods Softw. 15 (2001) 121-151
15. Dax A. The smallest correction of an inconsistent system of linear inequalities. Optimiz. Eng. 2 (2001) 349-359
16. 1 solution of linear inequalities. Comput. Statist. Data Anal. 50 (2006) 40-60
17. A. Dax, The distance between two convex sets: the shortest distance equals the largest separation, Technical Report, Hydrological Service of Israel, 2004.
18. Dax A., and Sreedharan V.P. On theorems of the alternative and duality. J. Optimiz. Theory Appl. 94 (1997) 561-590
19. Deutsch F. Best Approximation in Inner Product Spaces (2001), Springer
20. Deutsch F.R., and Maserick P.H. Applications of the Hahn-Banach theorem in approximation theory. SIAM Rev. 9 (1967) 516-530
21. Efron B. Computer intensive methods in statistical regression. SIAM Rev. 30 (1988) 421-449
22. Gill P.E., Murray W., and Wright M.H. Numerical Linear Algebra and Optimization (1991), Addison-Wesley
23. Herman G.T. Image Reconstruction from Projections: The Fundamentals of Computerized Tomography (1980), Academic Press, New York
24. Hiriart-Urruty J.-B., and Lemarechal C. Convex Analysis and Minimization Algorithms I (1993), Springer-Verlag, Berlin, Heidelberg
25. Householder A.S. The Theory of Matrices in Numerical Analysis (1964), Blaisdell Publishing Company, New York
26. Kaplan W. Maxima and Minima with Applications (1999), Wiley
27. Lax P.D. Functional Analysis (2002), Wiley
28. Lent A., and Censor Y. Extensions of Hildreth's row-action method for quadratic programming. SIAM J. Control Optimiz. 18 (1980) 444-454
29. Luenberger D.G. Optimization by Vector Space Methods (1969), Wiley, New York
30. Luenberger D.G. Linear and Nonlinear Programming (1984), Addision-Wesley
31. Mangasarian O.L. Linear and nonlinear separation of patterns by linear programming. Oper. Res. 13 (1965) 444-452
32. Mangasarian O.L. Nonlinear Programming (1969), McGraw-Hill, New York
33. Mangasarian O.L. Mathematical programming in machine learning. In: Di Pillo G., and Giannesi F. (Eds). Nonlinear Optimization and Applications (1996), Plenum Press, New York
34. Mangasarian O.L. Arbitrary-norm separating plane. Oper. Res. Lett. 24 (1999) 15-23
35. Mangasarian O.L., Setiono R., and Wolberg W.H. Pattern recognition via linear programming: theory and application to medical diagnosis. In: Coleman T.F., and Li Y. (Eds). Large-scale Numerical Optimization (1990), SIAM, Philadelphia 22-31
36. 1 regression, Technical Report, Chevron Research and Technology Co., 1998.
37. Mitchell B.F., Dem'yanov V.F., and Malozemov V.N. Finding the point of a polyhedron closest to the origin. SIAM J. Control Optimiz. 12 (1974) 19-26
38. Moreau J.J. Decomposition orthogonale d'un espace hilbertien selon deux cones mutuellement polaires. C.R. Acad. Sci. Paris 255 (1962) 238-240
39. Moreau J.J. Convexity and duality. In: Caianiello E.R. (Ed). Fundamental Analysis and Optimization (1966), Academic Press, New York 145-169
40. L. Nirenberg, Functional analysis, Lectures given in 1960-61, notes by Lesley Sibner, New York University, 1961.
41. Osborne M.R. Finite Algorithms in Optimization and Data Analysis (1985), Wiley
42. m. J. Approx. Theory 73 (1993) 180-193
43. Panik M.J. Fundamentals of Convex Analysis (1993), Kluwer
44. Roberts A.W., and Varberg D.E. Convex Functions (1973), Academic Press, New York
45. Rockafellar R.T. Convex Analysis (1970), Princeton University Press
46. Singer I. Duality for Nonconvex Approximation and Optimization (2006), Springer-Verlag
47. Sreedharan V.P. Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm. Numer. Math. 17 (1971) 387-401
48. Sreedharan V.P. Least squares algorithms for finding solutions of overdetermined systems of linear equations which mininmize error in a smooth strictly convex norm. J. Approx. Theory 8 (1973) 46-61
49. Stoer J., and Witzgall C. Convexity and Optimization in Finite Dimensions, Part I (1970), Springer, Berlin
50. Tuenter H.G. L1-distance projection onto convex sets: a simple characterization. J. Optimiz. Theory Appl. 112 (2002) 441-445
51. Watson G.A. Choice of norms for data fitting and function approximation. Acta Numer. 7 (1998) 337-377
52. Wolfe P. Algorithm for a least-distance programming problem. Math. Programm. Study 1 (1974) 190-205
53. Wolfe P. Finding the nearest point in a polytope. Math. Programm. 11 (1976) 128-149
54. Yang W.H. On generalized Hölder inequality. Nonlinear Anal. Theory Methods Appl. 16 (1991) 489-498