Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm

R. Cominetti, M. Courdurier

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

22 Citas (Scopus)

Resumen

We study the asymptotic behavior of the continuous flow generated by coupling the steepest descent method with a general class of penalty schemes for convex programming. We establish convergence of the trajectories towards primal optimal solutions, as well as convergence of some naturally associated dual paths. The results are extended to the sequences generated by an implicit discretization scheme which corresponds to the coupling of an inexact proximal point iteration with the penalty schemes.

Idioma originalInglés
Páginas (desde-hasta)745-765
Número de páginas21
PublicaciónSIAM Journal on Optimization
Volumen13
N.º3
DOI
EstadoPublicada - 2003

Huella

Profundice en los temas de investigación de 'Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm'. En conjunto forman una huella única.

Citar esto