Tran Dinh Quoc

Learn More
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we combine the proposed algorithm with a relaxation technique to(More)
We make use of the Banach contraction mapping principle to prove the linear convergence of a regularization algorithm for strongly monotone Ky Fan inequalities that satisfy a Lipschitz-type condition recently introduced by Mastroeni. We then modify the proposed algorithm to obtain a line search-free algorithm which does not require the Lipschitz-type(More)
This paper proposes an iterative method for solving strongly monotone equilibrium problems by using gap functions combined with double projection-type mappings. Global convergence of the proposed algorithm is proved and its complexity is estimated. This algorithm is then coupled with the proximal point method to generate a new algorithm for solving monotone(More)
The PAD Review publications have been made possible by funding from Danish Interna-The designation of geographical entities in this book, and the presentation of the material , do not imply the expression of any opinion on the part of ICEM or other participating organisations concerning the legal status of any country, territory, or area, or of its(More)
  • 1