A Primal–Dual Interior Point Method for Complex–Variable Optimization Problems
References
- Armijo, L. (1966). Minimization of functions having Lipschitz continuous first partial derivatives, Pacific Journal of Mathematics 16(1): 1–3.
- Bai, Y.Q., El Ghami, M. and Roos, C. (2004). A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization, SIAM Journal on Optimization 15(1): 101–128, DOI: 10.1137/S1052623403423114.
- Bauschke, H.H. and Combettes, P.L. (2017). Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, Cham, DOI: 10.1007/978-3-319-4.
- Bouafia, M., Benterki, D. and Yassine, A. (2016). An efficient primal-dual interior-point algorithm for linear programming problems based on a new kernel function with a trigonometric barrier term, Journal of Optimization Theory and Applications 170(2): 528–554, DOI: 10.1007/s10957-016-0895-0.
- Boyd, S. and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press, Cambridge. 10.1142/S1793557120500011.
- Cai, X., Wu, L., Yue, Y., Li, M. and Wang, G. (2014). Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cones, Journal of Inequalities and Applications 2014: 308, DOI: 10.1186/1029-242X-2014-308.
- Darvay, Z., Nagy, E.M., Lesaja, G., Rigó, P.R. and Varga, A. (2024). Comprehensive analysis of kernel-based interior-point methods for P∗(κ)-LCP, Working paper, Corvinus University of Budapest, Budapest, https://ideas.repec.org/p/cvh/coecwp/2024-03.html.
- Djeffal, E. and Laouar, M. (2019). A primal-dual interior-point method based on a new kernel function for linear complementarity problem, Asian-European Journal of Mathematics 13(1): 2050001, DOI: 10.1142/S1793557120500011.
- Forsgren, A., Gill, P.E. and Wright, M.H. (2002). Interior methods for nonlinear optimization, SIAM Review 44(4): 525–597, DOI: 10.1137/S0036144502414942.
- Hirose, A. (2013). Complex-Valued Neural Networks: Advances and Applications, Wiley/IEEE Press, Hoboken.
- Hjørungnes, A. and Gesbert, D. (2007). Complex-valued matrix differentiation: Techniques and key results, IEEE Transactions on Signal Processing 55(6): 2740–2746, DOI: 10.1109/TSP.2007.893762.
- Kaczorek, T. (2026). On the global stability of fractional feedback nonlinear systems with interval matrices of positive linear parts and application to electrical circuits, International Journal of Applied Mathematics and Computer Science 36(1): 5–11, DOI: 10.61822/amcs-2026-0001.
- Kreutz-Delgado, K. (2009). The complex gradient operator and the CR-Calculus, arXiv 0906.4835, DOI: 10.48550/arXiv.0906.4835.
- Laouar, M., Brahimi, M. and Djeffal, E.A. (2022). A method projective for solution of a quadratic semi-definite problem with a new potential function, Journal of Mathematical and Computational Science 12: 193, DOI: 10.28919/jmcs/7646.
- Laouar, M., Brahimi, M. and Lakhdari, I.E. (2023). Kernel function with BFGS quasi-Newton methods for solving nonlinear semi-definite problems, Journal of Mathematics and Computer Science 33(1): 1–17, DOI: 10.22436/jmcs.033.01.01.
- Laouar, M., Brahimi, M., Ziadi, R., Saleh, M.A., Almaymouni, A.Z. and Benmessaoud, C. (2026). A generalized self-regular kernel function for large-scale nonlinear optimization problems, AIMS Mathematics 11(2): 4935–4965, DOI: 10.3934/math.2026202.
- Lee, Y., Cho, Y. and Cho, G. (2013). Kernel function based interior-point methods for horizontal linear complementarity problems, Journal of Inequalities and Applications 2013(215): 1–15, DOI: 10.1186/1029-242X-2013-215.
- Lesaja, G. and Roos, C. (2010). Unified analysis of kernel-based interior-point methods for conic optimization, SIAM Journal on Optimization 20(6): 2613–2638, DOI:10.1137/090766735.
- Leulmi, A., Ziadi, R., Souli, C., Saleh, M.A. and Almaymouni, A.Z. (2024). An interior point algorithm for quadratic programming based on a new step-length, International Journal of Analysis and Applications 22(233): 1–12, DOI: 10.28924/2291-8639-22-2024-233.
- Luo, Z.D.N., Sidiropoulos, N.D., Tseng, P. and Zhang, S. (2007). Approximation bounds for quadratic optimization with homogeneous quadratic constraints, SIAM Journal on Optimization 18(1): 1–28, DOI: 10.1137/050642691.
- Maiza, A., Ziadi, R., Saleh, M.A. and Almaymouni, A.Z. (2025). A combination of two conjugate gradient methods under a new line search with its application, International Journal of Applied Mathematics and Computer Science 35(2): 267–280, DOI: 10.61822/amcs-2025-0019.
- Matychyn, I. and Onyshchenko, V. (2021). Time-optimal control of linear fractional systems with variable coefficients, International Journal of Applied Mathematics and Computer Science 31(3): 375–386, DOI: 10.34768/amcs-2021-0025.
- Nesterov, Y. (2004). Introductory Lectures on Convex Optimization: A Basic Course, Springer, Boston.
- Nesterov, Y. and Nemirovski, A. (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia.
- Nocedal, J. and Wright, S., J. (2006). Numerical Optimization, 2nd Edn, Springer, New York.
- Peng, J., Roos, C. and Terlaky, T. (2002). Self-regular functions and new search directions for linear and semidefinite optimization, Mathematical Programming 93(1): 129–171, DOI: 10.1007/s101070200296.
- Roos, C. (2006). A full-Newton step O(n) infeasible interior-point algorithm for linear optimization, SIAM Journal on Optimization 16(4): 1110–1136, DOI: 10.1137/050623917.
- Si, X., Yang, H. and Ivanov, I.G. (2021). Conditions and a computation method of the constrained regulation problem for a class of fractional-order nonlinear continuous-time systems, International Journal of Applied Mathematics and Computer Science 31(1): 17–28, DOI: 10.34768/amcs-2021-0002.
- Srinivasarengan, K., Ragot, J., Aubrun, C. and Maquin, D. (2022). Parameter identifiability for nonlinear LPV models, International Journal of Applied Mathematics and Computer Science 32(2): 255–269, DOI: 10.34768/amcs-2022-0019.
- Tanksley, L.Y. (2009). Interior Point Methods and Kernel Functions of a Linear Program, Master’s thesis, Georgia Southern University, Statesboro, https://digitalcommons.georgiasouthern.edu/etd/650/.
- Took, C.C. and Mandic, D.P. (2010). A quaternion widely linear adaptive filter, IEEE Transactions on Signal Processing 58(8): 4427–4431, DOI: 10.1109/TSP.2010.2048323.
- Trabelsi, C., Bilaniuk, O., Zhang, Y., Serdyuk, D., Subramanian, S., Santos, J.F., Mehri, S., Rostamzadeh, N., Bengio, Y. and Pal, C.J. (2018). Deep complex networks, Proceedings of the International Conference on Learning Representations (ICLR), Vancouver, Canada.
- Viksal, P. (2023). The Quantum Approximate Optimization Algorithm: Optimization Problems and Implementations, PhD thesis, Chalmers University of Technology, Göteborg, https://research.chalmers.se/publication/536821/file/536821_Fulltext.pdf.
- Watrous, J. (2018). The Theory of Quantum Information, Cambridge University Press, Cambridge.
- Wright, S.J. (1997). Primal-Dual Interior-Point Methods, SIAM, Philadelphia.
- Wächter, A. and Biegler, L.T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming 106(1): 25–57, DOI: 10.1007/s10107-004-0559-y.
- Ye, Y. (1997). Interior-Point Algorithms: Theory and Analysis, John Wiley & Sons, New York.
- Zhang, L. and Xu, Y. (2011). A new infeasible interior-point algorithm with full-Newton steps for linear programming based on a simple function, International Journal of Computer Mathematics 88(15): 3163–3185, DOI: 10.1080/00207160.2011.597503.
Language: English
Page range: 177 - 194
Submitted on: Dec 12, 2025
Accepted on: Apr 14, 2026
Published on: Jun 20, 2026
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2026 Mounia Laouar, Mahmoud Brahimi, Raouf Ziadi, Mohammed A. Saleh, Abdulgader Z. Almaymuni, Abdalilah Alhalangy, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.