Algorithms for the solution of quadratic knapsack problems
From MaRDI portal
Publication:806968
DOI10.1016/0024-3795(91)90267-ZzbMath0729.65047MaRDI QIDQ806968
Panos M. Pardalos, Chi-Geun Han, Yinyu Ye
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
convergencequadratic programminglinear complementarity problemstest problemscomputational resultsknapsack constraintpotential reduction algorithmaffine scaling methodconvex underestimating functionsinterior trust region methodsimplicial partitioning
Related Items
Computation of sparse and dense equilibrium strategies of evolutionary games, On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, On a nonseparable convex maximization problem with continuous Knapsack constraints, Quadratic resource allocation with generalized upper bounds, New infeasible interior-point algorithm based on monomial method, Competitive facility location model with concave demand, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Minimum variance allocation among constrained intervals, Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem, A two-phase method for solving continuous rank-one quadratic knapsack problems, A survey on the continuous nonlinear resource allocation problem, Equilibrium Distributions of Populations of Biological Species on Networks of Social Sites, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, Minimum norm solution to the positive semidefinite linear complementarity problem, A pegging algorithm for the nonlinear resource allocation problem, A logarithmic descent direction algorithm for the quadratic knapsack problem, Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem, Inverse optimization for linearly constrained convex separable programming problems, Optimality and stability of symmetric evolutionary games with applications in genetic selection, A branch and bound algorithm for constrained least squares, The nonlinear knapsack problem - algorithms and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Constrained global optimization: algorithms and applications
- Quadratic problems defined on a convex hull of points
- Checking local optimality in constrained quadratic programming is NP- hard
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Local minima for indefinite quadratic knapsack problems
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- A Centered Projective Algorithm for Linear Programming
- Duality in quadratic programming
- Computing a Trust Region Step
- Methods for Global Concave Minimization: A Bibliographic Survey
- Convex quadratic programming with one constraint and bounded variables
- Quasi-Newton Updates with Bounds
- Optimal scaling of balls and polyhedra
- Newton’s Method with a Model Trust Region Modification
- An algorithm for nonconvex programming problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
