Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 6, November-December 2025
Page(s) 3505 - 3521
DOI https://doi.org/10.1051/ro/2025122
Published online 23 December 2025
  • M. Achache, A weighted path-following method for the linear complementarity problem. Univ. Babes Bolyai Ser. Inf. 49 (2004) 61–73. [Google Scholar]
  • M. Achache, A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25 (2006) 97–110. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Achache, Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems. Comput. Appl. Math. 216 (2010) 1889–1895. [Google Scholar]
  • M. Achache and L. Guerra, A full Nesterov Todd-step feasible primal dual interior point algorithm for convex quadratic semi-definite optimization. Appl. Math. Comput. 231 (2014) 581–590. [MathSciNet] [Google Scholar]
  • M. Achache and N. Tabchouche, A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems. Optim. Lett. 13 (2019) 1039–1057. [CrossRef] [MathSciNet] [Google Scholar]
  • F. Alizadeh, J.P.A. Haeberly and M.L. Overton, Primal-dual interior-point methods for semidefinite programming. Convergence rates, stability and numerical results. SIAM J. Optim. 8 (1998) 746–768. [Google Scholar]
  • Y.Q. Bai, F.Y. Wang and X.W. Luo, A polynomial time interior point algorithm for convex quadratic semidefinite optimization. RAIRO-Oper. Res. 44 (2010) 251–265. [Google Scholar]
  • S. Boyd and L. Xiao, Least-squares covariance matrix adjustment. SIAM J. Matrix Anal. Appl. 27 (2005) 532–546. [Google Scholar]
  • C. Daili and M. Achache, An interior point algorithm for semidefinite least squares problems. App. Math. 3 (2022) 371–391. [Google Scholar]
  • Z. Darvay, New interior-point algorithms for linear optimization. Adv. Model. Optim. 5 (2003) 51–92. [MathSciNet] [Google Scholar]
  • E. De Klerk, Interior point methods for semidefinite programming. M.S. thesis, Univ. Pretoria (1997). https://pure.uvt.nl/ws/portalfiles/portal/844453/thesis.pdf. [Google Scholar]
  • M.S. Gowda and Y. Song, On semidefinite linear complementarity problems. Math. Program. 88 (2000) 575–587. [Google Scholar]
  • W. Grimes, Path-following interior-point algorithm for monotone linear complementarity problems. Asian-Eur. J. Math. 15 (2022) 2250170. [CrossRef] [Google Scholar]
  • L. Guerra, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization. RAIRO-Oper. Res. 56 (2022) 3955–3971. [Google Scholar]
  • M. Kojima, M. Shida and S. Shindoh, Search directions in the SDP and monotone SDLCP: generalization and inexact computation. Math. Program. 85 (1999) 51–80. [Google Scholar]
  • B. Krislock, Numerical solution of semidefinite constrained least squares problems. Doctoral dissertation, University Regina, (2000). http://hdl.handle.net/2429/14126. [Google Scholar]
  • A. Mohamed, A weighted full-Newton step primal-dual interior point algorithm for convex quadratic optimization. Stat. Optim. Inf. Comput. 2 (2014) 21–32. [Google Scholar]
  • N. Moussaoui and M. Achache, A weighted-path following interior-point algorithm for convex quadratic optimization based on modified search directions. Stat. Optim. Inf. Comput. 10 (2022) 873–889. [Google Scholar]
  • Y.E. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8 (1998) 324–364. [Google Scholar]
  • J.W. Nie and Y.X. Yuan, A potential reduction algorithm for an extended SDP problem. Sci. Chin. (Ser. A) 43 (2000) 35–46. [Google Scholar]
  • X. Quian, Comparison Between an Infeasible Interior Point Algorithm and a Homogeneous Self Dual Algorithm for Semidefinite Programming. New Mexico Institute of Mining and Technology. Socorro, New Mexico (2006). [Google Scholar]
  • K.C. Toh, M.J. Todd and R.H. Tütüncu, SDPT3-a MATLAB software package for semidefinite programming, Version 1.3. Optim. Methods Softw. 11 (1999) 545–581. [Google Scholar]
  • Y. Ye, Interior Point Algorithms: Theory and Analysis. Vol. 44. John Wiley & Sons (2011). [Google Scholar]
  • F. Zhang, Matrix Theory Basic Results and Techniques. Springer (2011). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.