Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
type: Item
instance of: scholarly article
title: Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
zbMATH Open document ID: 1365.90184
author: Meijiao Liu
author: Yong-Jin Liu
published in: Computational Optimization and Applications
publication date: 2017-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6692601
zbMATH Keywords: singly linearly constrained quadratic programs
zbMATH Keywords: secant method
zbMATH Keywords: weighted Ky Fan \(k\)-norm
describes a project that uses: Gurobi
describes a project that uses: Mosek
describes a project that uses: NAPHEAP
MaRDI profile type: Publication
full work available at URL: s10589-016-9863-8
OpenAlex ID: W2488199803
cites work: Fastest Mixing Markov Chain on a Graph
cites work: Fastest Mixing Markov Chain on Graphs with Symmetries
cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
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: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
cites work: Algorithm 836
cites work: An introduction to a class of matrix cone programming
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: Finding the projection onto the intersection of a closed half-space and a variable box
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: Q3845569
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: On the continuous quadratic knapsack problem
cites work: On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
cites work: Q4767830
DOI: 10.1007/S10589-016-9863-8
description: scientific article; zbMATH DE number 6692601