In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search directi...In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search direction to more general form, and also obtain the global convergence of corresponding algorithm. The numerical results illustrate that the new algorithm is effective.展开更多
In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the c...In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the cone of semidefinite matrices, and obtain a main result that if the corresponding problem has a strict feasible point, then its solution set is nonemptyness and boundedness.展开更多
文摘In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search direction to more general form, and also obtain the global convergence of corresponding algorithm. The numerical results illustrate that the new algorithm is effective.
文摘In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the cone of semidefinite matrices, and obtain a main result that if the corresponding problem has a strict feasible point, then its solution set is nonemptyness and boundedness.
