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 oc.optimization-and-control
Search options not deleted
user 38620
Operations research, linear programming, control theory, systems theory, optimal control, game theory
5
votes
3
answers
267
views
Find the maximum trigonometric polynomial coefficient $A_{k}$
I posted this question on Math Stack Exchange but did not get any answer. I am trying my luck here.
Let $n,k$ be given positive integers and $n>k$. If for all real numbers $x$ we have $$A_{1}\cos{x} …
- 4,280
3
votes
1
answer
202
views
it's convex sequence inequality
A sequence $a_0,a_1,\dots,a_n$ of real numbers is called concave if $a_{0}=0$, and for each $0<i<n$, we have $a_i\geq\dfrac{a_{i-1}+a_{i+1}}{2}$.
Find the largest $c(n)$ such that for every concave s …
- 4,280