Convex programming with single separable constraint and bounded variables
type: Item
instance of: scholarly article
title: Convex programming with single separable constraint and bounded variables
zbMATH Open document ID: 1278.90308
author: Kalpana Dahiya
author: Surjeet Kaur Suneja
author: Vanita Verma
published in: Computational Optimization and Applications
publication date: 2007-06-14T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5164792
zbMATH Keywords: convex programming
zbMATH Keywords: separable programming
zbMATH Keywords: singly constrained program
zbMATH Keywords: iterative procedure
MaRDI profile type: Publication
full work available at URL: s10589-006-0396-4
OpenAlex ID: W1968259095
cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
cites work: A limited-memory multipoint symmetric secant method for bound constrained optimization
cites work: Ellipsoidal approach to box-constrained quadratic problems
cites work: Q4352739
cites work: A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
cites work: Convex quadratic programming with one constraint and bounded variables
cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
cites work: A block active set algorithm for large-scale quadratic programming with box constraints
cites work: A polynomially bounded algorithm for a singly constrained quadratic program
cites work: Technical Note—Allocation of Effort Resources among Competing Activities
cites work: Q4101610
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: Q3815867
cites work: A non-interior path following method for convex quadratic programming problems with bound constraints
cites work: Q4444573
cites work: Convex separable minimization subject to bounded variables
cites work: Q4831691
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: Q4456192
cites work: Q4719195
cites work: Simple Ranking Methods for Allocation of One Resource
DOI: 10.1007/S10589-006-0396-4
description: scientific article; zbMATH DE number 5164792