Alternating proximal algorithm with costs-to-move, dual description and application to PDE's

DOI10.3934/DCDSS.2012.5.545zbMath1244.65095OpenAlexW2323869106MaRDI QIDQ428411

Pierre Frankel

Publication date: 22 June 2012

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdss.2012.5.545

zbMATH Keywords

domain decompositionconvex minimizationproximal algorithmalternating minimization

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Existence theories for problems in abstract spaces (49J27)

Related Items (1)

Lagrangian-penalization algorithm for constrained optimization and variational inequalities

This page was built for publication: Alternating proximal algorithm with costs-to-move, dual description and application to PDE's