On the Convergence of the Proximal Point Algorithm for Convex Minimization

DOI10.1137/0329022zbMATH Open0737.90047OpenAlexW2099679613MaRDI QIDQ3978027FDOQ3978027

Authors: Osman Güler 

Publication date: 25 June 1992

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0329022

Recommendations

• Convergence of a proximal point algorithm for solving minimization problems
• A proximal point algorithm converging strongly to a minimizer of a convex function
• Convergence of some algorithms for convex minimization
• Convergence of the proximal point algorithm to approximate solutions of variational inequalities
• On the convergence of the proximal algorithm for saddle-point problems
• Convergence of generalized proximal point algorithms
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
• scientific article; zbMATH DE number 4043635
• Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

zbMATH Keywords

convex minimizationconvergence rateproximal point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (only showing first 100 items - show all)

• On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
• Mann-Type Steepest-Descent and Modified Hybrid Steepest-Descent Methods for Variational Inequalities in Banach Spaces
• Strong convergence theorems for quasi-nonexpansive mappings and maximal monotone operators in Hilbert spaces
• A modified regularization method for finding zeros of monotone operators in Hilbert spaces
• LQP method with a new optimal step size rule for nonlinear complementarity problems
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
• An iterative approximation method for a common fixed point of two pseudocontractive mappings
• Convergence theorems for maximal monotone operators and fixed point problems in Banach spaces
• Hybrid proximal-type algorithms for generalized equilibrium problems, maximal monotone operators, and relatively nonexpansive mappings
• A new proximal point iteration that converges weakly but not in norm
• Averaged mappings and the gradient-projection algorithm
• On generalized asymptotically quasi-\(\phi\)-nonexpansive mappings and a Ky Fan inequality
• A new logarithmic-quadratic proximal method for nonlinear complementarity problems
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• A regularization method for the proximal point algorithm
• A generalized forward-backward splitting method for solving quasi inclusion problems in Banach spaces
• Error sensitivity for strongly convergent modifications of the proximal point algorithm
• Approximation of a zero point of monotone operators with nonsummable errors
• Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
• A new iterative algorithm for common solutions of a finite family of accretive operators
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Viscosity approximations by generalized contractions for resolvents of accretive operators in Banach spaces
• Proximal splitting methods in signal processing
• Convergence analysis of some methods for minimizing a nonsmooth convex function
• Convergence of some algorithms for convex minimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• Strong convergence theorems for the general split variational inclusion problem in Hilbert spaces
• Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
• Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces
• Proximal point algorithms involving fixed points of nonexpansive mappings in \(\mathrm{CAT}(0)\) spaces
• A note on the regularized proximal point algorithm
• A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities
• Four parameter proximal point algorithms
• The asymptotic behavior of the composition of firmly nonexpansive mappings
• Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
• Strong convergence of a proximal-type algorithm for an occasionally pseudomonotone operator in Banach spaces
• Variable metric bundle methods: From conceptual to implementable forms
• Error bounds in mathematical programming
• On sufficient conditions ensuring the norm convergence of an iterative sequence to zeros of accretive operators
• A generalized hybrid steepest-descent method for variational inequalities in Banach spaces
• Hybrid shrinking projection method for a generalized equilibrium problem, a maximal monotone operator and a countable family of relatively nonexpansive mappings
• On convergence criteria of generalized proximal point algorithms
• Strong convergence of a proximal point algorithm with general errors
• The asymptotic behavior of the composition of two resolvents
• An accelerated inexact proximal point algorithm for convex minimization
• Projection and proximal point methods: Convergence results and counterexamples.
• Approximating solutions of maximal monotone operators in Hilbert spaces
• On the contraction-proximal point algorithms with multi-parameters
• Iterative schemes for generalized equilibrium problem and two maximal monotone operators
• Solving variational inequalities involving nonexpansive type mappings
• Strong and weak convergence theorems for common solutions of generalized equilibrium problems and zeros of maximal monotone operators
• Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
• The proximal point algorithm in metric spaces
• Iterative methods for a class of variational inequalities in Hilbert spaces
• Convergence of generalized proximal point algorithms
• On linear convergence of iterative methods for the variational inequality problem
• Composite iterative schemes for maximal monotone operators in reflexive Banach spaces
• The proximal point algorithm revisited
• Bregman weak relatively nonexpansive mappings in Banach spaces
• Strong convergence of a splitting algorithm for treating monotone operators
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Strong convergence theorems for approximating common fixed points of families of nonexpansive mappings and applications
• Convergence of Mann's type iteration method for generalized asymptotically nonexpansive mappings
• An LQP method for pseudomonotone variational inequalities
• Modified proximal-point method for nonlinear complementarity problems
• General split variational inclusion problem in Hilbert spaces
• Strong convergence of the CQ method for fixed point iteration processes
• A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
• Convergence theorems for maximal monotone operators, weak relatively nonexpansive mappings and equilibrium problems
• A customized proximal point algorithm for convex minimization with linear constraints
• Strong convergence theorems for common points of a finite family of accretive operators
• The contraction-proximal point algorithm with square-summable errors
• Hybrid Proximal-Type and Hybrid Shrinking Projection Algorithms for Equilibrium Problems, Maximal Monotone Operators, and Relatively Nonexpansive Mappings
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Strong convergence theorems for common zeros of a family of accretive operators
• A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces
• Iterative methods for strict pseudo-contractions in Hilbert spaces
• A new predicto-corrector method for pseudomonotone nonlinear complementarity problems
• Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
• Viscosity approximation methods for countable families of nonexpansive mappings in Banach spaces
• Generalized proximal point algorithms for multiobjective optimization problems
• Modified proximal point algorithms on Hadamard manifolds
• Convergence analysis of a proximal newton method¹
• A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
• Proximal Point Algorithm On Riemannian Manifolds
• Shrinking projection algorithm for solving a finite family of quasi-variational inclusion problems in Hadamard manifold
• Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
• New inertial method for generalized split variational inclusion problems
• Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces
• Parallel iterative methods for a finite family of sequences of nearly nonexpansive mappings in Hilbert spaces
• A Rate of Metastability for the Halpern Type Proximal Point Algorithm
• Viscosity approximation method with Meir-Keeler contractions for common zero of accretive operators in Banach spaces
• Two new self-adaptive algorithms for solving the split common null point problem with multiple output sets in Hilbert spaces
• Iteration process for fixed point problems and zeros of maximal monotone operators
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
• Inertial alternating generalized forward-backward splitting for image colorization
• A Strong Convergence Theorem for an Iterative Method for Finding Zeros of Maximal Monotone Maps with Applications to Convex Minimization and Variational Inequality Problems
• On the convergence of the forward-backward splitting method with linesearches

This page was built for publication: On the Convergence of the Proximal Point Algorithm for Convex Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978027)