Volume 67,
1994
- Zhi-Quan Luo, Jong-Shi Pang:
Error bounds for analytic systems and their applications.
1-28 BibTeX
- Stephen J. Wright:
An infeasible-interior-point algorithm for linear complementarity problems.
29-51 BibTeX
- Ciyou Zhu:
Solving large-scale minimax problems with the primal-dual steepest descent algorithm.
53-76 BibTeX
- M. van Rooyen, X. Zhou, S. Zlobec:
A saddle-point characterization of Pareto optima.
77-88 BibTeX
- Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
A note on exploiting structure when using slack variables.
89-97 BibTeX
- Alexander Shapiro:
Quantitative stability in stochastic programming.
99-108 BibTeX
- Shinji Mizuno:
Polynomiality of infeasible-interior-point algorithms for linear programming.
109-119 BibTeX
- Kalyan T. Talluri, Donald K. Wagner:
On the k-cut subgraph polytope.
121-132 BibTeX
- F. Güder, J. G. Morris:
Optimal objective function approximation for separable convex quadratic programming.
133-142 BibTeX
- Julia L. Higle, Suvrajeet Sen:
Finite master programs in regularized stochastic decomposition.
143-168 BibTeX
- R. Cominetti, J. San Martín:
Asymptotic analysis of the exponential penalty trajectory in linear programming.
169-187 BibTeX
- Thomas F. Coleman, Yuying Li:
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds.
189-224 BibTeX
- Jean-Paul Penot:
Optimality conditions in mathematical programming and composite optimization.
225-245 BibTeX
- T. Bannert:
A trust region algorithm for nonsmooth optimization.
247-264 BibTeX
- Margaret H. Wright:
Some properties of the Hessian of the logarithmic barrier function.
265-295 BibTeX
- Yves Pochet, Laurence A. Wolsey:
Polyhedra for lot-sizing with Wagner-Whitin costs.
297-323 BibTeX
- Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki:
Implementing an efficient minimum capacity cut algorithm.
325-341 BibTeX
- J. Randall Brown:
Bounded knapsack sharing.
343-382 BibTeX
- Florian A. Potra:
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points.
383-406 BibTeX
- Roland W. Freund, Florian Jarre:
An interior-point method for fractional programs with convex constraints.
407-440 BibTeX
Copyright © Sun May 17 00:14:02 2009
by Michael Ley (ley@uni-trier.de)
