IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i2p153-d311733.html
   My bibliography  Save this article

A Lifting-Penalty Method for Quadratic Programming with a Quadratic Matrix Inequality Constraint

Author

Listed:
  • Wei Liu

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116025, China
    School of Applied Mathematics, Beijing Normal University, Zhuhai 519087, China)

  • Li Yang

    (School of Mathematics and Physics Science, Dalian University of Technology, Panjin 124221, China)

  • Bo Yu

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116025, China)

Abstract

In this paper, a lifting-penalty method for solving the quadratic programming with a quadratic matrix inequality constraint is proposed. Additional variables are introduced to represent the quadratic terms. The quadratic programming is reformulated as a minimization problem having a linear objective function, linear conic constraints and a quadratic equality constraint. A majorization–minimization method is used to solve instead a l 1 penalty reformulation of the minimization problem. The subproblems arising in the method can be solved by using the current semidefinite programming software packages. Global convergence of the method is proven under some suitable assumptions. Some examples and numerical results are given to show that the proposed method is feasible and efficient.

Suggested Citation

  • Wei Liu & Li Yang & Bo Yu, 2020. "A Lifting-Penalty Method for Quadratic Programming with a Quadratic Matrix Inequality Constraint," Mathematics, MDPI, vol. 8(2), pages 1-11, January.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:153-:d:311733
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/153/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/153/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yichuan Ding & Dongdong Ge & Henry Wolkowicz, 2011. "On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 88-104, February.
    2. Jan Leeuw, 1988. "Convergence of the majorization method for multidimensional scaling," Journal of Classification, Springer;The Classification Society, vol. 5(2), pages 163-180, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Patrick Groenen & Rudolf Mathar & Willem Heiser, 1995. "The majorization approach to multidimensional scaling for Minkowski distances," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 3-19, March.
    2. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    3. Noga Ram & Shoham Sabach, 2024. "A Globally Convergent Inertial First-Order Optimization Method for Multidimensional Scaling," Journal of Optimization Theory and Applications, Springer, vol. 202(2), pages 949-974, August.
    4. Linghao Zhang & Bo Pang & Haitao Tang & Hongjun Wang & Chongshou Li & Zhipeng Luo, 2022. "Pairwise Constraints Multidimensional Scaling for Discriminative Feature Learning," Mathematics, MDPI, vol. 10(21), pages 1-16, November.
    5. Michael J. Greenacre & Patrick J. F. Groenen, 2016. "Weighted Euclidean Biplots," Journal of Classification, Springer;The Classification Society, vol. 33(3), pages 442-459, October.
    6. Renata Sotirov, 2014. "An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 16-30, February.
    7. Kagie, M. & van Wezel, M.C. & Groenen, P.J.F., 2009. "Map Based Visualization of Product Catalogs," ERIM Report Series Research in Management ERS-2009-010-MKT, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. Groenen, P.J.F. & Borg, I., 2013. "The Past, Present, and Future of Multidimensional Scaling," Econometric Institute Research Papers EI 2013-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Groenen, P.J.F. & van de Velden, M., 2004. "Multidimensional scaling," Econometric Institute Research Papers EI 2004-15, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    10. Robert Schneider, 1992. "A uniform approach to multidimensional scaling," Journal of Classification, Springer;The Classification Society, vol. 9(2), pages 257-273, December.
    11. Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.
    12. Lawrence Hubert & Phipps Arabie & Matthew Hesson-Mcinnis, 1992. "Multidimensional scaling in the city-block metric: A combinatorial approach," Journal of Classification, Springer;The Classification Society, vol. 9(2), pages 211-236, December.
    13. repec:jss:jstsof:31:i03 is not listed on IDEAS
    14. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    15. Hanafi, Mohamed & Kiers, Henk A.L., 2006. "Analysis of K sets of data, with differential emphasis on agreement between and within sets," Computational Statistics & Data Analysis, Elsevier, vol. 51(3), pages 1491-1508, December.
    16. Simon J. L. Billinge & Phillip M. Duxbury & Douglas S. Gonçalves & Carlile Lavor & Antonio Mucherino, 2018. "Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures," Annals of Operations Research, Springer, vol. 271(1), pages 161-203, December.
    17. Peter Verboon & Willem Heiser, 1992. "Resistant orthogonal procrustes analysis," Journal of Classification, Springer;The Classification Society, vol. 9(2), pages 237-256, December.
    18. Ting Pong & Henry Wolkowicz, 2014. "The generalized trust region subproblem," Computational Optimization and Applications, Springer, vol. 58(2), pages 273-322, June.
    19. Yong Xia & Ying-Wei Han, 2014. "Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(2), pages 225-237, April.
    20. van den Burg, G.J.J. & Groenen, P.J.F., 2014. "GenSVM: A Generalized Multiclass Support Vector Machine," Econometric Institute Research Papers EI 2014-33, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    21. Marc C. Robini & Lihui Wang & Yuemin Zhu, 2024. "The appeals of quadratic majorization–minimization," Journal of Global Optimization, Springer, vol. 89(3), pages 509-558, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:153-:d:311733. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.