PIPA: A New Proximal Interior Point Algorithm for Large Scale Convex Optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

PIPA: A New Proximal Interior Point Algorithm for Large Scale Convex Optimization

Résumé

Interior point methods have been known for decades to be useful for the resolution of small to medium size constrained optimization problems. These approaches have the benefit of ensuring feasibility of the iterates through a logarithmic barrier. We propose to incorporate a proximal forward-backward step in the resolution of the barrier subproblem to account for non-necessarily differentiable terms arising in the objective function. The combination of this scheme with a novel line-search strategy gives rise to the so-called Proximal Interior Point Algorithm (PIPA) suitable for the minimization of the sum of a smooth convex function and a non-smooth convex one under general convex constraints. The convergence of PIPA is secured under mild assumptions. As demonstrated by numerical experiments carried out on a large-scale hyperspectral image unmixing application, the proposed method outperforms the state-of-the-art.
Fichier principal
Vignette du fichier
Article_1appli_urban_J2.pdf (737.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01803422 , version 1 (30-05-2018)

Identifiants

Citer

Marie-Caroline Corbineau, Emilie Chouzenoux, Jean-Christophe Pesquet. PIPA: A New Proximal Interior Point Algorithm for Large Scale Convex Optimization. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2018), Apr 2018, Calgary, Canada. pp.1343-1347, ⟨10.1109/ICASSP.2018.8462173⟩. ⟨hal-01803422⟩
274 Consultations
470 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More