Computing maximum likelihood estimators of convex density functions

SIAM Journal on Scientific Computing

Volumn 19, Issue 2, 1998, Pages 675-694

  Terlaky, T ^a   Vial, J P H ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Convex estimation; Interior point method; Logarithmic barrier method; Maximum likelihood estimation; Primal dual method

Indexed keywords

EID: 0001437979     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595286578     Document Type: Article

References (21)

1. K.M. ANSTREICHER, D. DEN HERTOG, C. ROOS, AND T. TERLAKY, A long step barrier method for convex quadratic programming, Algorithmica, 10 (1993), pp. 365-382.
2. K.M. ANSTREICHER AND J.-P. VIAL, On the convergence of an infeasible primal-dual interior-point method for convex programming, Optim. Methods Software, 3 (1994), pp. 273-283.
3. R.E. BARLOW AND H.D. BRUNK, The isotonic regression problem and its dual, J. Amer. Statist. Assoc., 67 (1972), pp. 140-147.
4. R.L. DYKSTRA, An algorithm for restricted least squares regression, J. Amer. Statist. Assoc., 78 (1983), pp. 837-842.
5. W. FELLER, An Introduction to Probability Theory and Its Applications, Vol. II, John Wiley, New York, 1966.
6. A.V. FIACCO AND G.P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley, New York, 1968.
7. G. GOLUB AND VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
8. P. GROENEBOOM AND G. JONGBLOED, Isotonic Estimation and Rates of Convergence in Wicksell's Problem, Ann. Statist., 23 (1995), pp. 1518-1542.
9. P. GROENEBOOM AND G. JONGBLOED, Maximum Likelihood Estimation of a Convex Decreasing Density, Report, Faculty of Technical Mathematics and Informatics, Delft University of Technology, the Netherlands, 1994.
10. P. GROENEBOOM AND J.A. WELLNER, Information Bounds and Nonparametric Maximum Likelihood Estimation, Birkhäuser, Basel, Switzerland, 1992.
11. M. HAGE, Estimation of Convex Decreasing Densities and Convex Regression Functions, M.Sc. Thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, the Netherlands, 1994.
12. F.R. HAMPFEL, Design, Data and Analysis by Some Friends of Cuthbert Daniel, John Wiley, New York, 1987.
13. D. DEN HERTOG, Interior Point Approach to Linear Quadratic and Convex Programming - Algorithms and Complexity, Kluwer, Dordrecht, the Netherlands, 1994.
14. D. DEN HERTOG, C. ROOS, AND T. TERLAKY, On the classical logarithmic barrier function method for a class of smooth convex programming problems, J. Optim. Theory Appl., 73 (1992), pp. 1-25.
15. G. JONGBLOED, Some Algorithms for Minimizing a Convex Function Over a Closed Convex Cone, Technical report, Faculty of Technical Mathematics and Informatics, Delft University of Technology, the Netherlands, 1995.
16. K.O. KORTANEK, X. XU, AND Y. YE, An infeasible interior-point algorithm for primal and dual geometric programs, Math. Programming, 76 (1997), pp. 155-182.
17. G.P. MCCORMICK, The Superlinear Convergence of a Primal-Dual Algorithm, Technical report GWT/ORT-550/91, Department of Operations Research, George Washington University, Washington, DC, 1991 .
18. Y.E. NESTEROV AND A.S. NEMIROVSKY, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
19. T. ROBERTSON, F.T. WRIGHT, AND R.L. DYKSTRA, Order Restricted Statistical Inference, John Wiley, New York, 1988.
20. J.-PH. VIAL, Computational experience with a primal-dual interior-point method for smooth convex programming, Optim. Methods Software, 3 (1994), pp. 285-316.
21. H. YAMASHITA, A Globally Convergent Primal-Dual Interior-Point Method for Constrained Optimization, Technical report, Mathematical Systems Institute Inc., Tokyo, Japan, 1992.