Quadratically constrained convex quadratic programmes: Faulty feasible regions

European Journal of Operational Research

Volumn 94, Issue 1, 1996, Pages 134-142

  Caron, Richard J ^a   Obuchowska, Wiesława T ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Optimization; Quadratic programming

Indexed keywords

CONSTRAINT THEORY; FUNCTIONS; LINEAR PROGRAMMING; MATRIX ALGEBRA;

CONVEX QUADRATIC FUNCTION; ITERATION; QUADRATIC PROGRAMMING;

OPTIMIZATION;

EID: 0030269814     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00122-0     Document Type: Article

References (20)

1. R.J. Caron, J.F. McDonald, and C.M. Ponic, "A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary", Journal of Optimization Theory and Applications 62 (1989) 225-237.
2. R.J. Caron and W.T. Obuchowska, "Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints", European Journal of Operations Research 63 (1992) 114-123.
3. R.J. Caron and W.T. Obuchowska, "Minimal representation of quadratically constrained convex feasible regions", Mathematical Programming 68 (1995) 169-186.
4. R.J. Caron and W.T. Obuchowska, "An algorithm to determine boundedness of quadratically constrained convex quadratic programmes", European Journal of Operational Research 80 (1995) 431-438.
5. D. den Hertog, C. Roos, and T. Terlaky, "A large-step analytic center method for a class of smooth convex programming problems", SIAM Journal on Optimization 2 (1992) 55-70.
6. A.V. Fiacco and G.P. McCormick, Non-linear Programming: A Sequential Unconstrained Minimization Technique, Wiley, New York, 1968.
7. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright, "On projected Newton Barrier methods for linear programming and on equivalence to Karmarkar's projective method", Mathematical Programming 36 (1986) 183-209.
8. D. Goldfarb, S. Liu, and S. Wang, "A logarithmic barrier function algorithm for quadratically constrained convex quadratic programming", SIAM Journal on Optimization 1 (1991) 252-267.
9. P. Huard, "Resolution of mathematical programming with non-linear constraints by the method of centres", in: J. Abadie (ed.), Non-linear Programming, North-Holland, Amsterdam, 1967, 207-219.
10. F. Jarre, "On the convergence of the method of analytic centers when applied to convex quadratic programs". Mathematical Programming 49 (1991) 341-358.
11. N. Karmarkar, "A new polynomial time algorithm for linear programming", Combinatorica 4 (1984) 373-395.
12. F.A. Lootsma, "Constrained optimization via parameter-free penalty functions", Phillips Research Report 23 (1968) 424-437.
13. I.J. Lustig, "Feasibility issues in primal-dual interior point method for linear programming", Mathematical Programming 49 (1990) 145-162.
14. S. Mehrotra and Y. Sun, "A method of analytic centres of quadratically constrained convex quadratic programs", SIAM Journal on Numerical Analysis 28 (1991) 529-544.
15. R.D.C. Monteiro and F. Zhou, "On the existence and convergence of the central path for convex programming and some duality results", Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, (Atlanta, GA, 1994).
16. E. Phan-huy-Hao, "Quadratically constrained quadratic programming: Some applications and a method for solution", Zeitschrift für Operations Research 8 (1982) 105-119.
17. G. Sonnevend, "An 'analytic center' for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming", in: A. Prekopa, J. Szelezsan, and B. Strazicky (eds.), System Modelling and Optimization: Proceedings of the 12th IFIP Conference, (Lecture Notes in Control and Information Sciences 84), Springer-Verlag, Berlin, 1986, 866-876.
18. J. Telgen, "Identifying redundant constraints and implicit equalities in systems of linear constraints", Management Science 29 (1983) 1209-1222.
19. J.-Ph. Vial, "Computational experience with a primal-dual interior-point method for smooth convex programming", Optimization Methods and Software 3 (1994) 285-310.
20. C.R. Vogel, "A constrained least squares method for nonlinear ill-posed problems", SIAM Journal on Control and Optimization 28 (1990) 34-49.