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-optimization
Search options answers only
not deleted
user 6094
Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.
1
vote
Discrete optimization problem
Nice question. Here I just mention an interesting idea used in this GIS StackExchange posting by whuber (William Huber):
Find $n$ clusters among your $N$ points, and take the
center of those clusters …
- 149k
4
votes
Accepted
Finding a point maximizing the minimal distance to a set of points
"Do you have any pointers to more recent works on the generalization to higher dimensions?"
Xie, Yulai, Jack Snoeyink, and Jinhui Xu. "Efficient algorithm for approximating maximum inscribed spher …
- 149k
2
votes
Optimal covering of line subsegments using a given set of disks
This will be a high-level suggestion, and definitely not optimal.
First, execute a sweepline algorithm to detect all the points of intersections between
segments and circles.
Then for each segment, r …
- 149k
1
vote
Distance between two sets
This may help, as it applies to "arbitrary compact convex sets" in $\mathbb{R}^n$,
although primarily applied to polytopes:
Llanas, B., M. Fernández de Sevilla, and V. Feliú. "An iterative algorithm …
- 149k
2
votes
Accepted
Calculating the Upper Bound on the Sphere Radius of Knotted Channel Surfaces
Jason Cantarella has studied this problem extensively,
and written several papers on the topic.
See his Octrope
webpage:
Octrope is a library for quickly finding the thickness or ropelength of pol …
- 149k
4
votes
Accepted
Resource Constrained Routing with Refueling
Here are three sources. The 2nd paper is recent (2012) and its
literature review may be helpful. The 3rd is a 2013 PhD dissertation that incorporates traffic congestion.
(1) Lin, Shieu-Hong. "Find …
- 149k
7
votes
Find minimum-area ellipse which encloses two ellipses
Below is an example to illustrate Will Jagy's solution.
(Caveat lector: I did not preserve scale from image to image.)
First, it is no loss of generality to rotate so that one ellipse $E_1$ has its ma …
- 149k