Minimization of strictly convex functions: an improved optimality test based on Fenchel duality

DOI10.1088/0266-5611/16/3/315MaRDI QIDQ4493589zbMATH OpenOpenAlexFDO

Authors Christian Heinrich, Guy Demoment

Publication date 20 March 2001

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/58ab2bceea7cc22147b621336e5d8d2749d379a3

zbMATH Keywords

linear equality constraintsstrictly convex cost functionstopping testnumerical iterative optimizationstopping iterations

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
• Minimization of energy functionals applied to some inverse problems
• Efficient schemes for total variation minimization under constraints in image processing
• A fast dual proximal gradient algorithm for convex minimization and applications
• Dualization of signal recovery problems

This page was built for publication: Minimization of strictly convex functions: an improved optimality test based on Fenchel duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493589)