Separable programming. Theory and methods
inventory modelswell-posednessstochastic quasi-gradient methodsstabilityseparable functionsoptimality criterianon-smooth approximationslinear equality constraintslinear approximationsknapsack polytopesalgorithmsdynamic programmingdualitydirectional derivativesconvex setsconvex separable programsconvex nonlinear programming problemsconvex analysisconvergence results
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)
- Separable optimization. Theory and methods
- scientific article; zbMATH DE number 713582
- Solving highly nonlinear convex separable programs using successive approximation
- Successive approximation in separable programming: An improved procedure for convex separable programs
- scientific article; zbMATH DE number 3821435
- On the constructive solution of convex programming problems in separable form
- A piecewise linearization framework for retail shelf space management models
- 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
- scientific article; zbMATH DE number 4172748 (Why is no real title available?)
- A two-segment approximation algorithm for separable convex programming with linear constraints
- Successive approximation in separable programming: An improved procedure for convex separable programs
- scientific article; zbMATH DE number 4076979 (Why is no real title available?)
- scientific article; zbMATH DE number 713582 (Why is no real title available?)
- scientific article; zbMATH DE number 2166900 (Why is no real title available?)
- Separable optimization. Theory and methods
- 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
- Farkas' lemma for separable sublinear inequalities without qualifications
This page was built for publication: Separable programming. Theory and methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948302)
