Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
From MaRDI portal
Publication:3559429
DOI10.1080/09720502.2009.10700652zbMath1227.90029OpenAlexW1973761937MaRDI QIDQ3559429
Publication date: 14 May 2010
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2009.10700652
Related Items
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Algorithms for bound constrained quadratic programming problems
- Local minima for indefinite quadratic knapsack problems
- On the continuous quadratic knapsack problem
- Bounded knapsack sharing
- Convex separable minimization problems with a linear constraint and bounded variables
- The Theory of Search: Optimum Distribution of Search Effort
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- Orthogonal Projections on Convex Sets for Newton-Like Methods
- A lagrangean relaxation algorithm for the constrained matrix problem
- Convex quadratic programming with one constraint and bounded variables
- Quasi-Newton Updates with Bounds
- Simple Ranking Methods for Allocation of One Resource
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Technical Note—Allocation of Effort Resources among Competing Activities
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Validation of subgradient optimization
