Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
  1. Home
  2. Publications
  3. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

Author:
  • LALe Thi Hoai An
    Le Thi Hoai An

Publisher website
Google Scholar
  • 1 May 2000
    • journal article
    • Published by Springer Nature in Mathematical Programming
    • Vol. 87  (3) , 401-426
    • DOI:10.1007/s101070050003
Abstract
No abstract available
Keywords
  • KEY WORDS: D.C. OPTIMIZATION – DCA – BRANCH AND BOUND – COMBINED DCA-BRANCH AND BOUND – PROJECTION SUBGRADIENT METHOD – DUAL METHOD – LAGRANGIAN DUALITY – PROXIMAL POINT ALGORITHM
Cited by 77 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.