IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v386y2020ics009630032030429x.html
   My bibliography  Save this article

Preconditioning for PDE-constrained optimization with total variation regularization

Author

Listed:
  • Li, Hongyi
  • Wang, Chaojie
  • Zhao, Di

Abstract

The efficient solution of PDE-constrained optimization problems is of great significance in many scientific and engineering applications. The key point of achieving this goal is to solve the linear systems arising from such problems more efficiently by preconditioning. In this paper, we consider preconditioning the linear systems arising from PDE-constrained optimization problems with total variation (TV) regularization. Based on the block structure of the coefficient matrix or its row and column transformed forms, we propose three kinds of new preconditioners by approximating the Schur complements in different ways. We analyze the eigenvalue properties of the preconditioned coefficient matrices and provide the eigenvalue bounds independent of mesh size. We also show the relations of eigenvalue bounds corresponding to different preconditioners. Numerical results illustrate the efficiency of the proposed preconditioners by comparison with other existing methods.

Suggested Citation

  • Li, Hongyi & Wang, Chaojie & Zhao, Di, 2020. "Preconditioning for PDE-constrained optimization with total variation regularization," Applied Mathematics and Computation, Elsevier, vol. 386(C).
  • Handle: RePEc:eee:apmaco:v:386:y:2020:i:c:s009630032030429x
    DOI: 10.1016/j.amc.2020.125470
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032030429X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2020.125470?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. M. Hinze & R. Pinnau, 2007. "Second-Order Approach to Optimal Semiconductor Design," Journal of Optimization Theory and Applications, Springer, vol. 133(2), pages 179-199, May.
    2. Ole Løseth Elvetun & Bjørn Fredrik Nielsen, 2016. "The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization," Computational Optimization and Applications, Springer, vol. 64(3), pages 699-724, July.
    3. Wang, Chaojie & Li, Hongyi & Zhao, Di, 2019. "Improved block preconditioners for linear systems arising from half-quadratic image restoration," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    4. Xiaoliang Song & Bo Chen & Bo Yu, 2018. "An efficient duality-based approach for PDE-constrained sparse optimization," Computational Optimization and Applications, Springer, vol. 69(2), pages 461-500, March.
    5. Li, Hongyi & Qin, Xuyao & Zhao, Di & Chen, Jiaxin & Wang, Pidong, 2018. "An improved empirical mode decomposition method based on the cubic trigonometric B-spline interpolation algorithm," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 406-419.
    6. Georg Stadler, 2009. "Elliptic optimal control problems with L 1 -control cost and applications for the placement of control devices," Computational Optimization and Applications, Springer, vol. 44(2), pages 159-181, November.
    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. D. Hafemeyer & F. Mannel, 2022. "A path-following inexact Newton method for PDE-constrained optimal control in BV," Computational Optimization and Applications, Springer, vol. 82(3), pages 753-794, July.

    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. Chaojie Wang & Jie Chen & Shuen Sun, 2023. "A Matching-Strategy-Inspired Preconditioning for Elliptic Optimal Control Problems," Mathematics, MDPI, vol. 11(12), pages 1-8, June.
    2. D. Hafemeyer & F. Mannel, 2022. "A path-following inexact Newton method for PDE-constrained optimal control in BV," Computational Optimization and Applications, Springer, vol. 82(3), pages 753-794, July.
    3. Michael Hintermüller & Tao Wu, 2014. "A superlinearly convergent R-regularized Newton scheme for variational models with concave sparsity-promoting priors," Computational Optimization and Applications, Springer, vol. 57(1), pages 1-25, January.
    4. Richard C. Barnard & Christian Clason, 2017. "$$L^1$$ L 1 penalization of volumetric dose objectives in optimal control of PDEs," Computational Optimization and Applications, Springer, vol. 67(2), pages 401-419, June.
    5. Francisco Fuica & Felipe Lepe & Enrique Otárola & Daniel Quero, 2023. "An Optimal Control Problem for the Navier–Stokes Equations with Point Sources," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 590-616, February.
    6. Sergio González-Andrade & Sofía López-Ordóñez & Pedro Merino, 2021. "Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids," Computational Optimization and Applications, Springer, vol. 80(3), pages 979-1025, December.
    7. Christian Clason & Karl Kunisch, 2012. "A measure space approach to optimal source placement," Computational Optimization and Applications, Springer, vol. 53(1), pages 155-171, September.
    8. Hu, Gang & Bo, Cuicui & Wei, Guo & Qin, Xinqiang, 2020. "Shape-adjustable generalized Bézier surfaces: Construction and it is geometric continuity conditions," Applied Mathematics and Computation, Elsevier, vol. 378(C).
    9. Ze Shi & Hongyi Li & Di Zhao & Chengwei Pan, 2023. "Research on Relation Classification Tasks Based on Cybersecurity Text," Mathematics, MDPI, vol. 11(12), pages 1-16, June.
    10. Dante Kalise & Karl Kunisch & Zhiping Rao, 2017. "Infinite Horizon Sparse Optimal Control," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 481-517, February.
    11. Mattia Bongini & Massimo Fornasier & Francesco Rossi & Francesco Solombrino, 2017. "Mean-Field Pontryagin Maximum Principle," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 1-38, October.
    12. Pedro Merino, 2019. "A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs," Computational Optimization and Applications, Springer, vol. 74(1), pages 225-258, September.
    13. Daria Ghilli & Karl Kunisch, 2019. "On monotone and primal-dual active set schemes for $$\ell ^p$$ ℓ p -type problems, $$p \in (0,1]$$ p ∈ ( 0 , 1 ]," Computational Optimization and Applications, Springer, vol. 72(1), pages 45-85, January.
    14. Xiaotong Chen & Xiaoliang Song & Zixuan Chen & Lijun Xu, 2023. "A Multilevel Heterogeneous ADMM Algorithm for Elliptic Optimal Control Problems with L 1 -Control Cost," Mathematics, MDPI, vol. 11(3), pages 1-21, January.
    15. Xiaoliang Song & Bo Chen & Bo Yu, 2018. "An efficient duality-based approach for PDE-constrained sparse optimization," Computational Optimization and Applications, Springer, vol. 69(2), pages 461-500, March.
    16. Malte Braack & Martin F. Quaas & Benjamin Tews & Boris Vexler, 2018. "Optimization of Fishing Strategies in Space and Time as a Non-convex Optimal Control Problem," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 950-972, September.
    17. J. C. De Los Reyes & E. Loayza & P. Merino, 2017. "Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization," Computational Optimization and Applications, Springer, vol. 67(2), pages 225-258, June.
    18. Christian Clason & Thi Bich Tram Do & Frank Pörner, 2018. "Error estimates for the approximation of multibang control problems," Computational Optimization and Applications, Springer, vol. 71(3), pages 857-878, December.
    19. Eduardo Casas & Mariano Mateos & Arnd Rösch, 2018. "Improved approximation rates for a parabolic control problem with an objective promoting directional sparsity," Computational Optimization and Applications, Springer, vol. 70(1), pages 239-266, May.
    20. Francesca C. Chittaro & Laura Poggiolini, 2019. "Strong Local Optimality for Generalized L1 Optimal Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 180(1), pages 207-234, January.

    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:eee:apmaco:v:386:y:2020:i:c:s009630032030429x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.