IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v164y2008i1p167-19110.1007-s10479-008-0401-7.html
   My bibliography  Save this article

A hybrid algorithm for nonlinear minimax problems

Author

Listed:
  • Fusheng Wang
  • Kecun Zhang

Abstract

In this paper, a hybrid algorithm for solving finite minimax problem is presented. In the algorithm, we combine the trust-region methods with the line-search methods and curve-search methods. By means of this hybrid technique, the algorithm, according to the specific situation at each iteration, can adaptively performs the trust-region step, line-search step or curve-search step, so as to avoid possibly solving the trust-region subproblems many times, and make better use of the advantages of different methods. Moreover, we use second-order correction step to circumvent the difficulties of the Maratos effect occurred in the nonsmooth optimization. Under mild conditions, we prove that the new algorithm is of global convergence and locally superlinear convergence. The preliminary experiments show that the new algorithm performs efficiently. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Fusheng Wang & Kecun Zhang, 2008. "A hybrid algorithm for nonlinear minimax problems," Annals of Operations Research, Springer, vol. 164(1), pages 167-191, November.
    • Handle: RePEc:spr:annopr:v:164:y:2008:i:1:p:167-191:10.1007/s10479-008-0401-7
    DOI: 10.1007/s10479-008-0401-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0401-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0401-7?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. J. B. Jian, 2006. "New Sequential Quadratically-Constrained Quadratic Programming Method of Feasible Directions and Its Convergence Rate," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 109-130, April.
    2. Xing-Si Li & Shu-Cherng Fang, 1997. "On the entropic regularization method for solving min-max problems with applications," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 46(1), pages 119-130, February.
    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. Fusheng Wang, 2013. "A hybrid algorithm for linearly constrained minimax problems," Annals of Operations Research, Springer, vol. 206(1), pages 501-525, July.
    2. Jin-bao Jian & Xing-de Mo & Li-juan Qiu & Su-ming Yang & Fu-sheng Wang, 2014. "Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(1), pages 158-188, January.

    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. Birbil, S.I. & Fang, S-C. & Han, J., 2002. "Entropic Regularization Approach for Mathematical Programs with Equilibrium Constraints," ERIM Report Series Research in Management ERS-2002-71-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Alidaee, Bahram, 2014. "Zero duality gap in surrogate constraint optimization: A concise review of models," European Journal of Operational Research, Elsevier, vol. 232(2), pages 241-248.
    3. Jin-bao Jian & Xing-de Mo & Li-juan Qiu & Su-ming Yang & Fu-sheng Wang, 2014. "Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(1), pages 158-188, January.
    4. Mohammad Ali Abooshahab & Mohsen Ekramian & Mohammad Ataei & Ali Ebrahimpour-Boroojeny, 2019. "Time-Delay Estimation in State and Output Equations of Nonlinear Systems Using Optimal Computational Approach," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 1036-1064, March.
    5. Birbil, S.I. & Fang, S-C. & Han, J., 2002. "Entropic regularization approach for mathematical programs with equilibrium constraints," Econometric Institute Research Papers EI 2002-52, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Jian, Jin-Bao & Pan, Hua-Qin & Tang, Chun-Ming & Li, Jian-Ling, 2015. "A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 560-578.
    7. Li, Jianling & Yang, Zhenping, 2018. "A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 52-72.
    8. Tang, Chun-ming & Jian, Jin-bao, 2012. "Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions," European Journal of Operational Research, Elsevier, vol. 218(1), pages 28-37.
    9. Xide Zhu & Peijun Guo, 2017. "Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 255-275, October.
    10. Jian, Jin-Bao & Tang, Chun-Ming & Zheng, Hai-Yan, 2010. "Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 645-657, February.
    11. Helene Krieg & Tobias Seidel & Jan Schwientek & Karl-Heinz Küfer, 2022. "Solving continuous set covering problems by means of semi-infinite optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 39-82, August.
    12. R. L. Sheu & S. Y. Wu, 1999. "Combined Entropic Regularization and Path-Following Method for Solving Finite Convex Min-max Problems Subject to Infinitely Many Linear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 101(1), pages 167-190, April.

    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:annopr:v:164:y:2008:i:1:p:167-191:10.1007/s10479-008-0401-7. 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.