Skip to main content
Log in

An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization

  • Research Article
  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

In this paper, an interior point method (IPM) based on a new kernel function for solving linearly constrained convex optimization problems is presented. So, firstly a survey on several trigonometric kernel functions defined in literature is done and some properties of them are studied. Then some common characteristics of these functions which help us to define a new trigonometric kernel function are obtained. We generalize the growth term of the kernel function by applying a positive parameter p and rewritten the trigonometric kernel functions defined in the literature. By the help of some simple analysis tools, we show that the IPM based on the new kernel function obtains \(O\left( \sqrt{n}\log n\log \frac{n}{\epsilon }\right) \) iteration complexity bound for large-update methods. Finally, we illustrate some numerical results of performing IPMs based on the kernel functions for solving non-negative matrix factorization problems.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Achache M, Goutali M (2015) Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO. Numer. Algorithms 70:393–405

    Article  MathSciNet  Google Scholar 

  • Bai YQ, El Ghami M, Roos C (2004) A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1):101–128

    Article  MathSciNet  Google Scholar 

  • Berry M, Browne M, Langville A, Pauca V, Plemmons R (2007) Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52(1):155–170

    Article  MathSciNet  Google Scholar 

  • Bouafia M, Yassine A (2019) An efficient twice parameterized trigonometric kernel function for linear optimization. A. Optim Eng. https://doi.org/10.1007/s11081-019-09467-w

    Article  MATH  Google Scholar 

  • Bouafia M, Benterki D, Yassine A (2016) An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. J. Optim. Theory Appl. 170(2):528–545

    Article  MathSciNet  Google Scholar 

  • Bouafia M, Benterki D, Yassine A (2018) An efficient parameterized logarithmic kernel function for linear optimization. Optim Lett. 12(5):1079–1097

    Article  MathSciNet  Google Scholar 

  • Boutsidis C Gallopoulos E (2007) SVD based initialization: a head start for nonnegative matrix factorization. Computer Engineering and Informatics Department, University of Patras, GR-26500, Patras, Greece

  • Buciu I (2008) Non-negative matrix factorization, a new tool for feature extraction: theory and applications. Int J Comput Commun Control 3:67–74

    Article  Google Scholar 

  • Cai XZ, Wang GQ, El Ghami M, Yue YJ (2014) Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term. Abstract and Applied Analysis, Art. ID 710158

  • Cichocki A, Zdunek R, Phan A, Amari S (2009) Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation. Wiley, New York

    Book  Google Scholar 

  • Darvay Z (2009) A predictor-corrector algorithm for linearly constrained convex optimization. Studia Univ Babes Bolyai Inf LIV(2):121–138

    MathSciNet  MATH  Google Scholar 

  • El Ghami M, Guennoun ZA, Boula S, Steihaug T (2012) Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236:3613–3623

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Fakharzadeh Jahromi A (2020) An interior point method for \(P_*(\kappa )\)-horizontal linear complementarity problem based on a new proximity function. J. Appl. Math. Comput. 62:281–300

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Moaberfard Z (2020) A generic kernel function for interior point methods. Optim Eng. https://doi.org/10.1007/s11081-020-09512-z

    Article  Google Scholar 

  • Fathi-Hafshejani S, Fatemi M, Peyghami MR (2015) An interior-point method for \(P_*(\kappa )\)-linear complementarity problem based on a trigonometric kernel function. J. Appl. Math. Comput. 48:111–128

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Mansouri H, Peyghami MR (2016) A large-update primal-dual interior-point algorithm for second-order cone optimization based on a new proximity function. Optimization. 65(6):1477–1496

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Mansourib H, Peyghamic MR, Chene S (2018) Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term. Optimization. 67(10):1605–1630

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Fakharzadeh Jahromi A, Peyghami MR (2018a) A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions. Optimization 67:113–137

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Fakharzadeh Jahromi A, Peyghami MR, Chen S (2018b) Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term. J. Optim. Theory Appl. 178:935–949

    Article  MathSciNet  Google Scholar 

  • Fathi-Hafshejani S, Peyghami MR, Fakharzadeh Jahromi A (2020) An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term. Optim Eng. 21:107–129

    Article  MathSciNet  Google Scholar 

  • Kheirfam B (2012) Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms. 61:659–680

    Article  MathSciNet  Google Scholar 

  • Lee DD, Seung HS (2001) Algorithms for nonnegative matrix factorization. In: Advances in Neural Information Processing Systems, 556–562

  • Li X, Zhang M (2015) Interior-point algorithm for linear optimization based on a new trigonometric kernel function. Operations Research Letters 43:471–475

    Article  MathSciNet  Google Scholar 

  • Li X, Zhang M, Chen Y (2017) An interior-point algorithm for \(P_*(\kappa )\)-LCP based on a new trigonometric kernel function with a double barrier term. J. Appl. Math. Comput. 53(1–2):487–506

    Article  MathSciNet  Google Scholar 

  • Lin CJ (2007) Projected gradient methods for nonnegative matrix factorization. Neural computation 19(10):2756–2779

    Article  MathSciNet  Google Scholar 

  • Moaberfard Z, Fathi-Hafshejani S, Fakharzadeh Jahromi A (2019) An interior-point method for linear optimization based on a trigonometric kernel function, Journal of Nonlinear Functional Analysis, Vol. 2019, Article ID 46, 1–17

  • Monteiro RDC, Adler I (1989) Interior-point path following primal-dual algorithms: Part I: linear programming. Math. Program. 44:27–41

    Article  Google Scholar 

  • Peng J, Roos C, Terlaky T (2002) Self-Regularity a new paradigm for primal-dual interior-point algorithms. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Peyghami MR, Fathi-Hafshejani S (2014) Complexity analysis of an interior-point algorithm for linear optimization based on a new poriximity function. Numer. Algorithms. 67:33–48

    Article  MathSciNet  Google Scholar 

  • Peyghami MR, Fathi-Hafshejani S (2017) An interior point algorithm for solving convex quadratic semidefinite optimization problems using a new kernel function. Iranian J. Math. Sci. Info. 12:131–152

    MathSciNet  MATH  Google Scholar 

  • Peyghami MR, Fathi-Hafshejani S, Shirvani L (2014) Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255:74–85

    Article  MathSciNet  Google Scholar 

  • Peyghami MR, Fathi-Hafshejani S, Chen S (2016) A prima dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions. Operations Research Letters 44:319–323

    Article  MathSciNet  Google Scholar 

  • Roos C, Terlaky T, Vial J-P (2005) Theory and algorithms for linear optimization: An Interior Point Approach. Springer, New York

    MATH  Google Scholar 

  • Sonnevend G (1986) An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prakopa A, Szelezsan J, Strazicky B (eds) Lecture Notes in Control and Information Sciences, vol 84. Springer-Verlag, Berlin, pp 866–876

    Google Scholar 

  • Wang Y, Fei F (2009) A primal infeasible interior point algorithm for linearly constrained convex programming. Control Cybernet. 38(3):687–704

    MathSciNet  MATH  Google Scholar 

  • Zhang M, Bai YQ, Wang GQ (2008) A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization. Journal of Shanghai University 12(6):475–480

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Fathi-Hafshejani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fathi-Hafshejani, S., Moaberfard, Z. An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization. Optim Eng 21, 1019–1051 (2020). https://doi.org/10.1007/s11081-020-09514-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11081-020-09514-x

Keywords

Navigation