Remarks on the analytic centers of convex sets

Computational Optimization and Applications

Volumn 29, Issue 1, 2004, Pages 69-90

  Obuchowska, Wiesława T ^a  

^a Chowan University   (United States)

Author keywords

Analytic centre; Convex programming; Interior point methods; Perturbed convex programs

Indexed keywords

ANALYTIC CENTRES; CONVEX PROGRAMMING; INTERIOR POINT METHODS; PERTURBED CONVEX PROGRAMS;

ALGORITHMS; ECONOMICS; FUNCTIONS; MATHEMATICAL PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING;

SET THEORY;

EID: 4444350509     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000039489.72939.35     Document Type: Article

References (28)

1. B. Bank, J. Guddat, D. Klatte, B. Kummer, and K. Tammer, Non-Linear Parametric Optimization, Birkhauser Verlag: Basel-Boston-Stuttgart, 1983.
2. B. Bank and R. Mandel, Parametric Integer Optimization, vol. 39, Academie-Verlag: Berlin, 1988.
3. E.G. Belousov and D. Klatte, "A Frank-Wolfe type theorem for convex polynomial programs," Computational Optimization and Applications, vol. 22, pp. 37-48, 2002.
4. R.J. Caron, H.J. Greenberg and A.G. Holder, "Analytic centers and repelling inequalities," European Journal of Operational Research, vol. 143, no. 2, pp. 268-290,2002.
5. R.J. Caron and W.T. Obuchowska, "Quadratically constrained convex quadratic programmes: Faulty feasible regions," European Journal of Operational Research, vol. 94, pp. 134-142, 1996.
6. R.J. Caron and W.T. Obuchowska, "An algorithm to determine unboundedness of quadratically constrained convex programmes," European Journal of Operational Research, vol. 80, pp. 431-438, 1995.
7. R.J. Cafpn and W.T. Obuchowska, "Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints," European Journal of Operational Research, vol. 63, pp. 114-123, 1992.
8. A.V. Fiacco, Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press: New York, 1983.
9. A.V. Fiacco and G.P. McCormick, Nonlinear Programming: A Sequential Unconstrained minimization Technique, Wiley: New York, 1968.
10. D. Goldfarb and K. Scheinberg, "On parametric semideflnite programming," Applied Numerical Mathematics: Transactions of IMACS, vol. 29, no. 3, pp. 361-377, 1999.
11. H.H. Halicka, "Analytical properties of the central path at boundary point in linear programming," Mathematical Programming, vol. 84, pp. 335-355, 1999.
12. W. W. Hogan, "Point-to-set maps in mathematical programming," SIAM Review, vol. 15, pp. 591-603, 1973.
13. P. Huard, "Resolution of mathematical programming with nonlinear constraints by the methods of centers," in Nonlinear Programming, J. Abadie (ed.), North Holland, Amsterdam, pp. 207-219, 1967.
14. L. McLinden, "An analogue of moreau's proximation theorem, with applications to the nonlinear complementarity problem," Pacific Journal of Mathematics, vol. 88, no. 1, pp. 101-161, 1980.
15. Y.E. Nesterov and A.S. Nemirovsky, Interior-Point Polynomial Algorithms in Convex Programming, SIAM: Philadelphia, 1994.
16. W.T. Obuchowska and R.J. Caron, "Minimal representation of quadratically constrained convex feasible regions," Mathematical Programming, vol. 68, pp. 169-186, 1995.
17. W.T. Obuchowska and R.J. Caron, "Improving the rate of convergence of interior point methods for a class of smooth convex programming problems," Optimization, vol. 35, pp. 317-332, 1995.
18. W.T. Obuchowska, "Minimal representation of convex regions defined by analytic functions," Journal of Mathematical Analysis and Applications, vol. 246, pp. 100-121, 2000.
19. W.T. Obuchowska, "On infeasibilty of systems of convex analytic inequalities," Journal of Mathematical Analysis and Applications, vol. 234, pp. 223-245, 1999.
20. W.T. Obuchowska, "Quadratically constrained convex quadratic programmes," Ph.D. Thesis, University of Windsor, 1995.
21. R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1979.
22. R.T. Rockafellar, "Some convex programs whose duals are linearly constrained," in Nonlinear Programming J.B. Rosen, O.L. Mangasarian, and K. Ritter (eds.), Academic Press: New York, 1970.
23. C. Roos, T. Terlaky, and J.-Ph. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach, John Wiley & Sons: New York, NY, 1997.
24. W. Rudin, Principles of Mathematical Analysis, McGraw-Hill: New York, 1976.
25. G. Sonnevend, "New algorithms in convex programming based on a notion of "centre" (for systems of analytic inequalities) and on rational extrapolation," in Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference in Optimization in Irsee, West Germany, April 1986, K.H. Huffman, J.B. Hiriat-Urruty, C.Lemarechal, and J. Zowe (eds.), vol. 84, pp. 311-327, Birkhauser Verlag: Basel, Switzerland, 1988.
26. A. Shrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, NY 1986.
27. Y. Ye, Interior Point Algorithms Theory and Analysis, John Wiley & Sons, Inc.: New York, NY, 1997.
28. A.A. Yildrim and M.J. Todd, "Sensitivity analysis in linear programming and semidefinite programming using interior-point methods," Mathematical Programming, vol. 90, no. 2, pp. 229-261, 2001.