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

A Multilevel Heterogeneous ADMM Algorithm for Elliptic Optimal Control Problems with L 1 -Control Cost

Author

Listed:
  • Xiaotong Chen

    (School of Science, Dalian Maritime University, Dalian 116026, China)

  • Xiaoliang Song

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

  • Zixuan Chen

    (College of Sciences, Northeastern University, Shenyang 110819, China)

  • Lijun Xu

    (School of Science, Dalian Maritime University, Dalian 116026, China)

Abstract

In this paper, elliptic optimal control problems with L 1 -control cost and box constraints on the control are considered. To numerically solve the optimal control problems, we use the First optimize, then discretize approach. We focus on the inexact alternating direction method of multipliers (iADMM) and employ the standard piecewise linear finite element approach to discretize the subproblems in each iteration. However, in general, solving the subproblems is expensive, especially when the discretization is at a fine level. Motivated by the efficiency of the multigrid method for solving large-scale problems, we combine the multigrid strategy with the iADMM algorithm. Instead of fixing the mesh size before the computation process, we propose the strategy of gradually refining the grid. Moreover, to overcome the difficulty whereby the L 1 -norm does not have a decoupled form, we apply nodal quadrature formulas to approximately discretize the L 1 -norm and L 2 -norm. Based on these strategies, an efficient multilevel heterogeneous ADMM (mhADMM) algorithm is proposed. The total error of the mhADMM consists of two parts: the discretization error resulting from the finite-element discretization and the iteration error resulting from solving the discretized subproblems. Both errors can be regarded as the error of inexactly solving infinite-dimensional subproblems. Thus, the mhADMM can be regarded as the iADMM in function space. Furthermore, theoretical results on the global convergence, as well as the iteration complexity results o ( 1 / k ) for the mhADMM, are given. Numerical results show the efficiency of the mhADMM algorithm.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:570-:d:1043199
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/3/570/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/3/570/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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)

    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. 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.
    2. 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.
    3. Li, Hongyi & Wang, Chaojie & Zhao, Di, 2020. "Preconditioning for PDE-constrained optimization with total variation regularization," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Pierluigi Colli & Andrea Signori & Jürgen Sprekels, 2022. "Optimal Control Problems with Sparsity for Tumor Growth Models Involving Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 25-58, July.
    19. Mariano Mateos, 2021. "Sparse Dirichlet optimal control problems," Computational Optimization and Applications, Springer, vol. 80(1), pages 271-300, September.
    20. Samuel Amstutz & Antoine Laurain, 2013. "A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints," Computational Optimization and Applications, Springer, vol. 56(2), pages 369-403, 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:gam:jmathe:v:11:y:2023:i:3:p:570-:d:1043199. 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.