On minimizing the sum of a convex function and a concave function
From MaRDI portal
Publication:3724102
DOI10.1007/BFb0121137zbMath0593.90069OpenAlexW177898734MaRDI QIDQ3724102
Publication date: 1986
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121137
successive approximations methodquasidifferentiable functions\(\epsilon \) -steepest- descent-type approachessum of a convex function and a concave function
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (6)
Convex multilevel decomposition algorithms for non‐monotone problems ⋮ Quasidifferentiability in nonsmooth, nonconvex mechanics ⋮ Descent methods for quasidifferentiable minimization ⋮ A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept ⋮ Difference convex optimization techniques in nonsmooth computational mechanics ⋮ New types of variational principles based on the notion of quasidifferentiability
This page was built for publication: On minimizing the sum of a convex function and a concave function
