Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
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
Login
Register
Home
Publications
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
Home
Publications
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:
LA
Le Thi Hoai An
Le Thi Hoai An
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
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
Cited by 77 articles
Scroll to top