Some NP-complete problems in quadratic and nonlinear programming

@article{Murty1987SomeNP,
  title={Some NP-complete problems in quadratic and nonlinear programming},
  author={Katta G. Murty and Santosh N. Kabadi},
  journal={Mathematical Programming},
  year={1987},
  volume={39},
  pages={117-129}
}
AbstractIn continuous variable, smooth, nonconvex nonlinear programming, we analyze the complexity of checking whether(a)a given feasible solution is not a local minimum, and(b)the objective function is not bounded below on the set of feasible solutions. We construct a special class of indefinite quadratic programs, with simple constraints and integer data, and show that checking (a) or (b) on this class is NP-complete. As a corollary, we show that checking whether a given integer square matrix… Expand
The Inverse Problems of some Mathematical Programming Problems
TLDR
This paper shows that the inverse problem of determining a KKT point of the non-convex quadratic programming is polynomial and proves the CoNP=NP, and solves an open question raised by Heuberger on inverse NP-hard problems. Expand
Undecidability and hardness in mixed-integer nonlinear programming
TLDR
This work surveys two aspects of mixed-integer nonlinear programming and concludes that it is not a solvable class: instead, its formal sentences belong to two different theories, one of which is decidable while the other is not. Expand
GLOBAL EXTREMAL CONDITIONS FOR MULTI-INTEGER QUADRATIC PROGRAMMING
This paper presents a canonical duality approach to solve an integer quadratic programming problem, in which the objective function is quadratic and each variable may assume the value of one ofExpand
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
TLDR
This paper shows how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's). Expand
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
TLDR
Empirical evidence is shown that lower bounds provided by the copositive relaxation are able to substantially speed up a well known solver in obtaining the optimality certificate. Expand
Copositive realxation for genera quadratic programming
We consider general, typically nonconvex, Quadratic programming Problem. The Semidefinite relaxation proposed by Shor provides bounds on the optimal solution, but it does not always provideExpand
On affine scaling algorithms for nonconvex quadratic programming
  • Y. Ye
  • Mathematics, Computer Science
  • Math. Program.
  • 1992
TLDR
This work investigates the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems and shows that the problem with an ellipsoidal constraint is “easy”. Expand
The bounds of feasible space on constrained nonconvex quadratic programming
This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of theExpand
Copositivity and constrained fractional quadratic problems
TLDR
Based on these formulations, Semidefinite Programming relaxations are derived for finding good lower bounds to these fractional programs, which can be used in a global optimization branch-and-bound approach. Expand
Conic Reformulation of Some Quadratic Programming Problems with Applications
TIAN, YE. Conic Reformulation of Some Quadratic Programming Problems with Applications. (Under the direction of Dr. Shu-Cherng Fang.) In this dissertation, conic reformulations of severalExpand
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
Nonlinear programming;: Sequential unconstrained minimization techniques
Abstract : This report gives the most comprehensive and detailed treatment to date of some of the most powerful mathematical programming techniques currently known--sequential unconstrained methodsExpand
Nonlinear Programming
TLDR
It is shown that if A is closed for all k → x x, k → y y, where ( k A ∈ ) k y x , then ( ) A ∉ y x . Expand
Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
This paper presents a digest of recently developed simplicial and continuation methods for approximating fixed-points or zero-points of nonlinear finite-dimensional mappings. Underlying the methodsExpand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
The Computation of Fixed Points and Applications
I Brouwer's Theorem.- II Some Applications of Brouwer's Theorem.- III Triangulations.- IV Algorithms to Find Completely-Labelled Simplices.- V Extensions of Brouwer's Theorem.- VI Applications ofExpand