Sciweavers

SIAMJO
2000
108views more  SIAMJO 2000»
13 years 4 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
SIAMJO
2000
56views more  SIAMJO 2000»
13 years 4 months ago
Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
Abstract. Many variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied...
Roberto Andreani, José Mario Martíne...
SIAMJO
2000
63views more  SIAMJO 2000»
13 years 4 months ago
Pattern Search Methods for Linearly Constrained Minimization
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
Robert Michael Lewis, Virginia Torczon
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 4 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
SIAMJO
2000
86views more  SIAMJO 2000»
13 years 4 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel