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

An aggregate deformation homotopy method for min-max-min problems with max-min constraints

Author

Listed:
  • Hui-juan Xiong
  • Bo Yu

Abstract

No abstract is available for this item.

Suggested Citation

  • Hui-juan Xiong & Bo Yu, 2010. "An aggregate deformation homotopy method for min-max-min problems with max-min constraints," Computational Optimization and Applications, Springer, vol. 47(3), pages 501-527, November.
  • Handle: RePEc:spr:coopap:v:47:y:2010:i:3:p:501-527
    DOI: 10.1007/s10589-008-9229-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-008-9229-y
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-008-9229-y?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. E. Polak & J. O. Royset, 2003. "Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques," Journal of Optimization Theory and Applications, Springer, vol. 119(3), pages 421-457, December.
    2. Guddat, Jurgen & Vazquez, Francisco Guerra & Nowack, Dieter & Ruckmann, Jan-J., 2006. "A modified standard embedding with jumps in nonlinear optimization," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1185-1206, March.
    3. A. Astorino & M. Gaudioso, 2002. "Polyhedral Separability Through Successive LP," Journal of Optimization Theory and Applications, Springer, vol. 112(2), pages 265-293, 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. Yan-Chao Liang & Gui-Hua Lin, 2012. "Stationarity Conditions and Their Reformulations for Mathematical Programs with Vertical Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 54-70, July.
    2. Li Yang & Bo Yu & YanXi Li, 2015. "A homotopy method based on penalty function for nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 63(1), pages 61-76, September.

    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. 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.
    2. Pedro Duarte Silva, A., 2017. "Optimization approaches to Supervised Classification," European Journal of Operational Research, Elsevier, vol. 261(2), pages 772-788.
    3. Adil Bagirov & Asef Ganjehlou, 2008. "An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 187-206, April.
    4. Annabella Astorino & Antonio Fuduli, 2015. "Support Vector Machine Polyhedral Separability in Semisupervised Learning," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1039-1050, March.
    5. A. Astorino & A. Fuduli & M. Gaudioso, 2010. "DC models for spherical separation," Journal of Global Optimization, Springer, vol. 48(4), pages 657-669, December.
    6. Yan-Chao Liang & Gui-Hua Lin, 2012. "Stationarity Conditions and Their Reformulations for Mathematical Programs with Vertical Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 54-70, July.
    7. Johannes O. Royset, 2016. "Preface," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 713-718, June.
    8. Adil Bagirov & Julien Ugon & Dean Webb & Gurkan Ozturk & Refail Kasimbeyli, 2013. "A novel piecewise linear classifier based on polyhedral conic and max–min separabilities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 3-24, April.
    9. Alfred Auslender & Miguel A. Goberna & Marco A. López, 2009. "Penalty and Smoothing Methods for Convex Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 303-319, May.
    10. Annabella Astorino & Antonio Fuduli & Manlio Gaudioso, 2012. "Margin maximization in spherical separation," Computational Optimization and Applications, Springer, vol. 53(2), pages 301-322, October.
    11. Z. Akbari & R. Yousefpour & M. Reza Peyghami, 2015. "A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 733-754, March.
    12. Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann, 2016. "On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach," Journal of Global Optimization, Springer, vol. 64(1), pages 3-16, January.
    13. Hatim Djelassi & Alexander Mitsos, 2021. "Global Solution of Semi-infinite Programs with Existence Constraints," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 863-881, March.
    14. M. Maleknia & M. Shamsi, 2020. "A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions," Computational Optimization and Applications, Springer, vol. 77(2), pages 379-409, November.
    15. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.
    16. Zhou Sheng & Gonglin Yuan, 2018. "An effective adaptive trust region algorithm for nonsmooth minimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 251-271, September.
    17. Nezam Mahdavi-Amiri & Rohollah Yousefpour, 2012. "An Effective Nonsmooth Optimization Algorithm for Locally Lipschitz Functions," Journal of Optimization Theory and Applications, Springer, vol. 155(1), pages 180-195, October.
    18. Napsu Karmitsa, 2015. "Diagonal Bundle Method for Nonsmooth Sparse Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 889-905, September.
    19. A. Astorino & M. Gaudioso, 2009. "A fixed-center spherical separation algorithm with kernel transformations for classification problems," Computational Management Science, Springer, vol. 6(3), pages 357-372, August.

    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:47:y:2010:i:3:p:501-527. 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.