All Areas Submissions - August 2000

Linear, Cone and Semidefinite Programming
A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization
J Peng, C Roos, T Terlaky

Linear, Cone and Semidefinite Programming
A scaled Gauss-Newton Primal--Dual Search Direction for Semidefinite Optimization
E. de Klerk, J Peng, C Roos, T Terlaky

Nonlinear Optimization
Failure of Global Convergence for a Class of Interior Point Methods for Nonlinear Programming
Andreas Wächter, Lorenz T. Biegler

Optimization Software and Modeling Systems
Optimization as an Internet Resource
Robert Fourer, Jean-Pierre Goux

Linear, Cone and Semidefinite Programming
Warm start strategies in interior-point methods for linear programming
E. Alper Yildirim, Stephen J. Wright

Complementarity and Variational Inequalities
On reduced QP formulations of monotone LCP problems
Stephen J. Wright

Convex and Nonsmooth Optimization
A bundle filter method for nonsmooth nonlinear optimization
Roger Fletcher, Sven Leyffer

Integer Programming
Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming
Sven Leyffer

Nonlinear Optimization
On the global convergence of an SLP-filter algorithm
Roger Fletcher, Sven Leyffer, Phillipe L. Toint

Infinite Dimensional Optimization
On duality theory of conic linear problems
Alexander Shapiro

Integer Programming
A Parallel, Linear Programming Based Heuristic for Large Scale Set Partitioning Problems
Jeff Linderoth, Eva Lee, Martin Savelsbergh

Linear, Cone and Semidefinite Programming
Notes on the Dual Simplex Method
Robert Fourer

Integer Programming
OR Counterparts to AI Planning
Robert Fourer

Applications — Science and Engineering
Interior point methods for massive support vector machines
Michael Ferris, Todd Munson

Nonlinear Optimization
An infeasible active set method for convex problems with simple bounds
Karl Kunisch, Franz Rendl

Nonlinear Optimization
Feasibility Control in Nonlinear Optimization
Marcelo Marazzi, Jorge Nocedal