SIAMJO
2000
14 years 11 days ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
SIAMJO
2000
14 years 11 days ago
2000
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
SIAMJO
2000
14 years 11 days ago
2000
We consider the gradient method xt+1 = xt + t(st + wt), where st is a descent direction of a function f : n and wt is a deterministic or stochastic error. We assume that f is Lip...
SIAMJO
2000
14 years 11 days ago
2000
Abstract. The Josephy
SIAMJO
2000
14 years 11 days ago
2000
Abstract. We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a n...
SIAMJO
2000
14 years 11 days ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
SIAMJO
2000
14 years 11 days ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
SIAMJO
2000
14 years 11 days ago
2000
SIAMJO
2000
14 years 11 days ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
SIAMJO
2000
14 years 11 days ago
2000
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...