Convex programming with single separable constraint and bounded variables
From MaRDI portal
Publication:885824
DOI10.1007/s10589-006-0396-4zbMath1278.90308OpenAlexW1968259095MaRDI QIDQ885824
Kalpana Dahiya, Vanita Verma, Surjeet Kaur Suneja
Publication date: 14 June 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-0396-4
Related Items (3)
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ New strong duality results for convex programs with separable constraints ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem
Cites Work
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A block active set algorithm for large-scale quadratic programming with box constraints
- A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
- Ellipsoidal approach to box-constrained quadratic problems
- A non-interior path following method for convex quadratic programming problems with bound constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- Convex quadratic programming with one constraint and bounded variables
- 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
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Convex separable minimization subject to bounded variables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convex programming with single separable constraint and bounded variables
