Solving quadratic programming problems via Meta-controlled Boltzmann machine

Don Jyh Fu Jeng, Junzo Watada, Teruyuki Watanabe

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    The Meta-controlled Boltzmann machine was proposed by J. Watada et. al. to solve the quadratic programming problem. It is shown that this model converges more efficiently than a conventional Boltzmann machine. In this paper, the inner behaviors of the model is evaluated in applying it to a quadratic programming problem, the portfolio selection problem.

    Original languageEnglish
    Title of host publication2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings
    Pages310-315
    Number of pages6
    Publication statusPublished - 2005
    Event2005 IEEE International Workshop on Intelligent Signal Processing - Faro
    Duration: 2005 Sep 12005 Sep 3

    Other

    Other2005 IEEE International Workshop on Intelligent Signal Processing
    CityFaro
    Period05/9/105/9/3

    Keywords

    • Boltzmann machine
    • Hopfield machine
    • Met-control
    • Neural network
    • Portfolio selection problem
    • Quadratic programming problem

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint Dive into the research topics of 'Solving quadratic programming problems via Meta-controlled Boltzmann machine'. Together they form a unique fingerprint.

  • Cite this

    Jeng, D. J. F., Watada, J., & Watanabe, T. (2005). Solving quadratic programming problems via Meta-controlled Boltzmann machine. In 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings (pp. 310-315). [1531677]