Skip to main content
Log in

Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We consider the problem of optimizing the ratio of two convex functions over a closed and convex set in the space of matrices. This problem appears in several applications and can be classified as a double-convex fractional programming problem. In general, the objective function is nonconvex but, nevertheless, the problem has some special features. Taking advantage of these features, a conditional gradient method is proposed and analyzed, which is suitable for matrix problems. The proposed scheme is applied to two different specific problems, including the well-known trace ratio optimization problem which arises in many engineering and data processing applications. Preliminary numerical experiments are presented to illustrate the properties of the proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Enkhbat, R., Bazarsad, Y., Enkhbayar, J.: Convex–concave fractional minimization problem. J. Mong. Math. Soc. 15, 3–10 (2011)

    MathSciNet  MATH  Google Scholar 

  2. Barros, A.I.: Discrete and Fractional Programming Techniques for Location Models. Kluwer Academic Publishers, Dordrecht (1998)

    Book  MATH  Google Scholar 

  3. Enkhbat, R., Zhou, J., Teo, K.L.: A global optimization approach to fractional optimal control. J. Ind. Manag. Optim. 12, 73–82 (2016)

    MathSciNet  MATH  Google Scholar 

  4. Schaible, S., Ibaraki, T.: Fractional programming. Eur. J. Oper. Res. 12(4), 325–338 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 495–608. Kluwer Academic Publishers, Dordrecht (1995)

    Chapter  Google Scholar 

  6. Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13(7), 492–498 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liang, Z.A., Huang, H.X., Pardalos, P.M.: Optimality conditions and duality for a class of nonlinear fractional programming problems. J. Optim. Theory Appl. 110(3), 611–619 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Stancu-Minasian, I.M.: Fractional Programming: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

  9. Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)

    MATH  Google Scholar 

  10. Pardalos, P.M., Pillips, A.T.: Global optimization of fractional programs. J. Glob. Optim. 1, 173–182 (1991)

    Article  MathSciNet  Google Scholar 

  11. Schaible, S.: Fractional programming: applications and algorithms. Eur. J. Oper. Res. 7(2), 111–120 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. Barysbek, J.B., Tungalag, N., Enkhbat, R.: Application of conditional gradient method to a corporate financing problem. J. Pure Appl. Math. 107(1), 179–186 (2016)

    Google Scholar 

  13. Bouhamidi, A., Enkhbat, R., Jbilou, K.: Conditional gradient Tikhonov method for convex optimization problems in image restoration. J. Comput. Appl. Math. 255, 580–592 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Harchaoui, Z., Juditsky, A., Nemirovski, A.: Conditional gradient algorithms for norm-regularized smooth convex optimization. Math. Program. 152, 75–112 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Jaggi, M.: Revisiting Frank–Wolfe: projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, Atlanta, Georgia, USA, JMLR: W&CP 28 (2013)

  16. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Quart. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  17. Longsine, D.E., McCormick, S.F.: Simultaneous Rayleigh-quotient minimization methods for \(Ax = \lambda Bx\). Linear Algebra Appl. 34, 195–2234 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  18. Neymeyr, K., Zhou, M.: Iterative minimization of the Rayleigh quotient by block steepest descent iterations. Numer. Linear Algebra Appl. 21, 604–617 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sameh, A.H., Wisniewski, J.A.: A trace minimization algorithm for the generalized eigenvalue problem. SIAM J. Numer. Anal. 19(6), 1243–1259 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ngo, T.T., Bellalij, M., Saad, Y.: The trace ratio optimization problems. SIAM Rev. 54(3), 545–569 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wang, H., Yan, S., Xu, D., Tang, X., Huang, T.: Trace ratio vs. ratio trace for dimensionality reduction. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR-07 (2007)

  22. Yan, S., Tang, X.: Trace quotient problems revisited. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) Proceedings of the European Conference on Computer Vision, vol. 2, Number 3952, pp. 232–244. Lecture Notes in Computer Science. Springer, Berlin (2006)

  23. Lu, J., Plataniotis, K., Venetsanopoulos, A.: Face recognition using LDA-based algorithms. IEEE Trans. Neural Netw. 14(1), 195–200 (2003)

    Article  Google Scholar 

  24. Avron, H., Toledo, S.: Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. J. ACM 58(2), 8 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  25. Han, I., Malioutov, D., Avron, H., Shin, J.: Approximating the spectral sums of large-scale matrices using Chebyshev approximations. arXiv preprint arXiv:1606.00942v2 (2017)

  26. Ubaru, S., Chen, J., Saad, Y.: Fast estimation of \(Tr(f(A))\) via stochastic Lanczos quadrature. SIAM J. Matrix Anal. Appl. 38(4), 1075–1099 (2017)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We are grateful to the referees for their helpful comments and suggestions. The fifth author would like to thank Abderrahman Bouhamidi, Khalide Jbilou, and Hassane Sadok for their hospitality during a one-month visit to the Laboratory LMPA at Université du Littoral Côte d’Opale, Calais, France, in June 2017.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcos Raydan.

Additional information

Dedicated to the memory of Mohammed Bellalij.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bouhamidi, A., Bellalij, M., Enkhbat, R. et al. Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems. J Optim Theory Appl 176, 163–177 (2018). https://doi.org/10.1007/s10957-017-1203-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-017-1203-3

Keywords

Mathematics Subject Classification

Navigation