Timeline for Solution to a quadratically constrained quadratic program with unit ball constraint
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 11 at 14:17 | vote | accept | nuobei tang | ||
Dec 11 at 14:16 | vote | accept | nuobei tang | ||
Dec 11 at 14:17 | |||||
Dec 11 at 12:55 | comment | added | nuobei tang | I really want to vote your answer.Since I’m new here, I don’t have enough reputation to cast a vote. | |
Dec 8 at 13:51 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
added 61 characters in body
|
Dec 8 at 13:46 | comment | added | Iosif Pinelis | @nuobeitang : Good point. I have made the corresponding changes. | |
Dec 8 at 13:46 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
added 61 characters in body
|
Dec 8 at 13:06 | comment | added | nuobei tang | In case2, you mean g(s)=1 may have no root. But if s < -$\lambda$ , will g(s)=1 may still have root? On this basis, my claim about the minimizer still holds in general? | |
Dec 8 at 12:49 | comment | added | nuobei tang | Thanks for such an explicit and clear explanation! | |
Dec 8 at 12:27 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
deleted 298 characters in body
|
Dec 8 at 5:50 | history | edited | Iosif Pinelis | CC BY-SA 4.0 |
added 146 characters in body
|
Dec 8 at 5:31 | history | answered | Iosif Pinelis | CC BY-SA 4.0 |