Part of this work was done during Oleg Burdakovs visit to the Chinese Academy of Sciences;which was supported by the Visiting Scientist award under the Chinese Academy of Sciences President's International Fellowship Initiative for 2017;The second author was supported by the Chinese Natural Science Foundation(No.11631013);the National 973 Program of China(No.2015CB856002).
The Barzilai-Borwein(BB)method is a popular and efficient tool for solving large-scale unconstrained optimization problems.Its search direction is the same as for the steepest descent(Cauchy)method,but its stepsize ru...
A stochastic approximation (SA)algorithm with new adaptive step sizes for solving unconstrained minimization problems in noisy environment is proposed.New adaptive step size scheme uses ordered statistics of fixed num...
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 unconstrained and constrained variable programming. Some n...
Based on a class of functions, which generalize the squared Fischer-Burmeister NCP function and have many desirable properties as the latter function has, we reformulate nonlinear complementarity problem (NCP for shor...
In this paper, the generalized complementarity problem is formulated as an unconstrained optimization problem. Our results generalize the results of [9]. The dimensionality of the unconstrained problem is the same as ...
In this papert we construct unconstrained methods for the generalized nonlinearcomplementarity problem and variational inequalities. Properties of the correspon-dent unconstrained optimization problem are studied. We ...