Two-phase generalized reduced gradient method for constrained global optimization.
El Mouatasim, Abdelkrim (2010)
Journal of Applied Mathematics
Similarity:
El Mouatasim, Abdelkrim (2010)
Journal of Applied Mathematics
Similarity:
Yuan, Gonglin, Meng, Shide, Wei, Zengxin (2009)
Advances in Operations Research
Similarity:
Paulo J.S. Silva, Carlos Humes (2007)
RAIRO - Operations Research
Similarity:
We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that ...
Ladislav Lukšan, Ctirad Matonoha, Jan Vlček (2010)
Kybernetika
Similarity:
In this paper, we propose a primal interior-point method for large sparse generalized minimax optimization. After a short introduction, where the problem is stated, we introduce the basic equations of the Newton method applied to the KKT conditions and propose a primal interior-point method. (i. e. interior point method that uses explicitly computed approximations of Lagrange multipliers instead of their updates). Next we describe the basic algorithm and give more details concerning...
Cheng, Wanyou, Zhang, Zongguo (2009)
Mathematical Problems in Engineering
Similarity:
Wan, Zhong (2004)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Nada I. Djuranović-Miličić (2002)
The Yugoslav Journal of Operations Research
Similarity:
J. F. Bonnans, M. Bouhtou (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ahmed Roubi (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates...