COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONVEX PROGRAMMING.

Barry W. Kort, Dimitri P. Bertsekas

Research output: Contribution to journalArticlepeer-review

42 Scopus citations

Abstract

A class of combined primal-dual and penalty methods for constrained minimization is proposed and analyzed, which generalizes the method of multipliers. A convergence and rate of convergence analysis is provided for these methods for the case of a convex programming problem. Global convergence is proved in the presence of both exact and inexact unconstrained minimization, and it is shown that the rate of convergence may be linear or superlinear with arbitrary Q-order of convergence depending on the problem at hand and the form of the penalty function employed.

Original languageEnglish (US)
Pages (from-to)268-294
Number of pages27
JournalSIAM Journal on Control and Optimization
Volume14
Issue number2
DOIs
StatePublished - 1976
Externally publishedYes

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONVEX PROGRAMMING.'. Together they form a unique fingerprint.

Cite this