Advertisement

A Variant of the Simplex Method for Second-Order Cone Programming

  • Vitaly ZhadanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)

Abstract

The linear second-order cone programming problem is considered. For its solution a variant of the primal simplex-type method is proposed. This variant is a generalization on the cone programming of the standard simplex method for linear programming. At each iteration the dual variable and dual slack are defined, and the move from the given extreme point to another one is realized. Finite and infinite convergence of the method to the solution of the problem having a special form is discussed.

Keywords

Second-order cone programming Simplex-type method Finite and infinite convergence 

References

  1. 1.
    Anjos, M.F., Lasserre, J.B. (eds.): Handbook of Semidefinite, Cone and Polynomial Optimizatin: Theory, Algorithms, Software and Applications. Springer, New York (2011).  https://doi.org/10.1007/978-1-4614-0769-0CrossRefGoogle Scholar
  2. 2.
    Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B. 95, 3–51 (2003)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second order cone programming. Linear Algebra Appl. 284, 193–228 (1998)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Nesterov, YuE, Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324–364 (1998)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of primal-dual algorithms for second-order cone program based on the MZ-family of directions. Math. Program. 88(1), 61–83 (2000)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Pataki, G.: Cone-LP’s and semidefinite programs: geometry and a simplex-type method. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 162–174. Springer, Heidelberg (1996).  https://doi.org/10.1007/3-540-61310-2_13CrossRefzbMATHGoogle Scholar
  7. 7.
    Muramatsu, M.: A pivoting procedure for a class of second-order cone programming. Optim. Methods Softw. 21(2), 295–314 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hayashi, Sh., Okuno, T., Ito, Y.: Simplex-type algorithm for second-order cone programming via semi-infinite programming reformulation. Optim. Methods Softw. 31(4–6), 1272–1297 (2016)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Goberna, M.A., Lopez, M.A.: Linear Semi-Infinite Optimization. Wiley, New York (1998)zbMATHGoogle Scholar
  10. 10.
    Zhadan V.G.: Two-phase simplex method for linear semidefinite optimization. Optim. Lett. 1–16 (2018). https://doi.org/10:1007/s11590-018-133-z
  11. 11.
    Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht (2000)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Dorodnicyn Computing Centre, FRC “Computer Science and Control” of RASMoscowRussia
  2. 2.Moscow Institute of Physics and Technology (State Research University)Dolgoprudny, Moscow RegionRussia

Personalised recommendations