Skip to content
Portal K.UTB
  • ikona jazykČeština
  • ikona přihlášení Login
logo knihovny
  • TBU Catalog
  • e-resources
  • E-THESES
Advanced Search
  • An efficient algorithm for glo...
Toolbar
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link

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

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 87; no. 3; pp. 401 - 426
Main Author Hoai An, Le Thi
Format Journal Article
LanguageEnglish
Published Heidelberg Springer 01.05.2000
Springer Verlag
Subjects
Applied sciences
Computer Science
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Projection method
Branch and bound method
Duality
Proximal point method
Quadratic programming
Lagrangian method
Optimization
Quadratic function
Online AccessGet full text

Cover

Loading…
  • More Information
  • Comments
  • Metadata
More Information
ISSN:0025-5610
1436-4646
DOI:10.1007/s101070050003
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link

Search Options

  • Search History
  • Browse the Catalog
  • Browse Alphabetically
  • New Items

Find More with K.UTB

  • Opening Hours of the Library
  • Suggestion for Book Purchase
  • Interlibrary Loans
  • Printing and binding of the Theses

Do You Need Help?

  • Search Tips
  • FAQs
  • Feedback
  • Contacts
logo knihovny

Declaration of Accessibility | Cookies

Knihovna UTB ve Zlíně © 2025