APA (7th ed.) Citation

Zhadan, V. G. (2022). Primal–Dual Newton Method with Steepest Descent for the Linear Semidefinite Programming Problem: Iterative Process. Computational Mathematics and Mathematical Physics, 62(4), 581. https://doi.org/10.1134/s0965542522040133

Chicago Style (17th ed.) Citation

Zhadan, V. G. "Primal–Dual Newton Method with Steepest Descent for the Linear Semidefinite Programming Problem: Iterative Process." Computational Mathematics and Mathematical Physics 62, no. 4 (2022): 581. https://doi.org/10.1134/s0965542522040133.

MLA (9th ed.) Citation

Zhadan, V. G. "Primal–Dual Newton Method with Steepest Descent for the Linear Semidefinite Programming Problem: Iterative Process." Computational Mathematics and Mathematical Physics, vol. 62, no. 4, 2022, p. 581, https://doi.org/10.1134/s0965542522040133.