Solving a quadratic fractional problem via a new quadratic formulation
*Bennani AhlemCorresponding authorahlem.bennani@univ-setif.dzDepartment of MathematicsFaculty of SciencesLaboratory of Fundamental and Numerical MathematicsUniversity of Ferhat Abbas Setif-119000, AlgeriaView full profile → , Dj. Benterkidjbenterki@univ-setif.dzDepartment of MathematicsFaculty of SciencesLaboratory of Fundamental and Numerical MathematicsUniversity of Ferhat Abbas Setif-119000, AlgeriaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 04 May 2022
- Published Online:
- 03 Feb 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1224
- Pages:
- 1–15
Abstract
Keywords
Subject Classifications
References
[1] K. Archana and S. R. Arora, “An algorithm for solving quadratic fractional program with linear homogeneous constraints,” Vietnam J. Math., vol. 39, pp. 391–404 (2011).
[2] A. Beck, A. Ben-Tal, and M. Teboulle, “Finding a global optimal solution for a quadratically constrained fractional quadratic problem with applications to the regularized total least squares,” SIAM J. Matrix Anal. Appl., vol. 2, pp. 425–445 (2006).
[3] A. Bennani, D. Benterki, and H. Grar, “Adaptive projection methods for linear fractional programming,” RAIRO Oper. Res., vol. 55, pp. S2383–S2392 (2021).
[4] M. Bouafia, D. Benterki, and A. Yassine, “A new efficient short-step projective interior point method for linear programming,” Oper. Res. Lett., vol. 46, pp. 291–294 (2018).
[5] N. Boudjellal, H. Roumili, and D. Benterki, “A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function,” Optimization, vol. 70, no. 8, pp. 1703–1724 (2021).
[6] N. Boudjellal, H. Roumili, and D. Benterki, “Complexity analysis of interior point methods for convex quadratic programming based on a parameterized kernel function,” Bol. Soc. Paran. Mat., vol. 40, pp. 1–16 (2022).
[7] G. Dantzig, Linear Programming and Extensions, Princeton University Press (1963).
[8] N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, pp. 373–395 (1984).
[9] H. A. Le Thi and T. Pham Dinh, “A continuous approach for large-scale constrained quadratic zero-one programming,” Optimization, vol. 45, pp. 1–28 (2001).
[10] H. A. Le Thi, “An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints,” Math. Program., vol. 87, pp. 401–426 (2000).
[11] H. A. Le Thi and T. Pham Dinh, “On solving linear complementarity problems by DC programming and DCA,” Comput. Optim. Appl., vol. 50, pp. 507–524 (2011).
[12] H. A. Le Thi and T. Pham Dinh, “Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms,” J. Global Optim., vol. 11, no. 3, pp. 253–285 (1997).
[13] H. A. Le Thi and T. Pham Dinh, “The DC (Difference of Convex Functions) programming and DCA revisited with DC models of real world nonconvex optimization problems,” Ann. Oper. Res., vol. 133, no. 3, pp. 23–46 (2005).
[14] I. J. Lustig, “A practical approach to Karmarkar’s algorithm,” Tech. Rep. Sol 85-5, System Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA 94305 (1985).
[15] I. J. Lustig, “Feasibility issues in a primal-dual interior point method for linear programming,” Math. Program., vol. 49, pp. 145–162 (1991).
[16] A. Nejmaddin Suleiman and A. Maher Nawkhas, “Solving quadratic fractional programming problem,” Int. J. Appl. Math. Res., vol. 2, pp. 303–309 (2013).
[17] L. Menniche, D. Benterki, and I. Benchetta, “An efficient logarithmic barrier method for linear programming,” J. Inform. Optim. Sci., vol. 42, no. 8, pp. 1799–1813 (2021).
[18] T. Pham Dinh, “Algorithme de calcul d’une forme quadratique sur la boule unité de la norme maximum,” Numer. Math., vol. 45, pp. 377–440 (1985).
[19] T. Pham Dinh, “Algorithms for solving a class of non-convex optimization problems. Methods of subgradients,” Fermat Days 85, Mathematics for Optimization, J. B. Hiriart-Urruty, Ed., Elsevier Science Publishers, B.V., North-Holland (1986).
[20] T. Pham Dinh and H. A. Le Thi, “A DC optimization algorithm for solving the trust-region subproblem,” SIAM J. Optim., vol. 8, no. 2, pp. 476–505 (1998).
[21] T. Pham Dinh and H. A. Le Thi, “Convex analysis approach to DC programming. Theory, algorithms and applications,” Acta Math. Vietnam, vol. 22, no. 1, pp. 289–355 (1997).
[22] M. Rashidul Hasan and M. Babul Hasan, “An alternative method for solving quadratic fractional programming problems with homogeneous constraints,” J. Emerging Trends Eng. Appl. Sci., vol. 5, pp. 11–19 (2014).
[23] M. Sivri, I. Albayrak, and G. Temelcan, “A novel approach for solving quadratic fractional programming problems,” Croat. Oper. Res. Rev., vol. 9, pp. 199–209 (2018).
[24] N. Van-Bong, S. Ruey-Lin, and X. Yong, “An SDP approach for solving quadratic fractional programming problems,” Cornell University (2014).
[25] A. Yassine, Méthode de région de confiance et optimisation DC, théorie, algorithmes et applications, HDR-Université Henri Poincaré, Nancy I (1998).
