SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS

DOI Web Site Web Site 1 Citations 30 References

Search this article

Description

Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur complement matrix. Numerical results of selected test problems using SeDuMi and LANCELOT are included to demonstrate the performance of the SOCP formulation.

Journal

Citations (1)*help

See more

References(30)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top