H1-projection into the set of convex functions : a saddle-point formulation

DOI10.1051/proc:2001017zbMath0982.65076OpenAlexW2078266316MaRDI QIDQ2723253

Guillaume Carlier, Bertrand Maury, Thomas Lachand-Robert

Publication date: 11 July 2001

Published in: ESAIM: Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/proc:2001017

zbMATH Keywords

algorithmnumerical experimentsconvex functionsminimizationvariational problemsminimax problemsill-posed problemsaddle-point problemprojection-operator

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence of solutions for minimax problems (49J35)

Related Items (4)

Version continue de l'algorithme d'Uzawa. (Continuous version of the Uzawa algorithm) ⋮ The numerical solution of Newton's problem of least resistance ⋮ Optimal derivatives design for mean-variance agents under adverse selection ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials

This page was built for publication: H1-projection into the set of convex functions : a saddle-point formulation