IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v184y2020i3d10.1007_s10957-019-01612-w.html
   My bibliography  Save this article

Safe Feature Elimination for Non-negativity Constrained Convex Optimization

Author

Listed:
  • James Folberth

    (University of Colorado at Boulder)

  • Stephen Becker

    (University of Colorado at Boulder)

Abstract

Inspired by recent work on safe feature elimination for 1-norm regularized least-squares, we develop strategies to eliminate features from convex optimization problems with non-negativity constraints. Our strategy is safe in the sense that it will only remove features/coordinates from the problem when they are guaranteed to be zero at a solution. To perform feature elimination, we use an accurate, but not optimal, primal–dual feasible pair, making our methods robust and able to be used on ill-conditioned problems. We supplement our feature elimination problem with a method to construct an accurate dual feasible point from an accurate primal feasible point; this allows us to use a first-order method to find an accurate primal feasible point and then use that point to construct an accurate dual feasible point and perform feature elimination. Under reasonable conditions, our feature elimination strategy will eventually eliminate all zero features from the problem. As an application of our methods, we show how safe feature elimination can be used to robustly certify the uniqueness of nonnegative least-squares problems. We give numerical examples on a well-conditioned synthetic nonnegative least-squares problem and on a set of 40,000 extremely ill-conditioned problems arising in a microscopy application.

Suggested Citation

  • James Folberth & Stephen Becker, 2020. "Safe Feature Elimination for Non-negativity Constrained Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 931-952, March.
  • Handle: RePEc:spr:joptap:v:184:y:2020:i:3:d:10.1007_s10957-019-01612-w
    DOI: 10.1007/s10957-019-01612-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01612-w
    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-019-01612-w?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. Gerald L. Thompson & Fred M. Tonge & Stanley Zionts, 1966. "Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems," Management Science, INFORMS, vol. 12(7), pages 588-608, March.
    2. Hui Zhang & Wotao Yin & Lizhi Cheng, 2015. "Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 109-122, January.
    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. Bernard M. S. van Praag & Nico L. van der Sar, 1988. "Household Cost Functions and Equivalence Scales," Journal of Human Resources, University of Wisconsin Press, vol. 23(2), pages 193-210.
    2. Tim Hoheisel & Elliot Paquette, 2023. "Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 252-276, April.
    3. Telgen, Jan, 1977. "Redundant And Non-Binding Constraints In Linear Programming Problems," Econometric Institute Archives 272156, Erasmus University Rotterdam.
    4. Löber, Gerrit & Staat, Matthias, 2010. "Integrating categorical variables in Data Envelopment Analysis models: A simple solution technique," European Journal of Operational Research, Elsevier, vol. 202(3), pages 810-818, May.
    5. Patrick R. Johnstone & Pierre Moulin, 2017. "Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions," Computational Optimization and Applications, Springer, vol. 67(2), pages 259-292, June.
    6. Fan Wu & Wei Bian, 2020. "Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem," Journal of Global Optimization, Springer, vol. 76(4), pages 819-840, April.
    7. Jean Charles Gilbert, 2017. "On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 70-101, January.
    8. Drynan, Ross G., 1987. "A Generalised Concept of Dominance in Linear Programming Models," Review of Marketing and Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 55(02), pages 1-7, August.
    9. Yunier Bello-Cruz & Guoyin Li & Tran Thai An Nghia, 2022. "Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 167-190, July.
    10. Yun-Bin Zhao & Houyuan Jiang & Zhi-Quan Luo, 2019. "Weak Stability of ℓ 1 -Minimization Methods in Sparse Data Reconstruction," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 173-195, February.
    11. Saito, G. & Corley, H.W. & Rosenberger, Jay M. & Sung, Tai-Kuan & Noroziroshan, Alireza, 2015. "Constraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 586-598.
    12. M.A. Goberna & V. Jornet & M. Molina, 2003. "Saturation in Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 117(2), pages 327-348, May.
    13. Abdessamad Barbara & Abderrahim Jourani & Samuel Vaiter, 2019. "Maximal Solutions of Sparse Analysis Regularization," Journal of Optimization Theory and Applications, Springer, vol. 180(2), pages 374-396, February.
    14. van der Hoek, Gerard & Telgen, Jan, 1976. "Projective Methods To Find A Feasible Solution To Systems Of Linear Constraints," Econometric Institute Archives 272134, Erasmus University Rotterdam.
    15. Telgen, J., 1977. "On R.W. Llewellyn'S Rules To Identify Redundant Constraints; A Detailed Critique And Some Generalizations," Econometric Institute Archives 272155, Erasmus University Rotterdam.

    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:184:y:2020:i:3:d:10.1007_s10957-019-01612-w. 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.