IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v185y2020i3d10.1007_s10957-020-01680-3.html
   My bibliography  Save this article

An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles

Author

Listed:
  • Deyi Liu

    (The University of North Carolina at Chapel Hill)

  • Quoc Tran-Dinh

    (The University of North Carolina at Chapel Hill)

Abstract

We combine the Lagrangian dual decomposition, barrier smoothing, path-following, and proximal Newton techniques to develop a new inexact interior-point Lagrangian decomposition method to solve a broad class of constrained composite convex optimization problems. Our method allows one to approximately solve the primal subproblems (called the slave problems), which leads to inexact oracles (i.e., inexact function value, gradient, and Hessian) of the smoothed dual problem (called the master problem). By appropriately controlling the inexact computation in both the slave and master problems, we can still establish a polynomial-time iteration complexity of our algorithm and recover primal solutions. We illustrate the performance of our method through two numerical examples and compare it with existing methods.

Suggested Citation

  • Deyi Liu & Quoc Tran-Dinh, 2020. "An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 903-926, June.
    • Handle: RePEc:spr:joptap:v:185:y:2020:i:3:d:10.1007_s10957-020-01680-3
    DOI: 10.1007/s10957-020-01680-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-020-01680-3
    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-020-01680-3?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. Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher, 2018. "A Single-Phase, Proximal Path-Following Framework," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1326-1347, November.
    2. NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. I. Necoara & J. A. K. Suykens, 2009. "Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 567-588, December.
    4. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    5. NESTEROV, Yurii, 2011. "Barrier subgradient method," LIDAM Reprints CORE 2359, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Qihang Lin & Runchao Ma & Yangyang Xu, 2022. "Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 175-224, May.
    2. Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher, 2018. "A Single-Phase, Proximal Path-Following Framework," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1326-1347, November.
    3. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    4. Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
    5. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    6. de Queiroz, Anderson Rodrigo, 2016. "Stochastic hydro-thermal scheduling optimization: An overview," Renewable and Sustainable Energy Reviews, Elsevier, vol. 62(C), pages 382-395.
    7. Sandeep Rath & Kumar Rajaram, 2022. "Staff Planning for Hospitals with Implicit Cost Estimation and Stochastic Optimization," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1271-1289, March.
    8. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    9. Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
    10. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    11. Guigues, Vincent & Juditsky, Anatoli & Nemirovski, Arkadi, 2021. "Constant Depth Decision Rules for multistage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 223-232.
    12. Ketabchi, Saeed & Behboodi-Kahoo, Malihe, 2015. "Augmented Lagrangian method within L-shaped method for stochastic linear programs," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 12-20.
    13. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    14. Zhaosong Lu & Xiaojun Chen, 2018. "Generalized Conjugate Gradient Methods for ℓ 1 Regularized Convex Quadratic Programming with Finite Convergence," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 275-303, February.
    15. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    16. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    18. Alejandra Tabares & Pablo Cortés, 2024. "Using Stochastic Dual Dynamic Programming to Solve the Multi-Stage Energy Management Problem in Microgrids," Energies, MDPI, vol. 17(11), pages 1-24, May.
    19. LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," LIDAM Discussion Papers CORE 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.

    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:185:y:2020:i:3:d:10.1007_s10957-020-01680-3. 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.