Separable optimization. Theory and methods

DOI10.1007/978-3-030-78401-0MaRDI QIDQ5010038zbMATH OpenOpenAlexFDO

Authors S. M. Stefanov

Publication date 24 August 2021

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-78401-0

Mathematics Subject Classification ID

Convex functions and convex programs in convex geometry (52A41) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25) Nonlinear programming (90C30) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Separable programming. Theory and methods
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Convex separable optimization is not much harder than linear optimization
• scientific article; zbMATH DE number 1292040

Cited in

(5)

• Approximate separable multichoice optimization over monotone systems
• One class of separable optimization problems: solution method, application
• Separable programming. Theory and methods
• A review of benchmark and test functions for global optimization algorithms and metaheuristics
• A partitioned optimization framework for structure-aware problems

This page was built for publication: Separable optimization. Theory and methods

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