IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v192y2022i1d10.1007_s10957-021-01961-5.html
   My bibliography  Save this article

Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency

Author

Listed:
  • Naoki Hamada

    (KLab Inc.
    The RIKEN Center for Advanced Intelligence Project)

  • Shunsuke Ichiki

    (Tokyo Institute of Technology)

Abstract

In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the original problem. Thus, it is crucial to understand what condition ensures that all weakly efficient solutions are efficient. In this paper, we give a condition to verify when efficiency coincides with weak efficiency, provided that the free disposal hull of a given set is convex. By using this characterization, we obtain various applications to multi-objective optimization problems under some convex conditions. We also apply the main theorem to the least absolute shrinkage and selection operator (LASSO) and show that for a multi-objective version of LASSO, all weakly efficient solutions are efficient. Numerical simulation demonstrates that this equivalence is helpful to accelerate the hyper-parameter search for LASSO.

Suggested Citation

  • Naoki Hamada & Shunsuke Ichiki, 2022. "Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 248-270, January.
    • Handle: RePEc:spr:joptap:v:192:y:2022:i:1:d:10.1007_s10957-021-01961-5
    DOI: 10.1007/s10957-021-01961-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01961-5
    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-021-01961-5?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. T. J. Lowe & J.-F. Thisse & J. E. Ward & R. E. Wendell, 1984. "On Efficient Solutions to Multiple Objective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1346-1349, November.
    2. James Ward, 1989. "Structure of Efficient Sets for Convex Objectives," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 249-257, May.
    3. Matthias Ehrgott & Stefan Nickel, 2002. "On the number of criteria needed to decide Pareto optimality," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 55(3), pages 329-345, June.
    4. Matthias Ehrgott & Stefan Nickel, 2002. "On the number of criteria needed to decide Pareto optimality," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(3), pages 329-345, June.
    5. Robert Tibshirani & Michael Saunders & Saharon Rosset & Ji Zhu & Keith Knight, 2005. "Sparsity and smoothness via the fused lasso," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(1), pages 91-108, February.
    6. Hui Zou & Trevor Hastie, 2005. "Addendum: Regularization and variable selection via the elastic net," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(5), pages 768-768, November.
    7. Hui Zou & Trevor Hastie, 2005. "Regularization and variable selection via the elastic net," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(2), pages 301-320, April.
    8. Ming Yuan & Yi Lin, 2006. "Model selection and estimation in regression with grouped variables," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 68(1), pages 49-67, February.
    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. Tutz, Gerhard & Pößnecker, Wolfgang & Uhlmann, Lorenz, 2015. "Variable selection in general multinomial logit models," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 207-222.
    2. Tomáš Plíhal, 2021. "Scheduled macroeconomic news announcements and Forex volatility forecasting," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 40(8), pages 1379-1397, December.
    3. Loann David Denis Desboulets, 2018. "A Review on Variable Selection in Regression Analysis," Econometrics, MDPI, vol. 6(4), pages 1-27, November.
    4. Victor Chernozhukov & Christian Hansen & Yuan Liao, 2015. "A lava attack on the recovery of sums of dense and sparse signals," CeMMAP working papers CWP56/15, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    5. Takumi Saegusa & Tianzhou Ma & Gang Li & Ying Qing Chen & Mei-Ling Ting Lee, 2020. "Variable Selection in Threshold Regression Model with Applications to HIV Drug Adherence Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 12(3), pages 376-398, December.
    6. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    7. Pei Wang & Shunjie Chen & Sijia Yang, 2022. "Recent Advances on Penalized Regression Models for Biological Data," Mathematics, MDPI, vol. 10(19), pages 1-24, October.
    8. Korobilis, Dimitris, 2013. "Hierarchical shrinkage priors for dynamic regressions with many predictors," International Journal of Forecasting, Elsevier, vol. 29(1), pages 43-59.
    9. Xiaoping Liu & Xiao-Bai Li & Sumit Sarkar, 2023. "Cost-Restricted Feature Selection for Data Acquisition," Management Science, INFORMS, vol. 69(7), pages 3976-3992, July.
    10. Minh Pham & Xiaodong Lin & Andrzej Ruszczyński & Yu Du, 2021. "An outer–inner linearization method for non-convex and nondifferentiable composite regularization problems," Journal of Global Optimization, Springer, vol. 81(1), pages 179-202, September.
    11. Siwei Xia & Yuehan Yang & Hu Yang, 2022. "Sparse Laplacian Shrinkage with the Graphical Lasso Estimator for Regression Problems," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 255-277, March.
    12. Kwon, Sunghoon & Oh, Seungyoung & Lee, Youngjo, 2016. "The use of random-effect models for high-dimensional variable selection problems," Computational Statistics & Data Analysis, Elsevier, vol. 103(C), pages 401-412.
    13. Ismail Shah & Hina Naz & Sajid Ali & Amani Almohaimeed & Showkat Ahmad Lone, 2023. "A New Quantile-Based Approach for LASSO Estimation," Mathematics, MDPI, vol. 11(6), pages 1-13, March.
    14. Sunkyung Kim & Wei Pan & Xiaotong Shen, 2013. "Network-Based Penalized Regression With Application to Genomic Data," Biometrics, The International Biometric Society, vol. 69(3), pages 582-593, September.
    15. Howard D. Bondell & Brian J. Reich, 2009. "Simultaneous Factor Selection and Collapsing Levels in ANOVA," Biometrics, The International Biometric Society, vol. 65(1), pages 169-177, March.
    16. Baragatti, M. & Pommeret, D., 2012. "A study of variable selection using g-prior distribution with ridge parameter," Computational Statistics & Data Analysis, Elsevier, vol. 56(6), pages 1920-1934.
    17. Chen, Shunjie & Yang, Sijia & Wang, Pei & Xue, Liugen, 2023. "Two-stage penalized algorithms via integrating prior information improve gene selection from omics data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 628(C).
    18. Howard D. Bondell & Brian J. Reich, 2012. "Consistent High-Dimensional Bayesian Variable Selection via Penalized Credible Regions," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 107(500), pages 1610-1624, December.
    19. Lee, Kyu Ha & Chakraborty, Sounak & Sun, Jianguo, 2017. "Variable selection for high-dimensional genomic data with censored outcomes using group lasso prior," Computational Statistics & Data Analysis, Elsevier, vol. 112(C), pages 1-13.
    20. Audrino, Francesco & Tetereva, Anastasija, 2019. "Sentiment spillover effects for US and European companies," Journal of Banking & Finance, Elsevier, vol. 106(C), pages 542-567.

    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:192:y:2022:i:1:d:10.1007_s10957-021-01961-5. 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.