Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems U. M. Garcia PalomaresO. L. Mangasarian OriginalPaper Pages: 1 - 13
Win probabilities and simple majorities in probabilistic voting situations Peter C. FishburnWilliam V. Gehrlein OriginalPaper Pages: 28 - 41
Some convergence properties of the conjugate gradient method M. J. D. Powell OriginalPaper Pages: 42 - 49
A numerically stable optimization method based on A homogeneous function J. S. KowalikK. G. Ramakrishnan OriginalPaper Pages: 50 - 66
Feasible directions algorithms for optimization problems with equality and inequality constraints D. Q. MayneE. Polak OriginalPaper Pages: 67 - 80
On A characterization of optimality in convex programming A. Ben-IsraelA. Ben-Tal OriginalPaper Pages: 81 - 88
A condensation method for generalized geometric programming M. J. RijckaertX. M. Martens Short Communication Pages: 89 - 93
Maximization of A convex quadratic function under linear constraints Hiroshi Konno OriginalPaper Pages: 117 - 127
Further facet generating procedures for vertex packing polytopes Laurence A. Wolsey Short Communication Pages: 158 - 163
Transversal matroid intersections and related packings David B. Weinberger OriginalPaper Pages: 164 - 176
Mathematics in economics: Achievements, difficulties, perspectives Leonid V. Kantorovich OriginalPaper Pages: 204 - 211
A dual algorithm for the one-machine scheduling problem Marshall L. Fisher OriginalPaper Pages: 229 - 251
Superlinearly convergent variable metric algorithms for general nonlinear programming problems Shih-Ping Han OriginalPaper Pages: 263 - 282