Data parallel computing for network-structured optimization problems Stavros A. Zenios OriginalPaper Pages: 199 - 242
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities Hiroshi KonnoYasutoshi YajimaAyumi Ban OriginalPaper Pages: 181 - 191
A parameterized Newton method and a quasi-Newton method for nonsmooth equations Xiaojun ChenLiqun Qi OriginalPaper Pages: 157 - 179
Local convergence of interior-point algorithms for degenerate monotone LCP Renato D. C. MonteiroStephen J. Wright OriginalPaper Pages: 131 - 155
Solving binary cutting stock problems by column generation and branch-and-bound Pamela H. VanceCynthia BarnhartGeorge L. Nemhauser OriginalPaper Pages: 111 - 130
Reducing the number of variables in Integer and Linear Programming Problems Djangir A. BabayevSahib S. Mardanov OriginalPaper Pages: 99 - 109
A modified predictor-corrector method for linear programming Zhi-Quan LuoShiquan Wu OriginalPaper Pages: 83 - 91
A regularized stochastic decomposition algorithm for two-stage stochastic linear programs Diana S. Yakowitz OriginalPaper Pages: 59 - 81
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking Aubrey B. Poore OriginalPaper Pages: 27 - 57
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm Jeffery L. KenningtonFarin Mohammadi OriginalPaper Pages: 7 - 26
Numerical approximations and regularizations of Riccati equations arising in hyperbolic dynamics with unbounded control operators Erik HendricksonIrena Lasiecka OriginalPaper Pages: 343 - 390
On the calculation of minimum variance estimators for unobservable dependent variables I. D. Coope OriginalPaper Pages: 337 - 341
Parallel primal-dual methods for the minimum cost flow problem Dimitri P. BertsekasDavid A. Castañon OriginalPaper Pages: 317 - 336
The ellipsoid algorithm using parallel cuts Aiping LiaoMichael J. Todd OriginalPaper Pages: 299 - 316
Computational study of a nonhierarchical decomposition algorithm Jayashree ShankarRaphael T. HaftkaLayne T. Watson OriginalPaper Pages: 273 - 293
On the expected optimal value of random assignment problems: Experimental results and open questions P. M. PardalosK. G. Ramakrishnan OriginalPaper Pages: 261 - 271
A generic auction algorithm for the minimum cost network flow problem Dimitri P. BertsekasDavid A. Castañon OriginalPaper Pages: 229 - 259
Bilinear separation of two sets inn-space Kristin P. BennettO. L. Mangasarian OriginalPaper Pages: 207 - 227
Orthogonal and conjugate basis methods for solving equality constrained minimization problems M. C. Bartholomew-BiggsT. T. Nguyen OriginalPaper Pages: 171 - 200
Isotropic effective energy simulated annealing searches for low energy molecular cluster states Thomas ColemanDavid ShallowayZhijun Wu OriginalPaper Pages: 145 - 170
A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix Batool NekooieMichael K. H. Fan OriginalPaper Pages: 107 - 127
The Lagrange-Newton method for nonlinear optimal control problems Walter AltKazimierz Malanowski OriginalPaper Pages: 77 - 100
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm Richard V. HelgasonJeffery L. KenningtonB. Douglas Stewart OriginalPaper Pages: 47 - 75
A weighted least squaes study of robustness in interior point linear programming Alexander L. Hipolito OriginalPaper Pages: 29 - 46
An interior point method for quadratic programs based on conjugate projected gradients Tamra J. CarpenterDavid F. Shanno OriginalPaper Pages: 5 - 28
Hierarchical sets in mathematical programming modeling languages J. J. BisschopC. A. C. Kuip OriginalPaper Pages: 415 - 438
Designing a majorization scheme for the recourse function in two-stage stochastic linear programming José H. Dulá OriginalPaper Pages: 399 - 414
Proximal minimizations with D-functions and the massively parallel solution of linear network programs Soren S. NielsenStavros A. Zenios OriginalPaper Pages: 375 - 398
Application of the dual active set algorithm to quadratic network optimization William W. HagerDonald W. Hearn OriginalPaper Pages: 349 - 373
Automatic differentiation: Reduced gradient and reduced Hessian matrix Herbert Fischer OriginalPaper Pages: 327 - 344
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems Dan ButnariuAbraham Mehrez OriginalPaper Pages: 307 - 326
Generation of disjointly constrained bilinear programming test problems Luis N. VicentePaul H. CalamaiJoaquim J. Júdice OriginalPaper Pages: 299 - 306
A forward/reverse auction algorithm for asymmetric assignment problems Dimitri P. BertsekasDavid A. Castañon OriginalPaper Pages: 277 - 297
Efficient solution of two-stage stochastic linear programs using interior point methods J. R. BirgeD. F. Holmes OriginalPaper Pages: 245 - 276
Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial Hiroshi KonnoTakahito KunoYasutoshi Yajima OriginalPaper Pages: 227 - 239
Primal-dual proximal point algorithm for linearly constrained convex programming problems Satoru IbarakiMasao FukushimaToshihide Ibaraki OriginalPaper Pages: 207 - 226
Modified proximal point algorithm for extended linear-quadratic programming Ciyou Zhu OriginalPaper Pages: 185 - 205
Generating quadratic assignment test problems with known optimal permutations Yong LiPanos M. Pardalos OriginalPaper Pages: 163 - 184
An implementation of a parallel primal-dual interior point method for block-structured linear programs Irvin J. LustigGuangye Li OriginalPaper Pages: 141 - 161
Numerical solution of a nonlinear parabolic control problem by a reduced SQP method F. S. KupferE. W. Sachs OriginalPaper Pages: 113 - 135
Application of the alternating direction method of multipliers to separable convex programming problems Masao Fukushima OriginalPaper Pages: 93 - 111
An inexact NE/SQP method for solving the nonlinear complementarity problem Steven A. GabrielJong-Shi Pang OriginalPaper Pages: 67 - 91
Auction algorithms for network flow problems: A tutorial introduction Dimitri P. Bertsekas EditorialNotes Pages: 7 - 66
