default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Best
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j16]Michael J. Best, Xili Zhang
:
Degeneracy Resolution for Bilinear Utility Functions. J. Optim. Theory Appl. 150(3): 615-634 (2011)
2000 – 2009
- 2008
- [j15]Michael J. Best, Jaroslava Hlouskova:
Quadratic programming with transaction costs. Comput. Oper. Res. 35(1): 18-33 (2008) - 2005
- [j14]Michael J. Best, Jaroslava Hlouskova:
An Algorithm for Portfolio Optimization with Transaction Costs. Manag. Sci. 51(11): 1676-1688 (2005) - 2003
- [j13]Michael J. Best, Jaroslava Hlouskova:
Portfolio Selection and Transactions Costs. Comput. Optim. Appl. 24(1): 95-116 (2003) - 2000
- [j12]Michael J. Best, Baoyan Ding:
A Decomposition Method for Global and Local Quadratic Minimization. J. Glob. Optim. 16(2): 133-151 (2000) - [j11]Michael J. Best, Jaroslava Hlouskova:
The efficient frontier for bounded assets. Math. Methods Oper. Res. 52(2): 195-212 (2000) - [j10]Michael J. Best, Nilotpal Chakravarti, Vasant A. Ubhaya:
Minimizing Separable Convex Functions Subject to Simple Chain Constraints. SIAM J. Optim. 10(3): 658-672 (2000)
1990 – 1999
- 1997
- [j9]Michael J. Best, Baoyan Ding:
Global and Local Quadratic Minimization. J. Glob. Optim. 10(1): 77-90 (1997) - 1990
- [j8]Michael J. Best, Nilotpal Chakravarti:
Active Set Algorithms for Isotonic Regression; A Unifying Framework. Math. Program. 47: 425-439 (1990)
1980 – 1989
- 1988
- [j7]Michael J. Best, Klaus Ritter:
A quadratic programming algorithm. ZOR Methods Model. Oper. Res. 32(5): 271-297 (1988) - 1985
- [b1]Michael J. Best, Klaus Ritter:
Linear Programming: Active Set Analysis and Computer Programs. Prentice-Hall 1985, ISBN 0-13-536996-7 - 1984
- [j6]Michael J. Best:
Equivalence of some quadratic programming algorithms. Math. Program. 30(1): 71-87 (1984) - 1983
- [j5]Michael J. Best, Richard J. Caron:
A method to increase the computational efficiency of certain quadratic programming algorithms. Math. Program. 25(3): 354-358 (1983) - 1981
- [j4]Michael J. Best, Jürgen Bräuninger, Klaus Ritter, Stephen M. Robinson:
A globally and quadratically convergent algorithm for general nonlinear programming problems. Computing 26(2): 141-153 (1981)
1970 – 1979
- 1978
- [j3]Michael J. Best:
A quasi-Newton method can be obtained from a method of conjugate directions. Math. Program. 15(1): 189-199 (1978) - 1975
- [j2]Michael J. Best, Klaus Ritter:
An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems. J. Comput. Syst. Sci. 11(3): 295-322 (1975) - [j1]Michael J. Best:
A method to accelerate the rate of convergence of a class of optimization algorithms. Math. Program. 9(1): 139-160 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
