Breakpoint searching algorithms for the continuous quadratic knapsack problem
From MaRDI portal
Publication:2465658
DOI10.1007/s10107-006-0050-zzbMath1190.90121OpenAlexW1969757890MaRDI QIDQ2465658
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://rcin.org.pl/dlibra/publication/edition/139441/content
Convex programmingQuadratic programmingNonlinear programmingSeparable programmingSingly constrained quadratic program
Related Items
Efficient projection algorithms onto the weighted \(\ell_1\) ball, Neural blind deconvolution with Poisson data, Projections onto the canonical simplex with additional linear inequalities, An efficient global algorithm for a class of indefinite separable quadratic programs, Fast projection onto the simplex and the \(l_1\) ball, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method, A penalty algorithm for solving convex separable knapsack problems, On a Reduction for a Class of Resource Allocation Problems, A fast algorithm for quadratic resource allocation problems with nested constraints, Solving nested-constraint resource allocation problems with an interior point method, Fast algorithm for the quadratic knapsack problem, A Newton's method for the continuous quadratic knapsack problem, A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Minimum variance allocation among constrained intervals, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, Variational Gram Functions: Convex Analysis and Optimization, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, A breakpoint search approach for convex resource allocation problems with bounded variables, Nonlinear optimization and support vector machines, Solving the continuous nonlinear resource allocation problem with an interior point method, The newsvendor problem with capacitated suppliers and quantity discounts, Nonlinear optimization and support vector machines, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- On Floyd and Rivest's SELECT algorithm
- A Parallel Projection for the Multicommodity Network Model
- A lagrangean relaxation algorithm for the constrained matrix problem
- Quasi-Newton Updates with Bounds
- 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
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Technical Note—Allocation of Effort Resources among Competing Activities
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
- Validation of subgradient optimization
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
