On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 237-260

  Amaldi, Edoardo ^a,c   Kann, Viggo ^b  

^a Department of Obstetrics Gynecology   (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c EPFL   (Switzerland)

Author keywords

Approximability bounds; Designing linear classifiers; Linear systems; Nonzero variables; Unsatisfied relations

Indexed keywords

EID: 0004493166     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00115-1     Document Type: Article

References (66)

1. E. Amaldi, On the complexity of training preceptrons, in: T. Kohonen, K. Mäkisara, O. Simula, J. Kangas (Eds.), Artificial Neural Networks, Elsevier, Amsterdam, 1991, pp. 55-60.
2. E. Amaldi, Complexity of problems related to training perceptrons, in: M. Chaleyat-Maurel, M. Cottrell, J.-C. Fort (Eds.), Actes du congrès "Aspects théoriques des réseaux de neurones", Congrès Européen de Mathématiques, Paris, 1992.
3. E. Amaldi, From finding maximum feasible subsystems of linear systems to feedforward neural network design, Ph.D. Thesis, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, 1994.
4. E. Amaldi, V. Kann, On the approximability of removing the smallest number of relations from linear systems to achieve feasibility, Technical Report ORWP-6-94, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, 1994.
5. E. Amaldi, V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci. 147 (1995) 181-210.
6. D. Angluin, C.H. Smith, Inductive inference: Theory and methods, ACM Comput. Surveys 15 (1983) 237-269.
7. S. Arora, L. Babai, J. Stern, Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, in: Proc. 34th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Comput. Soc. Press, Silver Spring, MD, 1993, pp. 724-733.
8. S. Arora, L. Babai, J. Stern, Z, Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. System Sci. (1997) 317-331.
9. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Comput. Soc. Press, Silver Spring, MD, 1992, pp. 14-23.
10. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proc. 25th Ann. ACM Symp. on Theory of Comp., ACM, New York, 1993, pp. 294-304.
11. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCPs and non-approximability-towards tight results, in: Proc. 36th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Comput. Soc. Press, Silver Spring, MD, 1995, pp. 422-431.
12. K.P. Bennett, O.L. Mangasarian, Robust linear programming discrimination of two linearly inseparable sets, Optimization Meth. Software 1 (1992) 23-34.
13. J. Chinneck, An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem, Ann. Math. Artificial Intelligence 17 (1996) 127-144.
14. J. Chinneck, Feasibility and viability, in: T. Gal, H.J. Greenberg (Eds.) Advances in sensitivity analysis and parametric programming, Kluwer Academic Publishers, Dordrecht, 1997.
15. J. Chinneck, E. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA J. Comput. 3 (1991) 157-168.
16. V. Chvatal, Linear programming, Freeman, New York, 1983.
17. P. Crescenzi, V. Kann, A compendium of NP optimization problems, Technical Report SI/RR-95/02, Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza", 1995. The list is updated continuously. The latest version is available by anonymous ftp from nada.kth.se as Theory/Viggo-Kann/compendium.ps.Z.
18. P. Crescenzi, V. Kann, R. Silvestri, L. Trevisan, Structure in approximation classes, in: Proc. 1st Internat. Conf. on Computing and Combinatorics, Lecture Notes in Computer Science, vol. 959, Springer, Berlin, 1995, pp. 539-548.
19. P. Crescenzi, A. Panconesi, Completeness in approximation classes, Inform. and Comput. 93 (2) (1991) 241-262.
20. P. Crescenzi, R. Silvestri, L. Trevisan, To weight or not to weight: Where is the question? in: Proc. 4th Israel Symp. on Theory of Computing and Systems, IEEE Comput. Soc. Press, Silver Spring, MD, 1996, pp. 68-77.
21. R.O. Duda, P.E. Hart, Pattern classification and scene analysis, Wiley, New York, 1973.
22. J. Edmonds, Redundancy and Helly for linear programming, Lecture Notes, 1994.
23. G. Even, J. Naor, B. Schieber, M. Sudan, Approximating minimum feedback sets and multi-cuts in directed graphs, in: Proc. 4th Internat. Conf. on Integer Prog. and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 920, Springer, Berlin, 1995, pp. 14-28.
24. U. Feige, A threshold of In n for approximating set cover, in: Proc. 28th Ann. ACM Symp. on Theory of Comp., ACM, New York, 1996, pp. 314-318.
25. M.R. Frean, A thermal perceptron learning rule, Neural Computation 4 (1992) 946-957.
26. S.I. Gallant, Perceptron-based learning algorithms, IEEE Trans. Neural Networks 1 (1990) 179-191.
27. M.R. Garey, D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, San Francisco, 1979.
28. J. Gleeson, J. Ryan, Identifying minimally infeasible subsystems of inequalities, ORSA J. Computing 3 (1990) 61-63.
29. H.J. Greenberg, Consistency, redundancy, and implied equalities in linear systems, Ann. Math. Artificial Intelligence 17 (1996) 37-83.
30. H.J. Greenberg, F.H. Murphy, Approaches to diagnosing infeasible linear programs, ORSA J. Computing 3 (1991) 253-261.
31. R. Greer, Trees and hills: Methodology for maximizing functions of systems of linear relations, volume 22 of Annals of Discrete Mathematics, Elsevier, Amsterdam, 1984.
32. M. Grigni, V. Mirelli, C.H. Papadimitriou, On the difficulty of designing good classifiers, in: Proc. 2nd Internat. Conf. on Computing and Combinatorics, Lecture Notes in Computer Science, vol. 1090, Springer, Berlin, 1996, pp. 273-279.
33. O. Guieu, J. Chinneck, Analyzing infeasible mixed-integer and integer linear programs, Technical Report Technical Report SCE-96-05, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada, 1996.
34. M.M. Halldóroson, Approximating the minimum maximal independence number, Inform. Process. Lett. 46 (1993) 169-172.
35. M. Hassoun, Fundamentals of artificial neural networks, MIT Press, Cambridge, MA, 1995.
36. 1-ε, in: Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Comput. Soc. Press, Silver Spring, MD, 1996, pp. 627-636.
37. J. Håstad, Some optimal inapproximability results, in: Proc. 29th Ann. ACM Symp. on Theory of Comp, ACM, New York, 1997, pp. 1-10.
38. K-U. Höffgen, H-U. Simon, K. van Horn, Robust trainability of single neurons, J. Comput. System Sci. 50 (1995) 114-125.
39. D.S. Johnson, F.P. Preparata, The densest hemisphere problem, Theoret. Comput. Sci. 6 (1978) 93-107.
40. V. Kann, On the Approximability of NP-complete Optimization Problems, Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.
41. V. Kann, Polynomially bounded minimization problems that are hard to approximate, Nordic J. Computing 1 (1994) 317-331.
42. V. Kann, Strong lower bounds on the approximability of some NPO PB-complete maximization problems, in: Proc. 20th Ann. Mathematical Foundations of Comput. Sci., Lecture Notes in Computer Science, vol. 969. Springer, Berlin, 1995, pp. 227-236.
43. V. Kann, A. Panconesi, Hardness of approximation, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Ch. 2, Wiley, New York, 1997.
44. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
45. M. Kearns, L. Valiant, Cryptographic limitations on learning boolean formulae and finite automata, J. ACM 41 (1994) 67-95.
46. M. Kearns, U. Vazirani, An introduction to Computational Learning Theory. MIT Press, Cambridge, MA, 1994.
47. S. Khanna, M. Sudan, L. Trevisan, Constraint satisfaction: The approximability of minimization problems, in: Proc. 12th Annual IEEE Conf. Comput. Complexity. IEEE Comput. Soc., Press, Silver Spring, MD, 1997, pp. 282-296.
48. G.J. Koehler, Linear discriminant functions determined by genetic search, ORSA J. Computing 3 (1991) 345-357.
49. G.J. Koehler, S.S. Erenguc, Minimizing misclassifications in linear discriminant analysis, Decision Sci. 21 (1990) 63-85.
50. J.-H. Lin, J.S. Vitter, Complexity results on learning by neural nets, Mach. Learning 6 (1991) 211-230.
51. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41 (1994) 960-981.
52. [51A] O.L. Mangasarian, Misclassification minimization, J. Global Optimization 5 (1994) 309-323.
53. M. Marchand, M. Golea, On learning simple neural concepts: from halfspace intersections to neural decision lists, Network: Computation in Neural Systems 4 (1993) 67-85.
54. G.J. McLachlan, Discriminant analysis and statistical pattern recognition, Wiley, New York, 1992.
55. M.L. Minsky, S. Papert, Perceptrons: An introduction to computational Geometry, MIT Press Cambridge, MA, 1988, expanded edition.
56. C.H. Papadimitriou, K. Steiglitz, Combinatorial optimization, Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
57. M. Parker, A set covering approach to infeasibility analysis of linear programming problems and related issues, Ph.D. Thesis, Department of Mathematics, University of Colorado, Denver, 1995.
58. M. Parker, J. Ryan, Finding the minimum weight US cover of an infeasible system of linear inequalities, Ann. Math. Artificial Intelligence 17 (1996) 107-126.
59. R. Rivest, Cryptography, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A: Algorithms and complexity, Elsevier, Amsterdam, 1990, pp. 717-755.
60. J. Sankaran, A note on resolving infeasibility in linear programs by constraint relaxation, Oper. Res. Lett. 13 (1993) 19-20.
61. A. Schrijver, Theory of linear and integer programming, Interscience series in discrete mathematics and optimization, Wiley, New York, 1986.
62. P. Seymour, Packing directed circuits fractionally, Combinatorica 15 (1995) 281-288.
63. L.G. Valiant, A theory of the learnable, Communications of ACM 27 (1984) 1134-1142.
64. K. van Horn, T. Martinez, The minimum feature set problem, Technical Report CS-92-8, Computer Science Department, Brigham Young University, Provo, 1992.
65. K. van Horn, T. Martinez, The minimum feature set problem, IEEE Trans. Neural Networks 7 (1994) 491-494.
66. R.E. Warmack, R.C. Gonzalez, An algorithm for optimal solution of linear inequalities and its application to pattern recognition, IEEE Trans. Comput. 22 (1973) 1065-1075.