Is there a time polynomial algorithm to solve a box-constrained quadratic convex program?












0














I am working on the following quadratic convex problem



$min_{x}x^{T}Qx+f^{T}x$



subject to



$aleq xleq b$



where $x,a,b,finmathbb{R}^{n}$ and $Q$ is positive definite. Is there any
algorithm that solves the problem in polynomial time?










share|cite|improve this question






















  • interior point methods
    – LinAlg
    Nov 29 '18 at 14:22
















0














I am working on the following quadratic convex problem



$min_{x}x^{T}Qx+f^{T}x$



subject to



$aleq xleq b$



where $x,a,b,finmathbb{R}^{n}$ and $Q$ is positive definite. Is there any
algorithm that solves the problem in polynomial time?










share|cite|improve this question






















  • interior point methods
    – LinAlg
    Nov 29 '18 at 14:22














0












0








0







I am working on the following quadratic convex problem



$min_{x}x^{T}Qx+f^{T}x$



subject to



$aleq xleq b$



where $x,a,b,finmathbb{R}^{n}$ and $Q$ is positive definite. Is there any
algorithm that solves the problem in polynomial time?










share|cite|improve this question













I am working on the following quadratic convex problem



$min_{x}x^{T}Qx+f^{T}x$



subject to



$aleq xleq b$



where $x,a,b,finmathbb{R}^{n}$ and $Q$ is positive definite. Is there any
algorithm that solves the problem in polynomial time?







convex-optimization quadratic-programming






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 29 '18 at 11:31









UnclePetros

84




84












  • interior point methods
    – LinAlg
    Nov 29 '18 at 14:22


















  • interior point methods
    – LinAlg
    Nov 29 '18 at 14:22
















interior point methods
– LinAlg
Nov 29 '18 at 14:22




interior point methods
– LinAlg
Nov 29 '18 at 14:22










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018511%2fis-there-a-time-polynomial-algorithm-to-solve-a-box-constrained-quadratic-convex%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018511%2fis-there-a-time-polynomial-algorithm-to-solve-a-box-constrained-quadratic-convex%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Aardman Animations

Are they similar matrix

“minimization” problem in Euclidean space related to orthonormal basis