Separable programming. Theory and methods

zbMath0983.90001MaRDI QIDQ5948302

Stefan M. Stefanov

Publication date: 5 November 2001

Published in: Applied Optimization (Search for Journal in Brave)

zbMATH Keywords

algorithmsstabilitydynamic programmingwell-posednessdualityconvex setsconvergence resultsinventory modelsconvex analysisdirectional derivativesconvex nonlinear programming problemsconvex separable programsknapsack polytopeslinear approximationslinear equality constraintsnon-smooth approximationsoptimality criteriaseparable functionsstochastic quasi-gradient methods

Mathematics Subject Classification ID

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

Related Items (6)

A piecewise linearization framework for retail shelf space management models ⋮ A variable projection method for large-scale inverse problems with \(\ell^1\) regularization ⋮ An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ Farkas' lemma for separable sublinear inequalities without qualifications

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