Approximation algorithms for indefinite quadratic programming
From MaRDI portal
Recommendations
- Approximation algorithms for quadratic programming
- An approximation algorithm for indefinite mixed integer quadratic programming
- Algorithms for the solution of quadratic knapsack problems
- On approximation algorithms for concave mixed-integer quadratic programming
- On approximation algorithms for concave mixed-integer quadratic programming
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A lagrangean relaxation algorithm for the constrained matrix problem
- A polynomially bounded algorithm for a singly constrained quadratic program
- An O(n) algorithm for quadratic knapsack problems
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Approximation algorithms for indefinite quadratic programming
- Constrained global optimization: algorithms and applications
- Finding the upper envelope of n line segments in O(n log n) time
- Local minima for indefinite quadratic knapsack problems
- On the solution of concave knapsack problems
- Quadratic programming is in NP
- Quadratic programming with one negative eigenvalue is NP-hard
- Some NP-complete problems in quadratic and nonlinear programming
Cited in
(48)- Approximation algorithms for indefinite complex quadratic maximization problems
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Quadratic programming and combinatorial minimum weight product problems
- Open questions in complexity theory for numerical optimization
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- A FPTAS for a class of linear multiplicative problems
- Approximating quadratic programming with bound and quadratic constraints
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- scientific article; zbMATH DE number 3885655 (Why is no real title available?)
- Approximate Zeros of Quadratically Convergent Algorithms
- Global solutions to folded concave penalized nonconvex learning
- On mutual concavity and strategically-zero-sum bimatrix games
- A better differential approximation ratio for symmetric TSP
- Approximation algorithms for indefinite quadratic programming
- A trust-region strategy for minimization on arbitrary domains
- An approximation algorithm for indefinite mixed integer quadratic programming
- Optimal solution approximation for infinite positive-definite quadratic programming
- Optimization of a convex program with a polynomial perturbation
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Provable randomized rounding for minimum-similarity diversification
- Differential approximation algorithms for some combinatorial optimization problems
- An efficient global algorithm for a class of indefinite separable quadratic programs
- A continuous approch for globally solving linearly constrained quadratic
- Subdeterminants and concave integer quadratic programming
- Linear decomposition approach for a class of nonconvex programming problems
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- The complexity of approximating a nonlinear program
- Local minima for indefinite quadratic knapsack problems
- A new algorithm for the general quadratic programming problems with box constraints
- Approximation algorithms for quadratic programming
- New formulations of the multiple sequence alignment problem
- Trading performance for stability in Markov decision processes
- On approximation algorithms for concave mixed-integer quadratic programming
- On approximation algorithms for concave mixed-integer quadratic programming
- Separable and low-rank continuous games
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Complexity results for some global optimization problems
- Complexity bounds for second-order optimality in unconstrained optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- A normal fan projection algorithm for low-rank optimization
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Algorithms of solution of problems of quadratic programming and of optimal guaranteed estimation
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Differential approximation of NP-hard problems with equal size feasible solutions
- Approximation algorithm for a class of global optimization problems
This page was built for publication: Approximation algorithms for indefinite quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687094)
