Inexact Variants of the Proximal Point Algorithm without Monotonicity

From MaRDI portal
Publication:4441938

DOI10.1137/S1052623401399587zbMath1053.90134OpenAlexW2005669112MaRDI QIDQ4441938

Teemu Pennanen, Alfredo Noel Iusem, Benar Fux Svaiter

Publication date: 19 January 2004

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

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



Related Items

On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, A new approach to the proximal point method: convergence on general Riemannian manifolds, An abstract proximal point algorithm, Local linear convergence for alternating and averaged nonconvex projections, A proximal method for composite minimization, Revisit the over-relaxed proximal point algorithm, Global convergence of a proximal linearized algorithm for difference of convex functions, Uniformity and inexact version of a proximal method for metrically regular mappings, A framework for analyzing local convergence properties with applications to proximal-point algorithms, Proximal methods in reflexive Banach spaces without monotonicity, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, About the relaxed cocoercivity and the convergence of the proximal point algorithm, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, On e-convex functions and e-subdifferentials in locally convex spaces, An inexact proximal method with proximal distances for quasimonotone equilibrium problems, On Proximal Algorithms with Inertial Effects Beyond Monotonicity, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Local search proximal algorithms as decision dynamics with costs to move, Proximal Point Method for Quasi-Equilibrium Problems in Banach Spaces, On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions, Fixed-point methods for a certain class of operators, Unnamed Item, Local linear convergence of approximate projections onto regularized sets, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, Generalized monotone operators and their averaged resolvents, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, Games and cost of change, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, Self-adaptive inexact proximal point methods, Hybrid proximal methods for equilibrium problems, A Lyusternik-Graves theorem for the proximal point method, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity, On the proximal point method for equilibrium problems in Hilbert spaces, About proximal-type methods for a class of nonmonotone operators, Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, Approximation of Fixed Points of Metrically Regular Mappings, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings, Convergence analysis of an inexact three-operator splitting algorithm, An extension of the proximal point algorithm beyond convexity, On strongly quasiconvex functions: existence results and proximal point algorithms