IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v33y2016i04ns0217595916500251.html
   My bibliography  Save this article

A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem

Author

Listed:
  • Jia Wu

    (Institute of Operations Research and Control Theory, School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

  • Yi Zhang

    (Department of Mathematics, School of Science, East China University of Science and Technology, Shanghai 200237, P. R. China)

  • Liwei Zhang

    (Institute of Operations Research and Control Theory, School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

  • Yue Lu

    (School of Mathematical Sciences, Tianjin Normal University, Tianjin 300387, P. R. China)

Abstract

This paper is devoted to the study of solving method for a type of inverse linear semidefinite programming problem in which both the objective parameter and the right-hand side parameter of the linear semidefinite programs are required to adjust. Since such kind of inverse problem is equivalent to a mathematical program with semidefinite cone complementarity constraints which is a rather difficult problem, we reformulate it as a nonconvex semi-definte programming problem by introducing a nonsmooth partial penalty function to penalize the complementarity constraint. The penalized problem is actually a nonsmooth DC programming problem which can be solved by a sequential convex program approach. Convergence analysis of the penalty models and the sequential convex program approach are shown. Numerical results are reported to demonstrate the efficiency of our approach.

Suggested Citation

  • Jia Wu & Yi Zhang & Liwei Zhang & Yue Lu, 2016. "A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-26, August.
    • Handle: RePEc:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500251
    DOI: 10.1142/S0217595916500251
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595916500251
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595916500251?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ravindra K. Ahuja & James B. Orlin, 2001. "Inverse Optimization," Operations Research, INFORMS, vol. 49(5), pages 771-783, October.
    2. Jianzhong Zhang & Zhongfan Ma, 1999. "Solution Structure of Some Inverse Combinatorial Optimization Problems," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 127-139, July.
    3. Jong-Shi Pang & Defeng Sun & Jie Sun, 2003. "Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 39-63, February.
    4. David G. Luenberger & Yinyu Ye, 2008. "Linear and Nonlinear Programming," International Series in Operations Research and Management Science, Springer, edition 0, number 978-0-387-74503-9, December.
    5. Burkard, Rainer E. & Lin, Yixun & Zhang, Jianzhong, 2004. "Weight reduction problems with certain bottleneck objectives," European Journal of Operational Research, Elsevier, vol. 153(1), pages 191-199, February.
    6. L. Jeff Hong & Yi Yang & Liwei Zhang, 2011. "Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach," Operations Research, INFORMS, vol. 59(3), pages 617-630, June.
    7. Defeng Sun, 2006. "The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 761-776, November.
    8. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, 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. Jianzhong Zhang & Liwei Zhang & Xiantao Xiao, 2010. "A Perturbation approach for an inverse quadratic programming problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 379-404, December.
    2. Yi Zhang & Liwei Zhang & Yue Wu, 2014. "The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 45-79, April.
    3. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    4. Gassner, Elisabeth, 2009. "Up- and downgrading the 1-center in a network," European Journal of Operational Research, Elsevier, vol. 198(2), pages 370-377, October.
    5. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    6. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    7. Zeynep Erkin & Matthew D. Bailey & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2010. "Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach," Decision Analysis, INFORMS, vol. 7(4), pages 358-365, December.
    8. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    9. Vincent Mousseau & Özgür Özpeynirci & Selin Özpeynirci, 2018. "Inverse multiple criteria sorting problem," Annals of Operations Research, Springer, vol. 267(1), pages 379-412, August.
    10. T. R. Wang & N. Pedroni & E. Zio & V. Mousseau, 2020. "Identification of Protective Actions to Reduce the Vulnerability of Safety‐Critical Systems to Malevolent Intentional Acts: An Optimization‐Based Decision‐Making Approach," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 565-587, March.
    11. Chen, Lu & Chen, Yuyi & Langevin, André, 2021. "An inverse optimization approach for a capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1087-1098.
    12. Mintz, Yonatan & Aswani, Anil & Kaminsky, Philip & Flowers, Elena & Fukuoka, Yoshimi, 2023. "Behavioral analytics for myopic agents," European Journal of Operational Research, Elsevier, vol. 310(2), pages 793-811.
    13. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    14. András Kovács, 2021. "Inverse optimization approach to the identification of electricity consumer models," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 521-537, June.
    15. Hughes, Michael S. & Lunday, Brian J., 2022. "The Weapon Target Assignment Problem: Rational Inference of Adversary Target Utility Valuations from Observed Solutions," Omega, Elsevier, vol. 107(C).
    16. Yun Wang & Liwei Zhang, 2009. "Properties of equation reformulation of the Karush–Kuhn–Tucker condition for nonlinear second order cone optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 195-218, October.
    17. Jonathan Yu-Meng Li, 2021. "Inverse Optimization of Convex Risk Functions," Management Science, INFORMS, vol. 67(11), pages 7113-7141, November.
    18. Aswani, Anil & Kaminsky, Philip & Mintz, Yonatan & Flowers, Elena & Fukuoka, Yoshimi, 2019. "Behavioral modeling in weight loss interventions," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1058-1072.
    19. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.
    20. Mikael Rönnqvist & Gunnar Svenson & Patrik Flisberg & Lars-Erik Jönsson, 2017. "Calibrated Route Finder: Improving the Safety, Environmental Consciousness, and Cost Effectiveness of Truck Routing in Sweden," Interfaces, INFORMS, vol. 47(5), pages 372-395, October.

    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:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500251. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.