Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nonlinear-programming
Search options not deleted
user 11366
For questions about mathematical optimization problems involving a nonlinear objective function and/or nonlinear constraints.
1
vote
2
answers
178
views
Linear approximation of fraction for a maximization problem
I have a problem given as \begin{align*}
\underset{\mathbf{x}}{max} & \left|\mathop{\sum_{n=1}^{N}}\left[\frac{\mathbf{a}\left(n\right)}{\mathbf{b}\left(n\right)+\mathbf{x}\left(n\right)}\right]\right …
- 37
1
vote
2
answers
611
views
Non linear programming
I want to solve a large scale non linear optimization problem and there are two methods interior point method and sequential quadric programing usually used to solve non linear optimization problem. I …
- 37
1
vote
2
answers
137
views
My barrier function is always giving a complex number
I am working on implementing the interior point method, and the barrier function always gives me a complex number. B(x) = f(x) - t * sum(ln(hi(x))). I have changed the value of 't' to see the B(x) be …
- 37
2
votes
2
answers
116
views
Potential methods for solving quadratic optmization problem
I am trying to solve a non-convex optimization problem with the help of sequential quadratic programming.
I need to develop an algorithm inside SQP to solve this subproblem. What potential methods (c …
- 37