Convex separable minimization subject to bounded variables
From MaRDI portal
Recommendations
- Convex separable minimization problems with a linear constraint and bounded variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- scientific article; zbMATH DE number 5270560
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- Convex programming with single separable constraint and bounded variables
Cited in
(26)- Inverse optimization for linearly constrained convex separable programming problems
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Representability of functions
- Well-posedness and primal-dual analysis of some convex separable optimization problems
- Decision model and analysis for investment interest expense deduction and allocation
- 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
- Convex separable minimization problems with a linear constraint and bounded variables
- Bounding duality gap for separable problems with linear constraints
- On the symmetric quadratic eigenvalue complementarity problem
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- 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
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Minimizing Separable Convex Functions Subject to Simple Chain Constraints
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- Tail mutual exclusivity and Tail-VaR lower bounds
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- scientific article; zbMATH DE number 5270560 (Why is no real title available?)
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Convex programming with single separable constraint and bounded variables
- A unified method for a class of convex separable nonlinear knapsack problems
This page was built for publication: Convex separable minimization subject to bounded variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931032)
