467 | -- | 487 | Svatopluk Poljak, Franz Rendl. Nonpolyhedral Relaxations of Graph-Bisection Problems |
488 | -- | 505 | Bennett L. Fox. Faster Simulated Annealing |
506 | -- | 524 | James Renegar. Incorporating Condition Measures into the Complexity Theory of Linear Programming |
525 | -- | 551 | Takashi Tsuchiya, Masakazu Muramatsu. Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems |
552 | -- | 569 | Alexander Shapiro, Michael K. H. Fan. On Eigenvalue Optimization |
570 | -- | 589 | Mike McKenna, Jill P. Mesirov, Stavros A. Zenios. Data Parallel Quadratic Programming on Box-Constrained Problems |
590 | -- | 640 | Walter Murray, Francisco J. Prieto. A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem |
641 | -- | 658 | Günther Gramlich, Rainer Hettich, Ekkehard W. Sachs. Local Convergence of SQP Methods in Semi-Infinite Programming |
659 | -- | 669 | Dinh The Luc. k, 1 Functions |
670 | -- | 680 | Jay S. Treiman. The Linear Nonconvex Generalized Gradient and Lagrange Multipliers |
681 | -- | 694 | Roland Glowinski, Anthony J. Kearsley. On the Simulation and Control of Some Friction Constrained Motions |