Showing 1 - 10 of 11
<Para ID="Par1">In this paper an exterior point polynomial time algorithm for convex quadratic programming problems is proposed. We convert a convex quadratic program into an unconstrained convex program problem with a self-concordant objective function. We show that, only with duality, the Path-following...</para>
Persistent link: https://www.econbiz.de/10011241265
continuous Hessian. These methods are based on the quadratic regularization of Newton’s method, with algebraic explicit rules for …
Persistent link: https://www.econbiz.de/10011241274
Regularization methods for inverse problems formulated in Hilbert spaces usually give rise to over-smoothness, which … hand, regularization methods recently introduced in Banach spaces allow in general to obtain better localization and …
Persistent link: https://www.econbiz.de/10010998292
theoretical results are finally applied to an l <Subscript>1</Subscript> regularization problem arising in image processing …
Persistent link: https://www.econbiz.de/10010998330
Persistent link: https://www.econbiz.de/10010998334
Persistent link: https://www.econbiz.de/10010998358
Persistent link: https://www.econbiz.de/10004995502
Persistent link: https://www.econbiz.de/10008533943
Persistent link: https://www.econbiz.de/10010539368
Persistent link: https://www.econbiz.de/10009325274