A proximal regularization of the steepest descent method
A. N. Iusem, B. F. Svaiter (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A. N. Iusem, B. F. Svaiter (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Verma, Ram U. (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. F. Bonnans, M. Bouhtou (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Moudafi, A. (2003)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Chai, Xinkuan, Li, Bo, Song, Yisheng (2010)
Fixed Point Theory and Applications [electronic only]
Similarity:
Agarwal, Ravi P., Verma, Ram U. (2009)
Fixed Point Theory and Applications [electronic only]
Similarity:
Verma, Ram U. (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
P. Mahey, Pham Dinh Tao (1993)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Wei, Z., Qi, L., Birge, J.R. (1998)
Journal of Inequalities and Applications [electronic only]
Similarity:
Verma, Ram U. (2006)
Journal of Inequalities and Applications [electronic only]
Similarity:
Anh, Pham Ngoc, Kim, Jong Kyu (2010)
Journal of Inequalities and Applications [electronic only]
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 ...