Math. Program. - researchr journal

253	--	264	Masao Fukushima. A successive quadratic programming algorithm with global and superlinear convergence properties
265	--	278	M. J. D. Powell, Ya-Xiang Yuan. A recursive quadratic programming algorithm that uses differentiable exact penalty functions
279	--	297	Suvrajeet Sen, Hanif D. Sherali. A class of convergent primal-dual subgradient algorithms for decomposable convex programs
298	--	308	Satoru Fujishige. A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
309	--	333	Andrzej Ruszczynski. A regularized decomposition method for minimizing a sum of polyhedral functions
334	--	361	Rafael Lazimy. Solving multiple criteria problems by interactive decomposition
362	--	364	Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs. On the average length of lexicographic paths
365	--	367	Nimrod Megiddo. A note on degeneracy in linear programming
368	--	371	Sanjo Zlobec. Characterizing an optimal input in perturbed convex programming: Corrigendum

129	--	134	Sancho E. Berenguer, Robert L. Smith. The expected number of extreme points of a random linear program
135	--	139	Charles Blair. Random inequality constraint systems with few variables
140	--	172	Nimrod Megiddo. Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
173	--	192	Michael J. Todd. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
193	--	224	Craig A. Tovey. Low order polynomial bounds on the expected performance of local improvement algorithms
225	--	235	Nimrod Megiddo. On the expected number of linear complementarity cones intersected by random and semi-random rays
236	--	246	Yieh-Hei Wan. On the average speed of Lemke's algorithm for quadratic programming

1	--	2	Michael J. Todd. From the editor
3	--	16	Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid. On linear programs with random costs
17	--	31	John T. Fredricksen, Layne T. Watson, Katta G. Murty. K-matrices in dimensions less than four
32	--	41	Richard H. Byrd, Robert B. Schnabel. Continuity of the null space basis and constrained optimization
42	--	57	Jean-Pierre Crouzeix, Per Olov Lindberg. Additively decomposed quasiconvex functions
58	--	70	Masao Fukushima. A relaxed projection method for variational inequalities
71	--	82	Ekkehard W. Sachs. Broyden's method in Hilbert space
83	--	96	Jonathan M. Borwein, Henry Wolkowicz. A simple constraint qualification in infinite dimensional programming
97	--	109	John L. Nazareth. The method of successive affine reduction for nonlinear minimization
110	--	119	Jacques Guélat, Patrice Marcotte. Some comments on Wolfe's 'away step'

External Links