Optimization Online


Primal-dual regularized SQP and SQCQP type methods for convex programming and their complexity analysis

Maicon Marques Alves(maicon.alves***at***ufsc.br)
Renato D. C. Monteiro(renato.monteiro***at***isye.gatech.edu)
Benar Fux Svaiter(benar***at***impa.br)

Abstract: This paper presents and studies the iteration-complexity of two new inexact variants of Rockafellar's proximal method of multipliers (PMM) for solving convex programming (CP) problems with a fi nite number of functional inequality constraints. In contrast to the first variant which solves convex quadratic programming (QP) subproblems at every iteration, the second one solves convex constrained quadratic QP subproblems. Their complexity analysis are performed by: a) viewing the original CP problem as a monotone inclusion problem (MIP); b) proposing a largestep inexact higher-order proximal extragradient framework for MIPs, and; c) showing that the above two PMM variants are just instances of this framework.

Keywords: Convex programming; proximal method of multipliers; complexity; SQP

Category 1: Convex and Nonsmooth Optimization


Download: [PDF]

Entry Submitted: 05/09/2014
Entry Accepted: 05/09/2014
Entry Last Modified: 05/09/2014

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 Optimization Society