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

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

Author

Listed:
  • P. Nataraj
  • M. Arounassalame

Abstract

No abstract is available for this item.

Suggested Citation

  • P. Nataraj & M. Arounassalame, 2011. "Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm," Journal of Global Optimization, Springer, vol. 49(2), pages 185-212, February.
    • Handle: RePEc:spr:jglopt:v:49:y:2011:i:2:p:185-212
    DOI: 10.1007/s10898-009-9485-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9485-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9485-0?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. Li, Han-Lin & Chang, Ching-Ter, 1998. "An approximate approach of global optimization for polynomial programming problems," European Journal of Operational Research, Elsevier, vol. 107(3), pages 625-632, June.
    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. Titi, Jihad & Garloff, Jürgen, 2019. "Matrix methods for the tensorial Bernstein form," Applied Mathematics and Computation, Elsevier, vol. 346(C), pages 254-271.
    2. P. S. Dhabe & P. S. V. Nataraj, 2017. "A parallel Bernstein algorithm for global optimization based on the implicit Bernstein form," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1654-1671, November.
    3. Titi, Jihad & Garloff, Jürgen, 2017. "Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 246-258.
    4. P. S. Dhabe & P. S. V. Nataraj, 2017. "The Bernstein algorithm using the modified implicit Bernstein form and its GPU parallelization using CUDA," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(4), pages 826-841, December.
    5. Priyadarshan Dhabe & P. S. V. Nataraj, 2020. "A GPU parallel Bernstein algorithm for polynomial global optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 21-44, February.
    6. Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.

    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. Chang, Ching-Ter, 2000. "An efficient linearization approach for mixed-integer problems," European Journal of Operational Research, Elsevier, vol. 123(3), pages 652-659, June.
    2. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    3. Li, Han-Lin & Yu, Chian-Son, 1999. "A global optimization method for nonconvex separable programming problems," European Journal of Operational Research, Elsevier, vol. 117(2), pages 275-292, September.
    4. Castro, F. & Gago, J. & Hartillo, I. & Puerto, J. & Ucha, J.M., 2011. "An algebraic approach to integer portfolio problems," European Journal of Operational Research, Elsevier, vol. 210(3), pages 647-659, May.
    5. Tiago Andrade & Fabricio Oliveira & Silvio Hamacher & Andrew Eberhard, 2019. "Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming," Journal of Global Optimization, Springer, vol. 73(4), pages 701-722, April.
    6. Chang, Ching-Ter, 2002. "On the posynomial fractional programming problems," European Journal of Operational Research, Elsevier, vol. 143(1), pages 42-52, November.
    7. Teles, João P. & Castro, Pedro M. & Matos, Henrique A., 2013. "Univariate parameterization for global optimization of mixed-integer polynomial problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 613-625.
    8. Li, Han-Lin & Tsai, Jung-Fa, 2008. "A distributed computation algorithm for solving portfolio problems with integer variables," European Journal of Operational Research, Elsevier, vol. 186(2), pages 882-891, 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:jglopt:v:49:y:2011:i:2:p:185-212. 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.