The performance of the C++ implementation is compared with that of a procedural C implementation, and while the performance of the C++ implementation is comparable to that of the C implementation, the resulting code is easier to read, modify, and maintain.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:An object-oriented design and implementation of a primal-dual algorithm for solving the semidefinite programming problem is presented.
📊
Key Findings & Data:The advantages of applying the object-oriented methodology to numerical computations, in particular to an interior point algorithm for semidefinite programming, or for solving other types of linear matrix in-equalities are discussed.
💡
Conclusion & Impact:The performance of the C++ implementation is compared with that of a procedural C implementation, and while the performance of the C++ implementation is comparable to that of the C implementation, the resulting code is easier to read, modify, and maintain.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
An object-oriented design and implementation of a primal-dual algorithm for solving the semidefinite programming problem is presented. The advantages of applying the object-oriented methodology to numerical computations, in particular to an interior point algorithm for semidefinite programming, or for solving other types of linear matrix in-equalities are discussed. One object-oriented design of the primal-dual algorithm and its implementation using C++ is presented. The performance of the C++ implementation is compared with that of a procedural C implementation, and while the performance of the C++ implementation is comparable to that of the C implementation, the resulting code is easier to read, modify, and maintain.
🔖
Cite This Article
GE, Y., WATSON, L. T., COLLINS, E. G. (1998). An object-oriented approach to semidefinite programming. Mathematical and Computational Applications, Cilt: 3 - Sayı: 1, 1–10. https://ajindex.com/articles/280477