Convex Programming Multiplier Methods
Mostrando 1-1 de 1 artigos, teses e dissertações.
-
1. Métodos de penalidade e barreira para programação convexa semidefinida / Penalty / barrier methods for convex semidefinite programming
This work deals with multiplier methods to solve semidefinite convex programming problems and the analysis of their proprieties based on the proximal point method applied on the dual problem. We focus on a subclass of semidefinite programming problems with affine constraints, for which we study duality relations an conditions for the existence of solutions o
Publicado em: 2009