On the Convergence of the Proximal Point Algorithm for Convex Minimization

DOI10.1137/0329022MaRDI QIDQ3978027zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

convergence rateconvex minimizationproximal point algorithm

Mathematics Subject Classification ID

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

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

Cited in

(only showing first 100 items - show all)

• A new iterative algorithm for common solutions of a finite family of accretive operators
• A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
• Viscosity approximations by generalized contractions for resolvents of accretive operators in Banach spaces
• Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
• Hybrid proximal-point methods for common solutions of equilibrium problems and zeros of maximal monotone operators
• Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
• Convergence analysis of some methods for minimizing a nonsmooth convex function
• Prox-regularization and solution of ill-posed elliptic variational inequalities
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Augmented Lagrangian algorithms for linear programming
• Convergence of some algorithms for convex minimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• Variable metric bundle methods: From conceptual to implementable forms
• Error bounds in mathematical programming
• Coupling the proximal point algorithm with approximation methods
• Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
• A strongly convergent hybrid proximal method in Banach spaces.
• Projection and proximal point methods: Convergence results and counterexamples.
• On the need for hybrid steps in hybrid proximal point methods
• Cosmic divergence, weak cosmic convergence, and fixed points at infinity
• Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces
• An abstract proximal point algorithm
• Implicit error bounds for Picard iterations on Hilbert spaces
• A simplified view of first order methods for optimization
• Monotone operator theory in convex optimization
• Iterative methods for solving quasi-variational inclusion and fixed point problem in \(q\)-uniformly smooth Banach spaces
• Convergence theorems of common elements for pseudocontractive mappings and monotone mappings
• The viscosity approximation forward-backward splitting method for zeros of the sum of monotone operators
• Iterative methods for a class of variational inequalities in Hilbert spaces
• On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
• Zero point problem of accretive operators in Banach spaces
• General split variational inclusion problem in Hilbert spaces
• Convergence of first-order methods via the convex conjugate
• General proximal-point algorithm for monotone operators
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Approximation common zero of two accretive operators in Banach spaces
• On the zero point problem of monotone operators in Hadamard spaces
• A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings
• A fixed point method for solving a split feasibility problem in Hilbert spaces
• On the optimal linear convergence rate of a generalized proximal point algorithm
• Iterative methods for zeros of a monotone variational inclusion in Hilbert spaces
• Convergence theorems for maximal monotone operators, weak relatively nonexpansive mappings and equilibrium problems
• Convergence of generalized proximal point algorithms
• Weak and strong convergence theorems for maximal monotone operators in a Banach space
• Common zero for a finite family of monotone mappings in Hadamard spaces with applications
• Approximating solutions of maximal monotone operators in Hilbert spaces
• The adventures of a simple algorithm
• On linear convergence of iterative methods for the variational inequality problem
• Generalized proximal point algorithm for convex optimization
• On the contraction-proximal point algorithms with multi-parameters
• An accelerated inexact proximal point algorithm for convex minimization
• Strong convergence of a proximal point algorithm with bounded error sequence
• Strong convergence of a regularization method for Rockafellar's proximal point algorithm
• Composite iterative schemes for maximal monotone operators in reflexive Banach spaces
• The proximal point algorithm in metric spaces
• Shrinking projection algorithm for solving a finite family of quasi-variational inclusion problems in Hadamard manifold
• Parallel iterative methods for a finite family of sequences of nearly nonexpansive mappings in Hilbert spaces
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
• Inertial alternating generalized forward-backward splitting for image colorization
• Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
• Approximation of zeros of bounded maximal monotone mappings, solutions of Hammerstein integral equations and convex minimization problems
• A general self-adaptive relaxed-PPA method for convex programming with linear constraints
• Viscosity approximation method with Meir-Keeler contractions for common zero of accretive operators in Banach spaces
• Weak convergence of an extended splitting method for monotone inclusions
• Monotone inclusion problem and fixed point problem of a generalized demimetric mapping in CAT(0) spaces
• Quantitative results on a Halpern-type proximal point algorithm
• Forward-backward approximation of nonlinear semigroups in finite and infinite horizon
• Metastability of the proximal point algorithm with multi-parameters
• A strongly convergent proximal point method for vector optimization
• Quantitative translations for viscosity approximation methods in hyperbolic spaces
• Approximate solution of zero point problem involving H-accretive maps in Banach spaces and applications
• New strong convergence method for the sum of two maximal monotone operators
• An inertial extrapolation method for multiple-set split feasibility problem
• Strong convergence of an inertial projection and contraction method with self adaptive stepsize for pseudomonotone variational inequalities and fixed point problems
• A new splitting method for systems of monotone inclusions in Hilbert spaces
• Modified proximal point methods involving quasi-pseudocontractive mappings in Hadamard spaces
• On the nonexpansive operators based on arbitrary metric: a degenerate analysis
• An extension of the proximal point algorithm beyond convexity
• On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space
• Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling
• On minimization and fixed point problems in Hadamard spaces
• Convergence results of iterative algorithms for the sum of two monotone operators in reflexive Banach spaces.
• Computing dynamic user equilibrium on large-scale networks without knowing global parameters
• Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
• Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces
• Local convergence of tensor methods
• The developments of proximal point algorithms
• The projected polar proximal point algorithm converges globally
• Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
• Abstract strongly convergent variants of the proximal point algorithm
• An inertial parallel algorithm for a finite family of \(G\)-nonexpansive mappings with application to the diffusion problem
• General-type proximal point algorithm for solving inclusion and fixed point problems with composite operators
• Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
• A viscosity iterative algorithm for a family of monotone inclusion problems in an Hadamard space
• New algorithms for a class of accretive variational inequalities in Banach spaces
• A self-adaptive inertial subgradient extragradient method for pseudomonotone equilibrium and common fixed point problems
• On generalized Bregman nonspreading mappings and zero points of maximal monotone operator in a reflexive Banach space
• Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
• Accelerated proximal point method for maximally monotone operators

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)