scientific article; zbMATH DE number 1552235

MaRDI QIDQ4524466zbMATH OpenFDO

Authors Jochen W. Schmidt

Publication date 3 July 2001

Full work available at URL http://www.emis.de/proceedings/3ICAOC/

Mathematics Subject Classification ID

Spline approximation (41A15) Approximation with constraints (41A29) Numerical computation using splines (65D07) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 1258323
• Dual algorithms for solving convex partially separable optimization problems
• scientific article; zbMATH DE number 4043162
• scientific article; zbMATH DE number 4060644
• An unconstrained dual program for computing convex \(C^ 1\)-spline approximants

Cited in

(6)

• An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
• Dual algorithms for solving convex partially separable optimization problems
• Unconstrained duals to partially separable constrained programs
• scientific article; zbMATH DE number 4043162 (Why is no real title available?)
• scientific article; zbMATH DE number 4060644 (Why is no real title available?)
• scientific article; zbMATH DE number 1258323 (Why is no real title available?)

This page was built for publication:

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