Convex separable minimization subject to bounded variables

DOI10.1023/A:1008739510750zbMath0963.90048OpenAlexW32682462MaRDI QIDQ5931032

Stefan M. Stefanov

Publication date: 26 June 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008739510750

zbMATH Keywords

algorithmsconvex programmingknapsack problemseparable programmingsingle constrained program

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (15)

Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ On the symmetric quadratic eigenvalue complementarity problem ⋮ Tail mutual exclusivity and Tail-VaR lower bounds ⋮ Convex programming with single separable constraint and bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ Inverse optimization for linearly constrained convex separable programming problems

This page was built for publication: Convex separable minimization subject to bounded variables