Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 66, 2017 - Issue 12
Submit an article Journal homepage
149
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Elliptic cone optimization and primal–dual path-following algorithms

Baha AlzalgDepartment of Mathematics, The University of Jordan, Amman, Jordan.Correspondence[email protected]
View further author information
&
Mohammad PirhajiDepartment of Applied Mathematics, Shahrekord University, Shahrekord, Iran.View further author information
Pages 2245-2274 | Received 23 Jan 2017, Accepted 23 Jul 2017, Published online: 09 Aug 2017

References

  • Alzalg B. The Jordan algebraic structure of the circular cone. Oper Matrices. 2017;11(1):1–21.
  • Chi X, Wan Z, Zhu Z, Yuan L. A nonmonotone smoothing Newton method for circular cone programming. Optimization. 2016;65(12):2227–2250.
  • Zhou J, Chen J-S, Mordukhovich BS. Variational analysis of circular cone programs. Optimization. 2014;64:113–147.
  • Bai Y, Ma P, Zhang J. A polynomial-time interior-point method for circular cone programming based on kernel functions. J Indust Manag Opt. 2016;12:739–756.
  • Fang S-C, Xing WX. Linear conic programming: theory and applications. Beijing: Science Press; 2013.
  • Faraut J, Korányi A. Analysis on symmetric cones. New York (NY): Oxford University Press; 1994.
  • Lobo M, Vandenberghe L, Boyd S, Lebret H. Applications of second-order cone programming. Linear Algebra Appl. 1998;284:193–228.
  • Alizadeh F, Goldfarb D. Second-order cone programming. Math Program Ser A. 2003;95:3–51.
  • Alzalg B, Pirhaji M. Primal-dual path-following algorithms for circular programming. Commun Comb Optim. Forthcoming.
  • Boyd S, Vandenberghe L. Convex optimization. Cambridge: Cambridge University Press; 2004.
  • Alzalg B. Stochastic second-order cone programming: application models. Appl Math Model. 2012;36:5122–5134.
  • Sun P, Freund R. Computation of minimum-cost covering ellipsoids. Oper Res. 2004;52:690–706.
  • Bauschke H. Projection algorithms and monotone operators [PhD thesis]. Simon Fraser University; 1996.
  • Watkins D. Fundamentals of matrix computations. 2nd ed. New York (NY): Wiley; 2002.
  • Nesterov Y, Nemirovskii A. Interior point polynomial algorithms in convex programming. Philadelphia (PA): SIAM; 1994.
  • Karmarkar N. New polynomial-time algorithm for linear programming. Combinattorica. 1984;4:373–395.
  • Faybusovich L. Euclidean Jordan algebras and interior-point algorithms. Positivity. 1997;1:331–357.
  • Nesterov Y, Todd M. Self-scaled barriers and interior-point methods for convex programming. Math Oper Res. 1997;22:1–42.
  • Nesterov Y, Todd M. Primal-dual interior-point methods for self-scaled cones. SIAM J Optim. 1998;8:324–364.
  • Monteiro R. Primal-dual path-following algorithms for semidefinite programming. SIAM J Optim. 1997;7:663–678.
  • Kojima M, Megiddo N, Noma T, Yoshise A. A unified approach to interior point algorithms for linear complementarity problems. Vol. 538, Lecture notes in computer science. New York (NY): Springer Verlag; 1991.
  • Schmieta S, Alizadeh F. Extension of primal-dual interior-point algorithms to symmetric cones. Math Program Ser A. 2003;96:409–438.
  • Helmberg C, Rendl F, Vanderbei R, Wolkowicz H. An interior-point method for semidefinite programming. SIAM J Optim. 1996;6:342–361.
  • Kojima M, Shindoh S, Hara S. Interior-point methods for the monotone semidefinite linear complementary problem in symmetric matrices. SIAM J Optim. 1997;7:86–125.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.