The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction ma
We study in this paper the continuity of the objective function for variable program-ming. In particular, we study the second-order optimality conditions for un
The Filled Function Method is a class of effective algorithms for continuous global optimization. In this paper, a new filled function method is introduced and
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarit
In this paper,we propose an algorithm for isolating real roots of a given univariate spline function,which is based on the use of Descartes’ rule of signs and
We are interested in the numerical solution of the large nonsymmetric shifted linear system,(A+αI)x=b,for many different values of the shift α in a wide range