On Infeasibility of Systems of Convex Analytic Inequalities

Journal of Mathematical Analysis and Applications

Volumn 234, Issue 1, 1999, Pages 223-245

  Obuchowska, Wiesława T ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041993935     PISSN: 0022247X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jmaa.1999.6357     Document Type: Article

References (26)

1. Caron R. J., McDonald J. F., Ponic C. M. A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary. J. Optim. Theory Appl. 62:1989;225-237.
2. Caron R. J., Obuchowska W. T. An algorithm to determine boundedness of quadratically constrained convex quadratic programmes. European J. Operational Res. 80:1995;431-438.
3. Caron R. J., Obuchowska W. T. Quadratically constrained convex programmes: faulty feasible regions. European J. Operational Res. 94:1996;134-142.
4. Chakravarti N. Some results concerning post-infeasibility analysis. European J. Operational Res. 73:1994;139-143.
5. Chinneck J. W., Dravnieks E. W. Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3:1991;157-168.
6. Chinneck J. W. Analyzing infeasible nonlinear programs. Comput. Optim. Appl. 4:1995;167-179.
7. Chinneck J. W. Feasibility and viability. Gal T., Greenberg H. J. Advances in Sensitivity Analysis and Parametric Programming. 1997;Kluwer, Dordrecht/New York.
8. Chvatal V. Linear Programming. 1983;Freeman, New York.
9. Den Hertog D., Ross C., Terlaky T. A large-step analytic center method for a class of smooth convex programming problems. SIAM J. Optim. 2:1992;55-70.
10. Fiacco A. V., McCormick G. P. Nonlinear Programming: A Sequential Unconstrained Minimization Technique. 1968;Wiley, New York.
11. R. Freund, J. Vera, Some characterizations and properties of the distance to ill-posedness and the condition measure of a conic linear system, MIT Sloan School of Management, 1995.
12. Goldfarb D., Liu S., Wang S. A logarithmic barrier function algorithm for quadratically constrained convex quadratic programming. SIAM J. Optim. 1:1991;252-267.
13. H. J. Greenberg, Redundancy, implicit equalities and infeasible sets, Ann. Math. Artificial Intelligence.
14. Hiriart-Urutty J.-B., Lemarechal C. Convex Analysis and Minimization Algorithms, I. 1993;Springer-Verlag, Berlin/New York.
15. Lamoureux M., Wolkowicz H. Numerical decomposition of a convex function. J. Optim. Theory Appl. 47:1985;51-64.
16. Mangasarian O. L. Nonlinear Programming. 1969;McGraw-Hill, New York.
17. 3.5L. Math. Oper. Res. 15:1990;352-363.
18. Nesterov Y. E., Nemirovsky A. S. Interior-Point Polynomial Algorithms in Convex Programming. 1994;SIAM, Philadelphia.
19. Obuchowska W. T., Caron R. J. Minimal representation of quadratically constrained convex feasible regions. Math. Programming. 68:1995;169-186.
20. W. T. Obuchowska, Minimal representation of convex regions defined by analytic functions.
21. Obuchowska W. T. Infeasibility analysis for systems of quadratic convex inequalities. European J. Operational Res. 107:1998;633-643.
22. Renegar J. Some perturbation theory for linear programming. Math. Programming. 65:1994;73-92.
23. Rockafellar R. T. Convex Analysis. 1979;Princeton Univ. Press, Princeton.
24. Rockafellar R. T. Some convex programs whose duals are linearly constrained. Rosen J. B., Mangasarian O. L., Ritter K. Nonlinear Programming. 1970;Academic Press, New York.
25. Telgen J. Identifying redundant constraints and implicit equalities in systems of linear constraints. Management Sci. 29:1983;1209-1222.
26. Wolkowicz H. Method of reduction in convex programming. J. Optim. Theory Appl. 40:1983;349-378.