Optimization Online


A New Class of Interior Proximal Methods for Optimization over the Positive Orthant

Sissy da S. Souza (sissysouz***at***gmail.com)
P. Roberto Oliveira (poliveir***at***cos.ufrj.br)

Abstract: In this work we present a family of variable metric interior proximal methods for solving optimization problems under nonnegativity constraints. We define two algorithms, in the inexact and exact forms. The kernels are metrics generated by diagonal matrices in each iteration and the regularization parameters are conveniently chosen to force the iterates to be interior points. We show the well definedness of the algorithms and we establish weak convergence to the solution set of the problem.

Keywords: interior point algorithms, proximal methods, variable metric, optimization problems.

Category 1: Convex and Nonsmooth Optimization

Category 2: Nonlinear Optimization

Citation: PESC/COPPE-Federal University of Rio de Janeiro, CP 68511, 21945-970, Rio de Janeiro, RJ, Brazil, 10/2006


Entry Submitted: 10/10/2006
Entry Accepted: 10/10/2006
Entry Last Modified: 02/27/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society