Convex programming with single separable constraint and bounded variables

DOI10.1007/S10589-006-0396-4MaRDI QIDQ885824zbMATH OpenOpenAlexFDO

Authors Kalpana Dahiya, Surjeet Kaur Suneja, Vanita Verma

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

zbMATH Keywords

convex programmingseparable programmingiterative proceduresingly constrained program

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• Convex separable minimization problems with a linear constraint and bounded variables
• Convex separable minimization subject to bounded 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

Cites work

• scientific article; zbMATH DE number 4087432 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 1057696 (Why is no real title available?)
• scientific article; zbMATH DE number 2033405 (Why is no real title available?)
• scientific article; zbMATH DE number 2057973 (Why is no real title available?)
• scientific article; zbMATH DE number 1383441 (Why is no real title available?)
• scientific article; zbMATH DE number 2124285 (Why is no real title available?)
• A block active set algorithm for large-scale quadratic programming with box constraints
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A limited-memory multipoint symmetric secant method for bound constrained optimization
• A non-interior path following method for convex quadratic programming problems with bound constraints
• A polynomially bounded algorithm for a singly constrained quadratic program
• A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Convex quadratic programming with one constraint and bounded variables
• Convex separable minimization subject to bounded variables
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Ellipsoidal approach to box-constrained quadratic problems
• Simple Ranking Methods for Allocation of One Resource
• Technical Note—Allocation of Effort Resources among Competing Activities

Cited in

(7)

• Convex separable minimization problems with a linear constraint and bounded variables
• Simple solution methods for separable mixed linear and quadratic knapsack problem
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• Convex quadratic programming with one constraint and bounded variables
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• New strong duality results for convex programs with separable constraints
• Convex separable minimization subject to bounded variables

This page was built for publication: Convex programming with single separable constraint and bounded variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885824)