Variable fixing method by weighted average for the continuous quadratic knapsack problem
type: Item
instance of: scholarly article
title: Variable fixing method by weighted average for the continuous quadratic knapsack problem
zbMATH Open document ID: 1478.65062
author: Hsin-Min Sun
author: Yu-Juan Sun
published in: Numerical Algebra, Control and Optimization
publication date: 2022-02-10T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 7471921
zbMATH Keywords: quadratic programming
zbMATH Keywords: separable convex programming
zbMATH Keywords: singly constrained quadratic program
describes a project that uses: NAPHEAP
describes a project that uses: SPG
MaRDI profile type: Publication
full work available at URL: naco.2021048
OpenAlex ID: W3211658397
cites work: Algorithm 813
cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
cites work: Quadratic resource allocation with generalized upper bounds
cites work: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
cites work: A Projection Method for the Integer Quadratic Knapsack Problem
cites work: An O(n) algorithm for quadratic knapsack problems
cites work: Quasi-Newton Updates with Bounds
cites work: A Newton's method for the continuous quadratic knapsack problem
cites work: Support-vector networks
cites work: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
cites work: A lagrangean relaxation algorithm for the constrained matrix problem
cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
cites work: An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
cites work: Convex quadratic programming with one constraint and bounded variables
cites work: On Quadratic Programming
cites work: Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
cites work: A library for continuous convex separable quadratic knapsack problems
cites work: Continuous quadratic programming formulations of optimization problems on graphs
cites work: Graph Partitioning and Continuous Quadratic Programming
cites work: Validation of subgradient optimization
cites work: A polynomially bounded algorithm for a singly constrained quadratic program
cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
cites work: On linear-time algorithms for the continuous quadratic Knapsack problem
cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem
cites work: Variable fixing algorithms for the continuous quadratic Knapsack problem
cites work: An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
cites work: Linear time algorithms for some separable quadratic programming problems
cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: Algorithms for the solution of quadratic knapsack problems
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
cites work: On the continuous quadratic knapsack problem
cites work: A Parallel Projection for the Multicommodity Network Model
cites work: Minimum variance allocation among constrained intervals
cites work: Computational development of a lagrangian dual approach for quadratic networks
DOI: 10.3934/NACO.2021048
Recommended article: Variable fixing algorithms for the continuous quadratic Knapsack problem
Recommended article: A Newton's method for the continuous quadratic knapsack problem
Recommended article: On the continuous quadratic knapsack problem
Recommended article: A two-phase method for solving continuous rank-one quadratic knapsack problems
Recommended article: A semidefinite programming approach to the quadratic knapsack problem
Recommended article: Exact Solution Methods for the k-Item Quadratic Knapsack Problem
Recommended article: An approximate dynamic programming approach to convex quadratic knapsack problems
Recommended article: Approximation of the Quadratic Knapsack Problem
Recommended article: Approximation of the quadratic knapsack problem
Recommended article: An algorithm for the continuous variable upper bound knapsack problem
description: scientific article; zbMATH DE number 7471921