Login / Signup
Interval analytic treatment of convex programming problems.
Dieter Oelschlägel
Herbert Süße
Published in:
Computing (1980)
Keyphrases
</>
convex programming
linear programming
convex optimization
convex functions
interior point methods
upper bound
denoising
solving problems
semidefinite programming