Proximal Methods for Cohypomonotone Operators
cohypomonotone operatorcommon zero problemhypomonotone operatormethod of multipliersnonlinear programmingproximal point methodweak convergence
Set-valued operators (47H04) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Nonsmooth analysis (49J52) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
The paper under review is a valuable contribution to nonlinear functional analysis and, in particular, algorithms for finding a zero of one (or several) operator(s) \(A\) in a Hilbert space. While the first approach is given by step-wise matrix multiplication with the inverse operator of \(\text{Id} + A\), more refined versions are presented by the proximal point iteration with a ``small additive term per iterate included, by the relaxed version of this one and, finally, by replacing \(A\) with a member of a countable family of operators \(A_i\) which may even be set-valued. Hence, the zero problem is of inclusion form. The author's first algorithm refers to such a generalized version, where the operators are assumed to be maximally monotone and bounds are given on the sequences of parameters, e.g., to the model errors. Then, every such orbit converges weakly to a point in the common zero set of the operators. Further important results of such a convergence type are obtained by studying special classes of operators. In fact, there are (\(\rho\)-)cohypomonotone operators which become well-introduced and investigated. The corresponding proximal iteration theorem with its special assumptions, e.g., concerning the parameter \(\rho\), are carefully stated and proved. The paper ends with an application of the author's approach to nonlinear programming (in Euclidean space) with finitely many equality and inequality constraints. Here, the algorithm is well-related with the optimization terminology, e.g., a KKT system in inclusion form and a strong second sufficient order condition is provided in order to conclude convergence.
- Approximating zeros of monotone operators by proximal point algorithms
- Iterative Algorithms for Nonlinear Operators
- A proximal point method involving two resolvent operators
- Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- A parameterized proximal point algorithm for separable convex optimization
- Solving composite fixed point problems with block updates
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- An adaptive alternating direction method of multipliers
- An extension of the proximal point algorithm beyond convexity
- Conical averagedness and convergence analysis of fixed point algorithms
- On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space
- On strongly quasiconvex functions: existence results and proximal point algorithms
- On compositions of special cases of Lipschitz continuous operators
- Demiclosedness principles for generalized nonexpansive mappings
- Generalized monotone operators and their averaged resolvents
- About proximal-type methods for a class of nonmonotone operators
- Rectifiability of self-contracted curves in the Euclidean space and applications
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Self-adaptive inexact proximal point methods
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A proximal method for composite minimization
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology†
- A remark on the convergence of the Tikhonov regularization without monotonicity
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint
- scientific article; zbMATH DE number 7289893 (Why is no real title available?)
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- On Proximal Algorithms with Inertial Effects Beyond Monotonicity
- Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems
- 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
- Split common null point problem for generalized monotone operators
- Convergence of the Chambolle-Pock algorithm in the absence of monotonicity
- Revisiting extragradient-type methods. I: Generalizations and sublinear convergence rates
- Nonlinear preconditioned primal-dual method with projection for nonconvex-nonconcave minimax problems
- On Tikhonov-regularized doubly nonlinear dynamics with dry friction for maximal comonotone inclusions
- Local linear convergence for alternating and averaged nonconvex projections
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
This page was built for publication: Proximal Methods for Cohypomonotone Operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652557)