IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v89y2019i3d10.1007_s00186-019-00660-2.html
   My bibliography  Save this article

The sparsest solution of the union of finite polytopes via its nonconvex relaxation

Author

Listed:
  • Guowei You

    (Henan University of Science and Technology)

  • Zheng-Hai Huang

    (Tianjin University)

  • Yong Wang

    (Tianjin University)

Abstract

Sparse optimization problems have gained much attention since 2004. Many approaches have been developed, where nonconvex relaxation methods have been a hot topic in recent years. In this paper, we study a partially sparse optimization problem, which finds a partially sparsest solution of a union of finite polytopes. We discuss the relationship between its solution set and the solution set of its nonconvex relaxation. In details, by using geometrical properties of polytopes and properties of a family of well-defined nonconvex functions, we show that there exists a positive constant $$p^*\in (0,1]$$ p ∗ ∈ ( 0 , 1 ] such that for every $$p\in [0,p^*)$$ p ∈ [ 0 , p ∗ ) , all optimal solutions to the nonconvex relaxation with the parameter p are also optimal solutions to the original sparse optimization problem. This provides a theoretical basis for solving the underlying problem via its nonconvex relaxation. Moreover, we show that the problem we concerned covers a wide range of problems so that several important sparse optimization problems are its subclasses. Finally, by an example we illustrate our theoretical findings.

Suggested Citation

  • Guowei You & Zheng-Hai Huang & Yong Wang, 2019. "The sparsest solution of the union of finite polytopes via its nonconvex relaxation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 485-507, June.
    • Handle: RePEc:spr:mathme:v:89:y:2019:i:3:d:10.1007_s00186-019-00660-2
    DOI: 10.1007/s00186-019-00660-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-019-00660-2
    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/s00186-019-00660-2?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. G. M. Fung & O. L. Mangasarian, 2011. "Equivalence of Minimal ℓ 0- and ℓ p -Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 1-10, October.
    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. Chan, Felix & Pauwels, Laurent, 2019. "Equivalence of optimal forecast combinations under affine constraints," Working Papers BAWP-2019-02, University of Sydney Business School, Discipline of Business Analytics.
    2. Ziyan Luo & Linxia Qin & Lingchen Kong & Naihua Xiu, 2014. "The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 854-864, March.
    3. Yue Xie & Uday V. Shanbhag, 2021. "Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 43-85, January.
    4. Fassino, Claudia & Torrente, Maria-Laura & Uberti, Pierpaolo, 2022. "A singular value decomposition based approach to handle ill-conditioning in optimization problems with applications to portfolio theory," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).

    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:mathme:v:89:y:2019:i:3:d:10.1007_s00186-019-00660-2. 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.