IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v192y2022i1d10.1007_s10957-021-01954-4.html
   My bibliography  Save this article

An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming

Author

Listed:
  • Spyridon Pougkakiotis

    (University of Edinburgh)

  • Jacek Gondzio

    (University of Edinburgh)

Abstract

In this paper we generalize the Interior Point-Proximal Method of Multipliers (IP-PMM) presented in Pougkakiotis and Gondzio (Comput Optim Appl 78:307–351, 2021. https://doi.org/10.1007/s10589-020-00240-9 ) for the solution of linear positive Semi-Definite Programming (SDP) problems, allowing inexactness in the solution of the associated Newton systems. In particular, we combine an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM) and interpret the algorithm (IP-PMM) as a primal-dual regularized IPM, suitable for solving SDP problems. We apply some iterations of an IPM to each sub-problem of the PMM until a satisfactory solution is found. We then update the PMM parameters, form a new IPM neighbourhood, and repeat this process. Given this framework, we prove polynomial complexity of the algorithm, under mild assumptions, and without requiring exact computations for the Newton directions. We furthermore provide a necessary condition for lack of strong duality, which can be used as a basis for constructing detection mechanisms for identifying pathological cases within IP-PMM.

Suggested Citation

  • Spyridon Pougkakiotis & Jacek Gondzio, 2022. "An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 97-129, January.
    • Handle: RePEc:spr:joptap:v:192:y:2022:i:1:d:10.1007_s10957-021-01954-4
    DOI: 10.1007/s10957-021-01954-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01954-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-021-01954-4?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. Spyridon Pougkakiotis & Jacek Gondzio, 2019. "Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 905-945, June.
    2. R. T. Rockafellar, 1976. "Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 97-116, May.
    3. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    4. Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jacek Gondzio & Spyridon Pougkakiotis & John W. Pearson, 2022. "General-purpose preconditioning for regularized interior point methods," Computational Optimization and Applications, Springer, vol. 83(3), pages 727-757, December.
    2. Sabir, Zulqurnain & Said, Salem Ben & Baleanu, Dumitru, 2022. "Swarming optimization to analyze the fractional derivatives and perturbation factors for the novel singular model," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).

    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. Stefano Cipolla & Jacek Gondzio, 2023. "Proximal Stabilized Interior Point Methods and Low-Frequency-Update Preconditioning Techniques," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1061-1103, June.
    2. Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.
    3. Jacek Gondzio & Spyridon Pougkakiotis & John W. Pearson, 2022. "General-purpose preconditioning for regularized interior point methods," Computational Optimization and Applications, Springer, vol. 83(3), pages 727-757, December.
    4. Li, Xingchen & Xu, Guangcheng & Wu, Jie & Xu, Chengzhen & Zhu, Qingyuan, 2024. "Evaluation of bank efficiency by considering the uncertainty of nonperforming loans," Omega, Elsevier, vol. 126(C).
    5. Christina Büsing & Sigrid Knust & Xuan Thanh Le, 2018. "Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 339-365, December.
    6. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    7. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    8. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    9. Mauricio Romero Sicre, 2020. "On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 991-1019, July.
    10. Chuong, T.D. & Jeyakumar, V., 2017. "Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 381-399.
    11. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    12. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    13. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    14. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    15. Evers, L. & Dollevoet, T.A.B. & Barros, A.I. & Monsuur, H., 2011. "Robust UAV Mission Planning," Econometric Institute Research Papers EI 2011-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Vaughn Gambeta & Roy Kwon, 2020. "Risk Return Trade-Off in Relaxed Risk Parity Portfolio Optimization," JRFM, MDPI, vol. 13(10), pages 1-28, October.
    17. Silvia Berra & Alessandro Torraca & Federico Benvenuto & Sara Sommariva, 2024. "Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 404-427, January.
    18. Jean-Pierre Crouzeix & Abdelhak Hassouni & Eladio Ocaña, 2023. "A Short Note on the Twice Differentiability of the Marginal Function of a Convex Function," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 857-867, August.
    19. J. Behnamian & Z. Gharabaghli, 2023. "Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-35, March.
    20. Mínguez, R. & García-Bertrand, R., 2016. "Robust transmission network expansion planning in energy systems: Improving computational performance," European Journal of Operational Research, Elsevier, vol. 248(1), pages 21-32.

    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:spr:joptap:v:192:y:2022:i:1:d:10.1007_s10957-021-01954-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.