Secant approximation methods for convex optimization
From MaRDI portal
Publication:3896852
DOI10.1007/BFb0120926zbMath0449.90081MaRDI QIDQ3896852
No author found.
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
convergenceseparable programmingcomputational experiencebounded closed convex setsseparable objectivescontinuous convex objective functionslocal piecewise-linear secant approximations
Related Items (6)
A hybrid algorithm for solving convex separable network flow problems ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Benefit sharing in holding situations ⋮ A variable-penalty alternating directions method for convex optimization ⋮ Computational aspects of two-segment separable programming
This page was built for publication: Secant approximation methods for convex optimization
