Previous : H. The solution file format Up: The MOSEK .NET API manual. Version 6.0 (Revision 148). Next: Index The MOSEK .NET API manual.
Version 6.0 (Revision 148).
Previous : H. The solution file format Up : The MOSEK .NET API manual.
Version 6.0 (Revision 148).		 Next : Index Contents Index

Bibliography

[1]
H. P. Williams.
Model building in mathematical programming.
John Wiley and Sons, 1993.
[2]
S. W. Wallace.
Decision making under uncertainty: Is sensitivity of any use.
Oper. Res. 48(1):20--25, January 2000.
[3]
Bernd Scherer.
Portfolio construction and risk budgeting.
Risk Books, 2004.
[4]
A. Ben-Tal and A Nemirovski.
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications.
MPS/SIAM Series on Optimization.
SIAM, 2001.
[5]
E. D. Andersen, J. Gondzio, Cs. Meszaros and X. Xu.
Implementation of interior point methods for large scale linear programming.
In Interior-point methods of mathematical programming.
T. Terlaky, editor(s).Kluwer Academic Publishers,
[6]
E. D. Andersen and Y. Ye.
Combining interior-point and pivoting algorithms.
Management Sci. 42(12):1719--1731, December 1996.
[7]
R. K. Ahuja, T. L. Magnanti and J. B. Orlin.
Network flows.
In Optimization.
G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd, editor(s).North Holland, Amsterdam,
[8]
Erling D. Andersen.
The homogeneous and self-dual model and algorithm for linear optimization.
2009.
http://www.mosek.com/fileadmin/reports/tech/homolo.pdf.
[9]
G. W. Stewart.
Matrix Algorithms. Volume 1: Basic decompositions.
SIAM, 1998.
[10]
E. D. Andersen and K. D. Andersen.
Presolving in linear programming.
Math. Programming 71(2):221--245, 1995.
[11]
F. Alizadeh and D. Goldfarb.
Second-order cone programming.
Math. Programming 95(1):3--51, 2003.
[12]
J. L. Nazareth.
Computer Solution of Linear Programs.
Oxford University Press, New York, 1987.
[13]
M. S. Lobo, M. Fazel, and S. Boyd.
Portfolio optimization with linear and fixed transaction costs.
2005.
To appear in Annals of Operations Research. http://www.cds.caltech.edu/~maryam/portfolio.html.
[14]
C. Roos, T. Terlaky and J. -Ph. Vial.
Theory and algorithms for linear optimization: an interior point approach.
John Wiley and Sons, New York, 1997.
[15]
Richard C. Grinold abd Ronald N. Kahn.
Active portfolio management.
McGraw-Hill, New York, 2000.
[16]
M. S. Bazaraa, H. D. Sherali and C. M. Shetty.
Nonlinear programming: Theory and algorithms.
John Wiley and Sons, New York, 1993.
[17]
L. A. Wolsey.
Integer programming.
John Wiley and Sons, 1998.
[18]
M. S. Lobo, L. Vanderberghe, S. Boyd and H. Lebret.
Applications of second-order cone programming.
Linear Algebra Appl. 284:193-228, November 1998.
[19]
V. Chvatal.
Linear programming.
W.H. Freeman and Company, 1983.
[20]
E. D. Andersen and Y. Ye.
On a homogeneous algorithm for the monotone complementarity problem.
Math. Programming 84(2):375--399, February 1999.
[21]
E. D. Andersen and Y. Ye.
A computational study of the homogeneous algorithm for large-scale convex optimization.
Computational Optimization and Applications 10:243--269, 1998.
[22]
J. L. Kenningon and K. R. Lewis.
Generalized networks: The theory of preprocessing and an emperical analysis.
INFORMS Journal on Computing 16(2):162--173, 2004.
[23]
E. D. Andersen, C. Roos and T. Terlaky.
On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Programming 95(2), February 2003.
[24]
N. Gould and P. L. Toint.
Preprocessing for quadratic programming.
Math. Programming 100(1):95--132, 2004.
Previous : H. The solution file format Up: The MOSEK .NET API manual. Version 6.0 (Revision 148). Next: Index The MOSEK .NET API manual.
Version 6.0 (Revision 148).
Previous : H. The solution file format Up : The MOSEK .NET API manual.
Version 6.0 (Revision 148).		 Next : Index Contents Index
Mon Oct 29 07:16:28 2012