Volume 57,
1992
- Michael C. Ferris, Olvi L. Mangasarian:
Minimum principle sufficiency.
1-14 BibTeX
- Jonathan M. Borwein, A. S. Lewis:
Partially finite convex programming, Part I: Quasi relative interiors and duality theory.
15-48 BibTeX
- Jonathan M. Borwein, A. S. Lewis:
Partially finite convex programming, Part II: Explicit lattice models.
49-83 BibTeX
- Vaithilingam Jeyakumar, Henry Wolkowicz:
Generalizations of Slater's constraint qualification for infinite convex programs.
85-101 BibTeX
- James V. Burke, R. A. Poliquin:
Optimality conditions for non-finite valued convex composite functions.
103-120 BibTeX
- Ilan Adler, Peter A. Beling:
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices.
121-143 BibTeX
- K. S. Al-Sultan, Katta G. Murty:
Exterior point algorithms for nearest points and convex quadratic programs.
145-161 BibTeX
- David S. Atkinson, Pravin M. Vaidya:
A scaling technique for finding the weighted analytic center of a polytope.
163-192 BibTeX
- Ding-Zhu Du, Yanjun Zhang:
On better heuristics for Steiner minimum trees.
193-202 BibTeX
- Peter Gritzmann, Victor Klee:
Deciding uniqueness in norm maximization.
203-214 BibTeX
- Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
A continuous approach to inductive inference.
215-238 BibTeX
- Jie Sun, Liqun Qi:
An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for C-convex programming.
239-257 BibTeX
- Craig A. Tovey:
A polynomial-time algorithm for computing the yolk in fixed dimension.
259-277 BibTeX
- Stephen A. Vavasis:
Approximation algorithms for indefinite quadratic programming.
279-311 BibTeX
- Grzegorz W. Wasilkowski:
On average complexity of global optimization problems.
313-324 BibTeX
- Yinyu Ye:
On the finite convergence of interior-point algorithms for linear programming.
325-335 BibTeX
- Panos M. Pardalos, Stephen A. Vavasis:
Open questions in complexity theory for numerical optimization.
337-339 BibTeX
- John J. Forrest, Donald Goldfarb:
Steepest-edge simplex algorithms for linear programming.
341-374 BibTeX
- Robert G. Jeroslow, R. Kipp Martin, Ronald L. Rardin, Jinchang Wang:
Gainfree Leontief substitution flow problems.
375-414 BibTeX
- Bart De Moor, Lieven Vandenberghe, Joos Vandewalle:
The generalized linear complementarity problem and an algorithm to find all its solutions.
415-426 BibTeX
- Sjur Didrik Flåm:
On finite convergence and constraint identification of subgradient projection methods.
427-437 BibTeX
- Wallace C. Pye:
Almost P0-matrices and the class Q.
439-444 BibTeX
- Bruno Betrò, Fabio Schoen:
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization.
445-458 BibTeX
- Mark E. Hartmann, Michael H. Schneider:
An analogue of Hoffman's circulation conditions for max-balanced flows.
459-476 BibTeX
Copyright © Sun May 17 00:14:01 2009
by Michael Ley (ley@uni-trier.de)
