An efficient global algorithm for a class of indefinite separable quadratic programs
From MaRDI portal
Publication:304230
DOI10.1007/s10107-015-0918-xzbMath1343.90058OpenAlexW605256861MaRDI QIDQ304230
Jaehwan Jeong, N. Chanaka P. Edirisinghe
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0918-x
Related Items (3)
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time ⋮ Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for indefinite quadratic programming
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Global minimization of indefinite quadratic problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Local minima for indefinite quadratic knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- Globally solving nonconvex quadratic programming problems via completely positive programming
- On the solution of concave knapsack problems
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Computationally Related Problems
- Nonlinear Programming
- Introduction to global optimization.
This page was built for publication: An efficient global algorithm for a class of indefinite separable quadratic programs
