Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||ON THE RESOLUTION OF LINEARLY CONSTRAINED CONVEX MINIMIZATION PROBLEMS|
|Abstract:||The problem of minimizing a twice differentiable convex function f is considered, subject to Ax = b, x greater than or equal to 0, where A is an element of IR(MxN), M, N are large and the feasible region is bounded. It is proven that this problem is equivalent to a ''primal-dual'' box-constrained problem With 2N + M variables. The equivalent problem involves neither penalization parameters nor ad hoc multiplier estimators. This problem is solved using an algorithm for bound constrained minimization that can deal with many variables. Numerical experiments are presented.|
|Subject:||LARGE-SCALE LINEARLY CONSTRAINED OPTIMIZATION|
|Citation:||Siam Journal On Optimization. Siam Publications, v. 4, n. 2, n. 331, n. 339, 1994.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.