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

Feasible Method for Generalized Semi-Infinite Programming

Author

Listed:
  • O. Stein

    (Karlsruhe Institute of Technology)

  • A. Winterfeld

    (Fraunhofer Institut für Techno- und Wirtschaftsmathematik)

Abstract

In this paper, we analyze the outer approximation property of the algorithm for generalized semi-infinite programming from Stein and Still (SIAM J. Control Optim. 42:769–788, 2003). A simple bound on the regularization error is found and used to formulate a feasible numerical method for generalized semi-infinite programming with convex lower-level problems. That is, all iterates of the numerical method are feasible points of the original optimization problem. The new method has the same computational cost as the original algorithm from Stein and Still (SIAM J. Control Optim. 42:769–788, 2003). We also discuss the merits of this approach for the adaptive convexification algorithm, a feasible point method for standard semi-infinite programming from Floudas and Stein (SIAM J. Optim. 18:1187–1208, 2007).

Suggested Citation

  • O. Stein & A. Winterfeld, 2010. "Feasible Method for Generalized Semi-Infinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 419-443, August.
    • Handle: RePEc:spr:joptap:v:146:y:2010:i:2:d:10.1007_s10957-010-9674-5
    DOI: 10.1007/s10957-010-9674-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-010-9674-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-010-9674-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. Stein, Oliver & Still, Georg, 2002. "On generalized semi-infinite optimization and bilevel optimization," European Journal of Operational Research, Elsevier, vol. 142(3), pages 444-462, November.
    2. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    3. Oliver Stein, 2006. "A semi-infinite approach to design centering," Springer Optimization and Its Applications, in: Stephan Dempe & Vyacheslav Kalashnikov (ed.), Optimization with Multivalued Mappings, pages 209-228, Springer.
    4. Stephan Dempe & Vyacheslav Kalashnikov (ed.), 2006. "Optimization with Multivalued Mappings," Springer Optimization and Its Applications, Springer, number 978-0-387-34221-4, September.
    5. Gui-Hua Lin & Masao Fukushima, 2005. "A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints," Annals of Operations Research, Springer, vol. 133(1), pages 63-84, January.
    6. William Hogan, 1973. "Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case," Operations Research, INFORMS, vol. 21(1), pages 188-209, 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. Stuart M. Harwood & Paul I. Barton, 2017. "How to solve a design centering problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(1), pages 215-254, August.
    2. Alexander Mitsos & Angelos Tsoukalas, 2015. "Global optimization of generalized semi-infinite programs via restriction of the right hand side," Journal of Global Optimization, Springer, vol. 61(1), pages 1-17, January.
    3. Peter Kirst & Oliver Stein, 2016. "Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1079-1109, June.
    4. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    5. Hatim Djelassi & Alexander Mitsos, 2017. "A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs," Journal of Global Optimization, Springer, vol. 68(2), pages 227-253, June.
    6. M. Diehl & B. Houska & O. Stein & P. Steuermann, 2013. "A lifting method for generalized semi-infinite programs based on lower level Wolfe duality," Computational Optimization and Applications, Springer, vol. 54(1), pages 189-210, January.
    7. Peter Kirst & Oliver Stein, 2019. "Global optimization of generalized semi-infinite programs using disjunctive programming," Journal of Global Optimization, Springer, vol. 73(1), pages 1-25, 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. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    2. Volker Maag, 2015. "A collision detection approach for maximizing the material utilization," Computational Optimization and Applications, Springer, vol. 61(3), pages 761-781, July.
    3. S. Dempe & S. Franke, 2016. "On the solution of convex bilevel optimization problems," Computational Optimization and Applications, Springer, vol. 63(3), pages 685-703, April.
    4. Winterfeld, Anton, 2008. "Application of general semi-infinite programming to lapidary cutting problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 838-854, December.
    5. Giandomenico Mastroeni & Letizia Pellegrini & Alberto Peretti, 2021. "Some numerical aspects on a method for solving linear problems with complementarity constraints," Working Papers 16/2021, University of Verona, Department of Economics.
    6. H. Z. Luo & X. L. Sun & Y. F. Xu, 2010. "Convergence Properties of Modified and Partially-Augmented Lagrangian Methods for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 489-506, June.
    7. Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh, 2023. "On solving difference of convex functions programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 163-197, September.
    8. Meng Xu & Guangmin Wang & Susan Grant-Muller & Ziyou Gao, 2017. "Joint road toll pricing and capacity development in discrete transport network design problem," Transportation, Springer, vol. 44(4), pages 731-752, July.
    9. Suhong Jiang & Jin Zhang & Caihua Chen & Guihua Lin, 2018. "Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 223-236, January.
    10. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2013. "Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 33-64, July.
    11. Hatim Djelassi & Alexander Mitsos, 2017. "A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs," Journal of Global Optimization, Springer, vol. 68(2), pages 227-253, June.
    12. Christian Kanzow & Alexandra Schwartz, 2014. "Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints," Computational Optimization and Applications, Springer, vol. 59(1), pages 249-262, October.
    13. Christian Kanzow & Alexandra Schwartz, 2015. "The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 253-275, February.
    14. Jean-Pierre Dussault & Mounir Haddou & Abdeslam Kadrani & Tangi Migot, 2020. "On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 504-522, August.
    15. Wang, Guangmin & Gao, Ziyou & Xu, Meng & Sun, Huijun, 2014. "Joint link-based credit charging and road capacity improvement in continuous network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 1-14.
    16. Peter Kirst & Oliver Stein, 2016. "Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1079-1109, June.
    17. Gemayqzel Bouza & Georg Still, 2007. "Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 467-483, May.
    18. Hatim Djelassi & Moll Glass & Alexander Mitsos, 2019. "Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints," Journal of Global Optimization, Springer, vol. 75(2), pages 341-392, October.
    19. Na Xu & Xide Zhu & Li-Ping Pang & Jian Lv, 2018. "Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(01), pages 1-20, February.
    20. Zhang, Fang & Lu, Jian & Hu, Xiaojian & Meng, Qiang, 2023. "Integrated deployment of dedicated lane and roadside unit considering uncertain road capacity under the mixed-autonomy traffic environment," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).

    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:146:y:2010:i:2:d:10.1007_s10957-010-9674-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.