VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
Celotno besedilo
  • Regularization methods for semidefinite programming
    Malick, Jérôme ...
    We introduce a new class of algorithms for solving linear semidefinite programming (SDP) problems. Our approach is based on classical tools from convex optimization such as quadratic regularization ... and augmented Lagrangian techniques. We study the theoretical properties and we show that practical implementations behave very well on some instances of SDP having a large number of constraints. We also show that the "boundary point method" from Povh, Rendl, and Wiegele [Computing, 78 (2006), pp. 277-286] is an instance of this class.
    Vir: SIAM journal on optimization. - ISSN 1052-6234 (Vol. 20, no. 1, 2009, str. 336-356)
    Vrsta gradiva - članek, sestavni del
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15143257
vir: SIAM journal on optimization. - ISSN 1052-6234 (Vol. 20, no. 1, 2009, str. 336-356)
loading ...
loading ...