The educational testing problem revisited

The educational testing problem is a convex non-smooth optimization problem. We recast the problem so that classical non-smooth optimization techniques such as the ellipsoid method can be readily applicable. Attention is paid to Dikin's method where a special barrier function and interior ellipsoids for the feasible domain are explicitly formulated. The implementation is much easier than that by Fletcher. The convergence property is numerically demonstrated

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[3]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[4]  Stephen P. Boyd,et al.  Linear controller design: limits of performance , 1991 .

[5]  R. Fletcher.  A Nonlinear Programming Problem in Statistics (Educational Testing) , 1981 .

[6]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[7]  Takashi Tsuchiya,et al.  A simplified global convergence proof of the affine scaling algorithm , 1993, Ann. Oper. Res..

[8]  R. Rockafellar.  The theory of subgradients and its applications to problems of optimization : convex and nonconvex functions , 1981 .

[9]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[10]  R. Fletcher.  Semi-Definite Matrix Constraints in Optimization , 1985 .

[11]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[12]  M. Todd,et al.  The Ellipsoid Method: A Survey , 1980 .

[13]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[14]  Michael J. Todd,et al.  Polynomial Algorithms for Linear Programming , 1988 .

[15]  Stephen P. Boyd,et al.  Method of centers for minimizing generalized eigenvalues , 1993, Linear Algebra and its Applications.

[16]  F. T. Wright,et al.  Advances in Order Restricted Statistical Inference , 1986 .

[17]  Michael L. Overton,et al.  Large-Scale Optimization of Eigenvalues , 1990, SIAM J. Optim..

[18]  M. Overton.  On minimizing the maximum eigenvalue of a symmetric matrix , 1988 .

[19]  W. Glunt.  An alternating projections method for certain linear problems in a Hilbert space , 1995 .