Volume 77,
1997
- Eithan Schweitzer, Mordecai Avriel:
A Gaussian upper bound for Gaussian multi-stage stochastic linear programs.
1-21
- Phan Thien Thach, Hiroshi Konno:
On the degree and separability of nonconvexity and applications to optimization problems.
23-47
- Robert Weismantel:
On the 0/1 knapsack polytope.
49-68
- Philippe L. Toint:
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints.
69-94
- Michael L. Overton, Henry Wolkowicz:
Semidefinite Programming.
105-109
- Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Complementarity and nondegeneracy in semidefinite programming.
111-128
- Motakuri V. Ramana:
An exact duality theory for semidefinite programming and its complexity implications.
129-162
- Pascal Gahinet, Arkadi Nemirovski:
The Projective Method for solving linear matrix inequalities.
163-190
- Arkadi Nemirovski:
The long-step method of analytic centers for fractional problems.
191-224
- Monique Laurent, Svatopluk Poljak, Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems.
225-246
- Mehran Mesbahi, George P. Papavassilopoulos:
A cone programming approach to the bilinear matrix inequality problem and its geometry.
247-272
- Franz Rendl, Henry Wolkowicz:
A semidefinite framework for trust region subproblems with applications to large scale minimization.
273-299
- Alexander Shapiro:
First and second order analysis of nonlinear semidefinite programs.
301-320
- Dimitris Bertsimas, Xiaodong Luo:
On the worst case complexity of potential reduction algorithms for linear programming.
321-333
- Hein Hundal, Frank Deutsch:
Two generalizations of Dykstra's cyclic projections algorithm.
335-355
- Bernd Sturmfels, Rekha R. Thomas:
Variation of cost functions in integer programming.
357-387
- Eddie Cheng, William H. Cunningham:
Wheel inequalitites for stable set polytopes.
389-421
Copyright © Fri Dec 4 20:34:02 2009
by Michael Ley (ley@uni-trier.de)
