IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v2y1998i1d10.1023_a1009791827917.html
   My bibliography  Save this article

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming

Author

Listed:
  • E. de Klerk

    (Delft University of Technology)

  • C. Roos

    (Delft University of Technology)

  • T. Terlaky

    (Delft University of Technology)

Abstract

Two primal-dual affine scaling algorithms for linear programming are extended to semidefinite programming. The algorithms do not require (nearly) centered starting solutions, and can be initiated with any primal-dual feasible solution. The first algorithm is the Dikin-type affine scaling method of Jansen et al. (1993b) and the second the classical affine scaling method of Monteiro et al. (1990). The extension of the former has a worst-case complexity bound of O(τ0nL) iterations, where τ0 is a measure of centrality of the the starting solution, and the latter a bound of O(τ0nL2) iterations.

Suggested Citation

  • E. de Klerk & C. Roos & T. Terlaky, 1998. "Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 51-69, March.
    • Handle: RePEc:spr:jcomop:v:2:y:1998:i:1:d:10.1023_a:1009791827917
    DOI: 10.1023/A:1009791827917
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009791827917
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009791827917?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sturm, J.F. & Zhang, S., 1995. "Symmetric primal-dual path following algorithms for semidefinite programming," Econometric Institute Research Papers EI 9554-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Renato D. C. Monteiro & Ilan Adler & Mauricio G. C. Resende, 1990. "A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 191-214, May.
    3. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ali Mohammad-Nezhad & Tamás Terlaky, 2017. "A polynomial primal-dual affine scaling algorithm for symmetric conic optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 577-600, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    2. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Other publications TiSEM 9b41ff5e-2808-4d12-a58c-0, Tilburg University, School of Economics and Management.
    3. Arjan B. Berkelaar & Jos F. Sturm & Shuzhong Zhang, 1997. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Tinbergen Institute Discussion Papers 97-025/4, Tinbergen Institute.
    4. F. A. Potra & R. Sheng, 1998. "Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 99(1), pages 103-119, October.
    5. Badenbroek, Riley & Dahl, Joachim, 2020. "An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK," Other publications TiSEM bcf7ef05-e4e6-4ce8-b2e9-6, Tilburg University, School of Economics and Management.
    6. Camila de Lima & Antonio Roberto Balbo & Thiago Pedro Donadon Homem & Helenice de Oliveira Florentino Silva, 2017. "A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 147-164, February.
    7. de Klerk, Etienne & Pasechnik, Dmitrii V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," European Journal of Operational Research, Elsevier, vol. 157(1), pages 39-45, August.
    8. Zsolt Darvay & Petra Renáta Rigó, 2024. "New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 50-75, July.
    9. J. Herskovits, 1998. "Feasible Direction Interior-Point Technique for Nonlinear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 99(1), pages 121-146, October.
    10. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Other publications TiSEM b25faf5d-0142-4e14-b598-a, Tilburg University, School of Economics and Management.
    11. Yaguang Yang, 2013. "A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 859-873, September.
    12. Ali Mohammad-Nezhad & Tamás Terlaky, 2017. "A polynomial primal-dual affine scaling algorithm for symmetric conic optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 577-600, April.
    13. Petra Renáta Rigó & Zsolt Darvay, 2018. "Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier," Computational Optimization and Applications, Springer, vol. 71(2), pages 483-508, November.
    14. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    15. Luiz-Rafael Santos & Fernando Villas-Bôas & Aurelio R. L. Oliveira & Clovis Perin, 2019. "Optimized choice of parameters in interior-point methods for linear programming," Computational Optimization and Applications, Springer, vol. 73(2), pages 535-574, June.
    16. Masakazu Muramatsu & Robert J. Vanderbei, 1999. "Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 149-175, February.
    17. M. J. Best & J. Hlouskova, 2007. "An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 2: Computational Analysis," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 531-547, December.
    18. de Klerk, E. & Pasechnik, D.V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," Other publications TiSEM 90713b98-8cb2-4d0c-981c-8, Tilburg University, School of Economics and Management.
    19. Kirschner, Felix & de Klerk, Etienne, 2024. "A predictor-corrector algorithm for semidefinite programming that uses the factor width cone," Other publications TiSEM 957e76ec-7f75-4e6e-adc4-c, Tilburg University, School of Economics and Management.
    20. Halicka, Margareta, 2002. "Analyticity of the central path at the boundary point in semidefinite programming," European Journal of Operational Research, Elsevier, vol. 143(2), pages 311-324, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:2:y:1998:i:1:d:10.1023_a:1009791827917. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.