New answers tagged nonlinear-optimization
1
vote
Can we say this nonlinear integer programming problem is NP-hard?
It is NP-hard. Below is a reduction from the partition problem.
The partition problem asks for a list of positive integers $x_1,\dots,x_n$ whether it can be partitioned into two subsets with equal sum....
2
votes
Accepted
How to integrate an indicator function/constraint into the cost function of a linear program?
I will simplify the notation to illustrate the idea. You want to minimize $$\sigma \max\left(\sum_{i,j} d_{ij} x_i x_j - \alpha, 0\right).$$
Introduce binary decision variable $y_{ij}$ to represent ...
1
vote
Accepted
Difference between Chebyshev first and second degree iterative methods
Late to the party by 7 years but here goes.
This is easiest to analyze in the case where $A$ is symmetric and positive-definite.
What you're describing is the difference between using the steepest ...
Top 50 recent answers are included
Related Tags
nonlinear-optimization × 606convex-optimization × 180
oc.optimization-and-control × 175
linear-algebra × 78
global-optimization × 77
real-analysis × 53
linear-programming × 39
fa.functional-analysis × 36
na.numerical-analysis × 35
inequalities × 34
pr.probability × 31
reference-request × 30
matrices × 29
convex-analysis × 25
polynomials × 24
combinatorial-optimization × 22
non-convex-optimization × 22
calculus-of-variations × 19
st.statistics × 18
convexity × 18
mg.metric-geometry × 17
ca.classical-analysis-and-odes × 17
quadratic-programming × 17
co.combinatorics × 16
integer-programming × 16