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)
convergence; separable programming; computational experience; bounded closed convex sets; separable objectives; continuous convex objective functions; local piecewise-linear secant approximations
Related Items
Benefit sharing in holding situations, A variable-penalty alternating directions method for convex optimization, Optimal objective function approximation for separable convex quadratic programming, Computational aspects of two-segment separable programming, A hybrid algorithm for solving convex separable network flow problems, Sandwich approximation of univariate convex functions with an application to separable convex programming