IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v101y1997i1p155-163.html
   My bibliography  Save this article

A new penalty function algorithm for convex quadratic programming

Author

Listed:
  • Ben-Daya, M.
  • Al-Sultan, K. S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ben-Daya, M. & Al-Sultan, K. S., 1997. "A new penalty function algorithm for convex quadratic programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 155-163, August.
    • Handle: RePEc:eee:ejores:v:101:y:1997:i:1:p:155-163
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00138-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Sanjay Mehrotra & Jie Sun, 1990. "An Algorithm for Convex Quadratic Programming That Requires O ( n 3.5 L ) Arithmetic Operations," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 342-363, May.
    2. C. E. Lemke, 1962. "A Method of Solution for Quadratic Programs," Management Science, INFORMS, vol. 8(4), pages 442-453, July.
    3. Klaus Truemper, 1975. "Note on Finite Convergence of Exterior Penalty Functions," Management Science, INFORMS, vol. 21(5), pages 600-606, January.
    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. Gomez, Manuel A., 2005. "A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming," European Journal of Operational Research, Elsevier, vol. 161(3), pages 655-662, March.
    2. Da Tian, 2015. "An exterior point polynomial-time algorithm for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 61(1), pages 51-78, May.

    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. Daxuan Yan & Chunquan Li & Junyun Wu & Jinhua Deng & Zhijun Zhang & Junzhi Yu & Peter X. Liu, 2024. "A Novel Error-Based Adaptive Feedback Zeroing Neural Network for Solving Time-Varying Quadratic Programming Problems," Mathematics, MDPI, vol. 12(13), pages 1-24, July.
    2. Akkeles, Arif A. & Balogh, Laszlo & Illes, Tibor, 2004. "New variants of the criss-cross method for linearly constrained convex quadratic programming," European Journal of Operational Research, Elsevier, vol. 157(1), pages 74-86, August.
    3. Da Tian, 2015. "An exterior point polynomial-time algorithm for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 61(1), pages 51-78, May.
    4. Camila de Lima & Antonio Roberto Balbo & Thiago Pedro Donadon Homem & Helenice de Oliveira Florentino Silva, 2017. "A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 147-164, February.
    5. Néstor Aguilera & Liliana Forzani & Pedro Morin, 2011. "On uniform consistent estimators for convex regression," Journal of Nonparametric Statistics, Taylor & Francis Journals, vol. 23(4), pages 897-908.
    6. Khattree, Ravindra, 1998. "Some practical estimation procedures for variance components," Computational Statistics & Data Analysis, Elsevier, vol. 28(1), pages 1-32, July.
    7. Paul Knottnerus, 2016. "On new variance approximations for linear models with inequality constraints," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 70(1), pages 26-46, February.
    8. Marta García-Bárzana & Ana Belén Ramos-Guajardo & Ana Colubi & Erricos J. Kontoghiorghes, 2020. "Multiple linear regression models for random intervals: a set arithmetic approach," Computational Statistics, Springer, vol. 35(2), pages 755-773, June.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:101:y:1997:i:1:p:155-163. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.