IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v72y2019i1d10.1007_s10589-018-0036-9.html
   My bibliography  Save this article

On monotone and primal-dual active set schemes for $$\ell ^p$$ ℓ p -type problems, $$p \in (0,1]$$ p ∈ ( 0 , 1 ]

Author

Listed:
  • Daria Ghilli

    (Karl-Franzens-Universität)

  • Karl Kunisch

    (Karl-Franzens-Universität
    Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences)

Abstract

Nonsmooth nonconvex optimization problems involving the $$\ell ^p$$ ℓ p quasi-norm, $$p \in (0, 1]$$ p ∈ ( 0 , 1 ] , of a linear map are considered. A monotonically convergent scheme for a regularized version of the original problem is developed and necessary optimality conditions for the original problem in the form of a complementary system amenable for computation are given. Then an algorithm for solving the above mentioned necessary optimality conditions is proposed. It is based on a combination of the monotone scheme and a primal-dual active set strategy. The performance of the two algorithms is studied by means of a series of numerical tests in different cases, including optimal control problems, fracture mechanics and microscopy image reconstruction.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:72:y:2019:i:1:d:10.1007_s10589-018-0036-9
    DOI: 10.1007/s10589-018-0036-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-018-0036-9
    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/s10589-018-0036-9?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. Xiaojun Chen & Weijun Zhou, 2014. "Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2 –ℓ p minimization," Computational Optimization and Applications, Springer, vol. 59(1), pages 47-61, October.
    2. 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.
    3. 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.
    4. Kristian Bredies & Dirk A. Lorenz & Stefan Reiterer, 2015. "Minimization of Non-smooth, Non-convex Functionals by Iterative Thresholding," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 78-112, April.
    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. Daria Ghilli & Karl Kunisch, 2019. "On a Monotone Scheme for Nonconvex Nonsmooth Optimization with Applications to Fracture Mechanics," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 609-641, November.
    2. 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.
    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. Zhili Ge & Zhongming Wu & Xin Zhang & Qin Ni, 2023. "An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 821-844, August.
    5. 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.
    6. Li, Hongyi & Wang, Chaojie & Zhao, Di, 2020. "Preconditioning for PDE-constrained optimization with total variation regularization," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    7. 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.
    8. Xuerui Gao & Yanqin Bai & Qian Li, 2021. "A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$ L 2 - L p regularization for application of magnetic resonance brain images," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 760-784, November.
    9. Kai Tu & Haibin Zhang & Huan Gao & Junkai Feng, 2020. "A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems," Journal of Global Optimization, Springer, vol. 76(4), pages 665-693, April.
    10. 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.
    11. Peng, Bo & Xu, Hong-Kun, 2020. "Proximal methods for reweighted lQ-regularization of sparse signal recovery," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    12. 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.
    13. Zhaosong Lu & Yong Zhang & Jian Lu, 2017. "$$\ell _p$$ ℓ p Regularized low-rank approximation via iterative reweighted singular value minimization," Computational Optimization and Applications, Springer, vol. 68(3), pages 619-642, December.
    14. 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.
    15. Hao Jiang & Daniel P. Robinson & René Vidal & Chong You, 2018. "A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis," Computational Optimization and Applications, Springer, vol. 70(2), pages 395-418, June.
    16. 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.
    17. 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.
    18. Yun-Bin Zhao & Zhi-Quan Luo, 2017. "Constructing New Weighted ℓ 1 -Algorithms for the Sparsest Points of Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 57-76, January.
    19. 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.
    20. S. M. Mirhadi & S. A. MirHassani, 2022. "A solution approach for cardinality minimization problem based on fractional programming," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 583-602, August.

    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:coopap:v:72:y:2019:i:1:d:10.1007_s10589-018-0036-9. 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.