Methods for solving nonlinear constraints quadratic programming
$begingroup$
Are there any other methods to solve nonlinear constraints quadratic programming? I have known that some effective numerical methods, i.e, SQP and Gauss pseudospectral method and some heuristic algorithm, i.e, PSO, GA. But I don't know their time complexity, and I also want to know more about other methods and their time complexity.
optimization numerical-methods nonlinear-optimization quadratic-programming
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
$endgroup$
add a comment |
$begingroup$
Are there any other methods to solve nonlinear constraints quadratic programming? I have known that some effective numerical methods, i.e, SQP and Gauss pseudospectral method and some heuristic algorithm, i.e, PSO, GA. But I don't know their time complexity, and I also want to know more about other methods and their time complexity.
optimization numerical-methods nonlinear-optimization quadratic-programming
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
$endgroup$
add a comment |
$begingroup$
Are there any other methods to solve nonlinear constraints quadratic programming? I have known that some effective numerical methods, i.e, SQP and Gauss pseudospectral method and some heuristic algorithm, i.e, PSO, GA. But I don't know their time complexity, and I also want to know more about other methods and their time complexity.
optimization numerical-methods nonlinear-optimization quadratic-programming
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
$endgroup$
Are there any other methods to solve nonlinear constraints quadratic programming? I have known that some effective numerical methods, i.e, SQP and Gauss pseudospectral method and some heuristic algorithm, i.e, PSO, GA. But I don't know their time complexity, and I also want to know more about other methods and their time complexity.
optimization numerical-methods nonlinear-optimization quadratic-programming
optimization numerical-methods nonlinear-optimization quadratic-programming
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
asked Jan 24 at 3:40
Zhitao WangZhitao Wang
223
223
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Nonlinearly constrained quadratic programming? So you essentially ask about nonlinear programming.
For that, you use a nonlinear programming algorithm such as interior-point algorithms, penalty methods, SQP, filter methods, etc., and their complexity depends on the method, the problem, properties of the problem, the implementation, etc., i.e. it's impossible to answer generically.
The fact that the objective is quadratic is not something you typically would explicitly develop solvers for, once the constraints are general nonlinear. In fact, if you allow nonlinear constraints, there is no loss in generality to assume the objective to be linear
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
$endgroup$
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3085420%2fmethods-for-solving-nonlinear-constraints-quadratic-programming%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Nonlinearly constrained quadratic programming? So you essentially ask about nonlinear programming.
For that, you use a nonlinear programming algorithm such as interior-point algorithms, penalty methods, SQP, filter methods, etc., and their complexity depends on the method, the problem, properties of the problem, the implementation, etc., i.e. it's impossible to answer generically.
The fact that the objective is quadratic is not something you typically would explicitly develop solvers for, once the constraints are general nonlinear. In fact, if you allow nonlinear constraints, there is no loss in generality to assume the objective to be linear
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
$endgroup$
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
add a comment |
$begingroup$
Nonlinearly constrained quadratic programming? So you essentially ask about nonlinear programming.
For that, you use a nonlinear programming algorithm such as interior-point algorithms, penalty methods, SQP, filter methods, etc., and their complexity depends on the method, the problem, properties of the problem, the implementation, etc., i.e. it's impossible to answer generically.
The fact that the objective is quadratic is not something you typically would explicitly develop solvers for, once the constraints are general nonlinear. In fact, if you allow nonlinear constraints, there is no loss in generality to assume the objective to be linear
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
$endgroup$
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
add a comment |
$begingroup$
Nonlinearly constrained quadratic programming? So you essentially ask about nonlinear programming.
For that, you use a nonlinear programming algorithm such as interior-point algorithms, penalty methods, SQP, filter methods, etc., and their complexity depends on the method, the problem, properties of the problem, the implementation, etc., i.e. it's impossible to answer generically.
The fact that the objective is quadratic is not something you typically would explicitly develop solvers for, once the constraints are general nonlinear. In fact, if you allow nonlinear constraints, there is no loss in generality to assume the objective to be linear
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
$endgroup$
Nonlinearly constrained quadratic programming? So you essentially ask about nonlinear programming.
For that, you use a nonlinear programming algorithm such as interior-point algorithms, penalty methods, SQP, filter methods, etc., and their complexity depends on the method, the problem, properties of the problem, the implementation, etc., i.e. it's impossible to answer generically.
The fact that the objective is quadratic is not something you typically would explicitly develop solvers for, once the constraints are general nonlinear. In fact, if you allow nonlinear constraints, there is no loss in generality to assume the objective to be linear
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
edited Jan 24 at 13:26
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
answered Jan 24 at 13:17
Johan LöfbergJohan Löfberg
5,3101811
5,3101811
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
add a comment |
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
$begingroup$
Thank you, I will read more materials abot this topic.
$endgroup$
– Zhitao Wang
Jan 25 at 6:45
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3085420%2fmethods-for-solving-nonlinear-constraints-quadratic-programming%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
