Research Article

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

Pages:1–26

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0062

An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods

Pages:27–44

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0073

Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces

Pages:45–63

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0078

On the Sequential Quadratically Constrained Quadratic Programming Methods

Pages:64–79

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0069

Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation

Pages:80–91

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0058

A Long-Range Dependent Workload Model for Packet Data Traffic

Pages:92–105

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0061

Random Walks and Voting Theory

Pages:106–113

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0052

Hamiltonian Cycles and Singularly Perturbed Markov Chains

Pages:114–131

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0066

Quadratic Hedging and Mean-Variance Portfolio Selection with Random Parameters in an Incomplete Market

Pages:132–161

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0065

Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management

Pages:162–181

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0072

The Mean Number-in-System Vector Range for Multiclass Queueing Networks

Pages:182–190

Published Online:February 1, 2004

https://doi.org/10.1287/moor.1030.0067

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.