Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
Authors:
- 1 August 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 24 (3) , 645-668
Abstract
We study a class of interior proximal algorithms and nonquadratic multiplier methods for solving convex programs, where the usual proximal quadratic term is replaced by an homogeneous functional of order two, defined in terms of a convex function. We prove, under mild assumptions, several new convergence results in both the primal and dual framework allowing also for approximate minimization. In particular, we introduce a new class of interior proximal methods which is globally convergent and allows for generating C ∞ multiplier methods with bounded Hessians which exhibit strong convergence properties. We also consider linearly constrained convex problems and establish global quadratic convergence rates results for linear programs. We then study in detail a particular realization of these algorithms, leading to a new class of logarithmic-quadratic interior point algorithms which are shown to enjoy several attractive properties for solving constrained convex optimization problems.Keywords
This publication has 21 references indexed in Scilit:
- A Logarithmic-Quadratic Proximal Method for Variational InequalitiesComputational Optimization and Applications, 1999
- Proximal Minimization Methods with Generalized Bregman FunctionsSIAM Journal on Control and Optimization, 1997
- Penalty/Barrier Multiplier Methods for Convex Programming ProblemsSIAM Journal on Optimization, 1997
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear ProgrammingMathematics of Operations Research, 1997
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalitiesMathematical Programming, 1995
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear ProgrammingMathematics of Operations Research, 1995
- Entropy-Like Proximal Methods in Convex ProgrammingMathematics of Operations Research, 1994
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Multiplicative iterative algorithms for convex programmingLinear Algebra and its Applications, 1990
- Nonlinear Programming1990