Inexact Variants of the Proximal Point Algorithm without Monotonicity
From MaRDI portal
hybrid proximal-extragradient algorithmshypomonotone operatorsinexact iteratesmultiplier methodsproximal point algorithms
Set-valued and variational analysis (49J53) Numerical optimization and variational techniques (65K10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48)
Recommendations
- Inexact and accelerated proximal point algorithms
- Inexact proximal point methods for variational inequality problems
- Inexact Halpern-type proximal point algorithm
- Inexact proximal point algorithms and descent methods in optimization
- scientific article; zbMATH DE number 2109090
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Relatively inexact proximal point algorithm and linear convergence analysis
- Inexact A-proximal point algorithm and applications to nonlinear variational inclusion problems
- Inexact proximal point method for general variational inequalities
- Inexact inertial proximal algorithm for maximal monotone operators
Cited in
(69)- Metric subregularity and the proximal point method
- A strongly convergent hybrid proximal method in Banach spaces.
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- On the need for hybrid steps in hybrid proximal point methods
- An abstract proximal point algorithm
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- An extension of the proximal point algorithm beyond convexity
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Generalized monotone operators and their averaged resolvents
- Games and cost of change
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- About proximal-type methods for a class of nonmonotone operators
- Convergence analysis of an inexact three-operator splitting algorithm
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Fixed-point methods for a certain class of operators
- Self-adaptive inexact proximal point methods
- A new relative error criterion for the proximal point algorithm
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
- Uniformity and inexact version of a proximal method for metrically regular mappings
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A proximal method for composite minimization
- On the proximal point method for equilibrium problems in Hilbert spaces
- Revisit the over-relaxed proximal point algorithm
- Global convergence of a proximal linearized algorithm for difference of convex functions
- A Class of Inexact Variable Metric Proximal Point Algorithms
- About the relaxed cocoercivity and the convergence of the proximal point algorithm
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Proximal Methods for Cohypomonotone Operators
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Proximal point method for quasi-equilibrium problems in Banach spaces
- On diametrically maximal sets, premonotone operators and premonotone bifunctions
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- Approximation of Fixed Points of Metrically Regular Mappings
- scientific article; zbMATH DE number 2228225 (Why is no real title available?)
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error
- Robustness of the hybrid extragradient proximal-point algorithm.
- On e-convex functions and e-subdifferentials in locally convex spaces
- On Proximal Algorithms with Inertial Effects Beyond Monotonicity
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- scientific article; zbMATH DE number 7733450 (Why is no real title available?)
- Local search proximal algorithms as decision dynamics with costs to move
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
- Local linear convergence of approximate projections onto regularized sets
- Some recent results on premonotone operators
- Convergence of a class of algorithms with the level-set subdifferential error bound
- Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity
- A Bregman proximal point algorithm without convexity in Banach spaces
- Solving non-monotone inclusions using monotonicity of pairs of operators
- Hybrid proximal methods for equilibrium problems
- A Lyusternik-Graves theorem for the proximal point method
- Convergence of the Chambolle-Pock algorithm in the absence of monotonicity
- A resolvent computational-free algorithm for solving monotone inclusion problems with applications
- Local linear convergence for alternating and averaged nonconvex projections
- A framework for analyzing local convergence properties with applications to proximal-point algorithms
- Proximal methods in reflexive Banach spaces without monotonicity
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
This page was built for publication: Inexact Variants of the Proximal Point Algorithm without Monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441938)
