3
votes
What's the purpose of the KKT condition when first-order optimality condition exists?
... because it is easier to check whether the KKT conditions are satisfied compared to the first-order conditions.
In fact, you only need some set of multipliers, plug it into the set of equations and ...
1
vote
Accepted
Recommendations on numerical methods and numerical analysis books for machine learning?
Justin Solomon “Numerical Algorithms - Methods for Computer Vision, Machine Learning, and Graphics” (2015)
1
vote
Is it true that a function is $c$-strongly convex if $f - c\|x\|^2_p$ is convex for ANY norm $\|x\|_p$?
Following the clarification in your comment, for a given norm $\|\cdot\|$ , $f(x)$ is here called $c$-strongly convex if for all $x,y$ and $\alpha \in [0,1]$ we have
$$f(\alpha x + (1-\alpha)y) \le \...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
numerical-optimization × 1525optimization × 867
numerical-methods × 440
convex-optimization × 375
nonlinear-optimization × 282
gradient-descent × 215
linear-algebra × 145
numerical-linear-algebra × 138
linear-programming × 68
convex-analysis × 65
quadratic-programming × 62
algorithms × 53
matrices × 48
non-convex-optimization × 48
matlab × 43
newton-raphson × 42
real-analysis × 40
machine-learning × 38
numerical-calculus × 37
convergence-divergence × 34
multivariable-calculus × 33
reference-request × 32
discrete-optimization × 32
calculus × 29
lagrange-multiplier × 29