Table of Contents Author Guidelines Submit a Manuscript
Journal of Mathematics
Volume 2015, Article ID 456392, 9 pages
http://dx.doi.org/10.1155/2015/456392
Research Article

Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method

Department of Mathematics and Statistics, Northern Arizona University, Flagstaff, AZ 86011-5717, USA

Received 31 August 2015; Accepted 30 September 2015

Academic Editor: Baoding Liu

Copyright © 2015 Shafiu Jibrin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. Alizadeh, “Interior point methods in semidefinite programming with applications to combinatorial optimization,” SIAM Journal on Optimization, vol. 5, no. 1, pp. 13–51, 1995. View at Publisher · View at Google Scholar
  2. L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM Review, vol. 38, no. 1, pp. 49–95, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. L. Vandenberghe, S. Boyd, and S.-P. Wu, “Determinant maximization with linear matrix inequality constraints,” SIAM Journal on Matrix Analysis and Applications, vol. 19, no. 2, pp. 499–533, 1998. View at Publisher · View at Google Scholar · View at Scopus
  4. D. S. Atkinson and P. M. Vaidya, “A scaling technique for finding the weighted analytic center of a polytope,” Mathematical Programming, vol. 57, no. 1, pp. 163–192, 1992. View at Publisher · View at Google Scholar · View at Scopus
  5. I. S. Pressman and S. Jibrin, “A weighted analytic center for linear matrix inequalities,” Journal of Inequalities in Pure and Applied Mathematics, vol. 2, no. 3, article 29, 2002. View at Google Scholar
  6. S. Jibrin and J. W. Swift, “The boundary of the weighted analytic center for linear matrix inequalities,” Journal of Inequalities in Pure and Applied Mathematics, vol. 5, no. 1, article 14, 2004. View at Google Scholar
  7. J. Renegar, “A polynomial-time algorithm, based on Newton’s method, for linear programming,” Mathematical Programming, vol. 40, no. 1–3, pp. 59–93, 1988. View at Publisher · View at Google Scholar · View at Scopus
  8. J. MacHacek and S. Jibrin, “An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers,” Journal of Applied Mathematics, vol. 2012, Article ID 946893, 21 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. L. Vandenberghe and S. Boyd, Convex Optimization, Cambridge University Press, New York, NY, USA, 2004.
  10. F. Alizadeh, J.-P. A. Haeberly, and M. L. Overton, “Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results,” SIAM Journal on Optimization, vol. 8, no. 3, pp. 746–768, 1998. View at Publisher · View at Google Scholar · View at Scopus
  11. Z.-Q. Luo, J. F. Sturm, and S. Zhang, “Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming,” SIAM Journal on Optimization, vol. 8, no. 1, pp. 59–81, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus