IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v46y2010i1p147-154.html
   My bibliography  Save this article

Convex relaxation for solving posynomial programs

Author

Listed:
  • Hao-Chun Lu
  • Han-Lin Li
  • Chrysanthos Gounaris
  • Christodoulos Floudas

Abstract

No abstract is available for this item.

Suggested Citation

  • Hao-Chun Lu & Han-Lin Li & Chrysanthos Gounaris & Christodoulos Floudas, 2010. "Convex relaxation for solving posynomial programs," Journal of Global Optimization, Springer, vol. 46(1), pages 147-154, January.
    • Handle: RePEc:spr:jglopt:v:46:y:2010:i:1:p:147-154
    DOI: 10.1007/s10898-009-9414-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9414-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9414-2?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. S. Caratzoulas & C. A. Floudas, 2005. "Trigonometric Convex Underestimator for the Base Functions in Fourier Space," Journal of Optimization Theory and Applications, Springer, vol. 124(2), pages 339-362, 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. Lu, Hao-Chun, 2020. "Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    2. Consiglio, Andrea & Carollo, Angelo & Zenios, Stavros A., 2014. "Generating Multi-factor Arbitrage-Free Scenario Trees with Global Optimization," Working Papers 13-35, University of Pennsylvania, Wharton School, Weiss Center.
    3. Jung-Fa Tsai & Ming-Hua Lin, 2011. "An Efficient Global Approach for Posynomial Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 483-492, August.
    4. Hao-Chun Lu & Liming Yao, 2019. "Efficient Convexification Strategy for Generalized Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 226-234, April.
    5. Lin, Ming-Hua & Tsai, Jung-Fa, 2012. "Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 216(1), pages 17-25.
    6. Hao-Chun Lu, 2017. "Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms," Journal of Global Optimization, Springer, vol. 68(1), pages 95-123, May.
    7. O’Brien, Thomas & Reeb, Tyler, 2016. "Freight Efficiency Strategies: Operational Modernization at Distribution Nodes," Institute of Transportation Studies, Working Paper Series qt4fg9f0gv, Institute of Transportation Studies, UC Davis.
    8. Carlos J. Nohra & Nikolaos V. Sahinidis, 2018. "Global optimization of nonconvex problems with convex-transformable intermediates," Journal of Global Optimization, Springer, vol. 72(2), pages 255-276, October.

    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. Hao-Chun Lu & Liming Yao, 2019. "Efficient Convexification Strategy for Generalized Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 226-234, April.
    2. Jung-Fa Tsai & Ming-Hua Lin, 2011. "An Efficient Global Approach for Posynomial Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 483-492, 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:jglopt:v:46:y:2010:i:1:p:147-154. 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.