Convergence of Proximal-Like Algorithms

Authors:
Marc Teboulle
Affiliations:
-
Venue:
SIAM Journal on Optimization
Year:
1997

Citing 0
Cited 16

A Logarithmic-Quadratic Proximal Method for Variational Inequalities

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Data Driven Similarity Measures for k-Means Like Clustering Algorithms

Information Retrieval
A Logarithmic-Quadratic Proximal Prediction-Correction Method for Structured Monotone Variational Inequalities

Computational Optimization and Applications
Modified proximal-point method for nonlinear complementarity problems

Journal of Computational and Applied Mathematics
A Unified Continuous Optimization Framework for Center-Based Clustering Methods

The Journal of Machine Learning Research
A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems

Computers & Mathematics with Applications
A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods

Journal of Global Optimization
A generalized proximal-point-based prediction-correction method for variational inequality problems

Journal of Computational and Applied Mathematics
A new predicto-corrector method for pseudomonotone nonlinear complementarity problems

International Journal of Computer Mathematics
Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities

Computational Optimization and Applications
On the choice of explicit stabilizing terms in column generation

Discrete Applied Mathematics
Approximating zeros of monotone operators by proximal point algorithms

Journal of Global Optimization
An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming

Computational Optimization and Applications
Inexact Proximal Point Methods for Variational Inequality Problems

SIAM Journal on Optimization
An improved proximal alternating direction method for monotone variational inequalities with separable structure

Computational Optimization and Applications
An inexact LQP alternating direction method for solving a class of structured variational inequalities

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze proximal methods based on entropy-like distances for the minimization of convex functions subject to nonnegativity constraints. We prove global convergence results for the methods with approximate minimization steps and an ergodic convergence result for the case of finding a zero of a maximal monotone operator. We also consider linearly constrained convex problems and establish a quadratic convergence rate result for linear programs. Our analysis allows us to simplify and extend the available convergence results for these methods.