(Enter summary)
Abstract: 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 readily be applicable. Attention is paid to the 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 in [8]. The
convergence property is numerically demonstrated. (Update)
Active bibliography (related documents): More All
0.5: Dykstra's algorithm with Bregman projections: a convergence.. - Bauschke, Lewis (1998)
(Correct)
0.3: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)
(Correct)
0.3: Semidefinite Programming - Vandenberghe, Boyd (1995)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@article{ chu95educational,
author = "Moody T. Chu and Joel W. Wright",
title = "The educational testing problem revisited",
journal = "IMA Journal of Numerical Analysis",
volume = "15",
number = "1",
pages = "141--160",
year = "1995",
url = "citeseer.ist.psu.edu/757355.html" }
Citations (may not include all citations):
708
Cambridge University Press (context) - Horn, Johnson et al. - 1991
686
Practical Methods of Optimization (context) - Fletcher - 1987
333
Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
307
Interior Point Polynomial Methods in Convex Programming: The.. (context) - Nesterov, Nemirovsky
83
Linear Controller Design: Limits of Performance (context) - Boyd, Barrat - 1990
79
Iterative solution of problems of linear and quadratic progr.. (context) - Dikin - 1967
66
Method of centers for minimizing generalized eigenvalues
- Boyd, Ghaoui - 1992
49
Large-scale optimization of eigenvalues
- Overton - 1992
48
Self-concordant functions and polynomial time methods in con.. (context) - Nesterov, Nemirovsky - 1989
38
The ellipsoid method: A survey (context) - Bland, Goldfarb et al. - 1981
31
The formulation and analysis of numerical methods for invers.. (context) - Friedland, Nocedal et al. - 1987
30
Semi-definite matrix constraints in optimization (context) - Fletcher - 1985
21
The Theory of Subgradients and Its Applications to Problems .. (context) - Rockafellar - 1981
12
Optimization over the positive semi-definite cone: Interior .. (context) - Alizadeh - 1992
11
A simplified global convergence proof of the affine scaling .. (context) - Monteiro, Tsuchiya et al. - 1992
10
A method for finding projections onto the intersection of co.. (context) - Boyle, Dykstra - 1986
10
A nonlinear programming problem in statistics (context) - Fletcher - 1981
9
Cut-off method with space extension in convex programming pr.. (context) - Shor - 1977
2
An alternating projections method for certain linear problem.. (context) - Glunt - 1991
1
USSR Computational Mathematics and Mathematical Physics (context) - Khachiyan, in et al. - 1980
1
On minimizingthe maximum eigenvalue of a symmetric matrix (context) - Overton - 1988
1
Lower bounds for the reliability of a test (context) - Woodhouse - 1976
Documents on the same site (http://www4.ncsu.edu/~mtchu/Research/Papers/Readme.html): More
On The Low-Rank Approximation Of Data On The Unit Sphere - Chu Del Buono
(Correct)
Constructing Symmetric Nonnegative Matrices with Prescribed.. - Chu (1990)
(Correct)
A Study of the Effect of Ties in the k-modes.. - Funderlic, Chu.. (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC