Volume 41, Number 4, October-December 2007
|Page(s)||367 - 380|
|Published online||11 October 2007|
Rescaled proximal methods for linearly constrained convex problems
Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil; email@example.com, firstname.lastname@example.org
Accepted: 22 January 2007
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 bounds the subgradient of the regularized function, instead of using ϵ-subgradients of the original objective function. Quadratic convergence for LP is also proved using a more stringent error criterion.
Mathematics Subject Classification: 90C25 / 90C33
Key words: Interior proximal methods / Linearly constrained convex problems
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.