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

Constraint Consensus Methods for Finding Strictly Feasible Points of Linear Matrix Inequalities

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

Received 25 July 2014; Revised 31 October 2014; Accepted 6 November 2014

Academic Editor: Manlio Gaudioso

Copyright © 2015 Shafiu Jibrin and James W. Swift. 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. M. J. Todd, “Semidefinite optimization,” Acta Numerica, vol. 10, pp. 515–560, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  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 MathSciNet · View at Scopus
  3. J. W. Chinneck, “The constraint consensus method for finding approximately feasible points in nonlinear programs,” INFORMS Journal on Computing, vol. 16, no. 3, pp. 255–265, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. R. B. Kearfott and J. Dian, “An iterative method for finding approximate feasible points,” Tech. Rep., Department of Mathematics, University of Southern Louisiana, Lafayette, La, USA, 2000. View at Google Scholar
  5. P. Gahinet and A. Nemirovski, “The projective method for solving linear matrix inequalities,” Mathematical Programming, vol. 77, pp. 163–190, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. A. Rami, U. Helmke, and J. B. Moore, “A finite steps algorithm for solving convex feasibility problems,” Journal of Global Optimization, vol. 38, no. 1, pp. 143–160, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. D. Baang, “Improved ellipsoid algorithm for LMI feasibility problems,” International Journal of Control, Automation and Systems, vol. 7, no. 6, pp. 1015–1019, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Censor and S. A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York, NY, USA, 1997. View at MathSciNet
  9. W. Ibrahim and J. W. Chinneck, “Improving solver success in reaching feasibility for sets of nonlinear constraints,” Computers & Operations Research, vol. 35, no. 5, pp. 1394–1411, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. B. Borchers, “SDPLIB 1.2, library of semidefinite programming test problems,” Optimization Methods and Software, vol. 11, no. 1–4, pp. 683–690, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. S. Jibrin, “Generating uniform points on the boundary of bounded spectrahedron with applications to rank constrained linear matrix inequality problem,” International Journal of Applied Mathematics & Engineering Sciences, vol. 1, no. 1, pp. 27–38, 2007. View at Google Scholar
  12. R. J. Caron, T. Traynor, and S. Jibrin, “Feasibility and constraint analysis of sets of linear matrix inequalities,” INFORMS Journal on Computing, vol. 22, no. 1, pp. 144–153, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. M. L. Overton and R. S. Womersley, “Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices,” Mathematical Programming, vol. 62, no. 2, pp. 321–357, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. Sturm, “Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones,” Optimization Methods and Software, vol. 11-12, pp. 625–653, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus