IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v56y2013i1p1-38.html
   My bibliography  Save this article

A derivative-free approximate gradient sampling algorithm for finite minimax problems

Author

Listed:
  • W. Hare
  • J. Nutini

Abstract

In this paper we present a derivative-free optimization algorithm for finite minimax problems. The algorithm calculates an approximate gradient for each of the active functions of the finite max function and uses these to generate an approximate subdifferential. The negative projection of 0 onto this set is used as a descent direction in an Armijo-like line search. We also present a robust version of the algorithm, which uses the ‘almost active’ functions of the finite max function in the calculation of the approximate subdifferential. Convergence results are presented for both algorithms, showing that either f(x k )→−∞ or every cluster point is a Clarke stationary point. Theoretical and numerical results are presented for three specific approximate gradients: the simplex gradient, the centered simplex gradient and the Gupal estimate of the gradient of the Steklov averaged function. A performance comparison is made between the regular and robust algorithms, the three approximate gradients, and a regular and robust stopping condition. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • W. Hare & J. Nutini, 2013. "A derivative-free approximate gradient sampling algorithm for finite minimax problems," Computational Optimization and Applications, Springer, vol. 56(1), pages 1-38, September.
    • Handle: RePEc:spr:coopap:v:56:y:2013:i:1:p:1-38
    DOI: 10.1007/s10589-013-9547-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9547-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9547-6?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. Xiaoqiang Cai & Kok-Lay Teo & Xiaoqi Yang & Xun Yu Zhou, 2000. "Portfolio Optimization Under a Minimax Rule," Management Science, INFORMS, vol. 46(7), pages 957-972, July.
    2. J. V. Burke & A. S. Lewis & M. L. Overton, 2002. "Approximating Subdifferentials by Random Sampling of Gradients," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 567-584, August.
    3. E. Polak & J. O. Royset & R. S. Womersley, 2003. "Algorithms with Adaptive Smoothing for Finite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 119(3), pages 459-484, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jin-bao Jian & Qing-juan Hu & Chun-ming Tang, 2014. "Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 859-883, December.
    2. Chad Davis & Warren Hare, 2013. "Exploiting Known Structures to Approximate Normal Cones," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 665-681, November.
    3. Angelo Ciccazzo & Vittorio Latorre & Giampaolo Liuzzi & Stefano Lucidi & Francesco Rinaldi, 2015. "Derivative-Free Robust Optimization for Circuit Design," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 842-861, March.
    4. W. Hare & C. Sagastizábal & M. Solodov, 2016. "A proximal bundle method for nonsmooth nonconvex functions with inexact information," Computational Optimization and Applications, Springer, vol. 63(1), pages 1-28, January.
    5. M. V. Dolgopolik, 2018. "A convergence analysis of the method of codifferential descent," Computational Optimization and Applications, Springer, vol. 71(3), pages 879-913, December.
    6. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.

    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. E. Y. Pee & J. O. Royset, 2011. "On Solving Large-Scale Finite Minimax Problems Using Exponential Smoothing," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 390-421, February.
    2. Junxiang Li & Mingsong Cheng & Bo Yu & Shuting Zhang, 2015. "Group Update Method for Sparse Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 257-277, July.
    3. Rockafellar, R.T. & Royset, J.O., 2010. "On buffered failure probability in design and optimization of structures," Reliability Engineering and System Safety, Elsevier, vol. 95(5), pages 499-510.
    4. B. Rustem & S. Žaković & P. Parpas, 2008. "Convergence of an Interior Point Algorithm for Continuous Minimax," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 87-103, January.
    5. Huang, Xiaoxia, 2007. "Two new models for portfolio selection with stochastic returns taking fuzzy information," European Journal of Operational Research, Elsevier, vol. 180(1), pages 396-405, July.
    6. Bo Li & Yufei Sun & Kok Lay Teo, 2022. "An analytic solution for multi-period uncertain portfolio selection problem," Fuzzy Optimization and Decision Making, Springer, vol. 21(2), pages 319-333, June.
    7. E. Polak & R. S. Womersley & H. X. Yin, 2008. "An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 138(2), pages 311-328, August.
    8. Jyotirmayee Behera & Pankaj Kumar, 2024. "Implementation of machine learning in $$\ell _{\infty }$$ ℓ ∞ -based sparse Sharpe ratio portfolio optimization: a case study on Indian stock market," Operational Research, Springer, vol. 24(4), pages 1-26, December.
    9. Wei Bian & Xiaojun Chen, 2017. "Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1063-1084, November.
    10. Dmitriy Drusvyatskiy & Alexander D. Ioffe & Adrian S. Lewis, 2015. "Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 328-349, February.
    11. W. L. Hare & A. S. Lewis, 2005. "Estimating Tangent and Normal Cones Without Calculus," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 785-799, November.
    12. P. Kumar & Jyotirmayee Behera & A. K. Bhurjee, 2022. "Solving mean-VaR portfolio selection model with interval-typed random parameter using interval analysis," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 41-77, March.
    13. Esther Mohr & Robert Dochow, 2017. "Risk management strategies for finding universal portfolios," Annals of Operations Research, Springer, vol. 256(1), pages 129-147, September.
    14. Wong, K.C. & Yam, S.C.P. & Zeng, J., 2019. "Mean-risk portfolio management with bankruptcy prohibition," Insurance: Mathematics and Economics, Elsevier, vol. 85(C), pages 153-172.
    15. He, Guang & Huang, Nan-jing, 2014. "A new particle swarm optimization algorithm with an application," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 521-528.
    16. Yu, Mei & Takahashi, Satoru & Inoue, Hiroshi & Wang, Shouyang, 2010. "Dynamic portfolio optimization with risk control for absolute deviation model," European Journal of Operational Research, Elsevier, vol. 201(2), pages 349-364, March.
    17. Giovanni Colombo & Antonio Marigonda & Peter R. Wolenski, 2013. "The Clarke Generalized Gradient for Functions Whose Epigraph Has Positive Reach," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 451-468, August.
    18. Puneet Pasricha & Dharmaraja Selvamuthu & Guglielmo D’Amico & Raimondo Manca, 2020. "Portfolio optimization of credit risky bonds: a semi-Markov process approach," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 6(1), pages 1-14, December.
    19. Walid Bakry & Audil Rashid & Somar Al-Mohamad & Nasser El-Kanj, 2021. "Bitcoin and Portfolio Diversification: A Portfolio Optimization Approach," JRFM, MDPI, vol. 14(7), pages 1-24, June.
    20. Polak, George G. & Rogers, David F. & Sweeney, Dennis J., 2010. "Risk management strategies via minimax portfolio optimization," European Journal of Operational Research, Elsevier, vol. 207(1), pages 409-419, November.

    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:56:y:2013:i:1:p:1-38. 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.