Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization

DOI10.1007/s12215-017-0318-6zbMath1401.90233arXiv1610.01871OpenAlexW3102079814MaRDI QIDQ1783579

Simeon Reich, Daniel Reem

Publication date: 21 September 2018

Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01871

zbMATH Keywords

resolventinexactmaximally monotone operatorzeroinclusionalgorithmic schemefully Legendre functionprotoresolventwell defined

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37)

Related Items

Generalized equilibrium and fixed point problems for Bregman relatively nonexpansive mappings in Banach spaces ⋮ A convergence theorem for solving generalized mixed equilibrium problems and finding fixed points of a weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ Convergence of two simple methods for solving monotone inclusion problems in reflexive Banach spaces ⋮ Mann-type algorithms for solving the monotone inclusion problem and the fixed point problem in reflexive Banach spaces ⋮ Alternating forward-backward splitting for linearly constrained optimization problems ⋮ Inertial splitting methods without prior constants for solving variational inclusions of two operators ⋮ Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces ⋮ Inertial‐like Bregman projection method for solving systems of variational inequalities ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Unnamed Item ⋮ A strong convergence theorem for a finite family of Bregman demimetric mappings in a Banach space under a new shrinking projection method ⋮ A cyclic iterative method for solving a class of variational inequalities in Hilbert spaces ⋮ On the generalized Bregman projection operator in reflexive Banach spaces ⋮ A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces ⋮ A strong convergence theorem for Bregman quasi-noexpansive mappings with applications ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption ⋮ A strong convergence theorem for approximation of a zero of the sum of two maximal monotone mappings in Banach spaces ⋮ On the strong convergence of the proximal point algorithm with an application to Hammerstein euations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal point nonlinear rescaling method for convex optimization
• Right Bregman nonexpansive operators in Banach spaces
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
• On the convergence of inexact proximal point algorithm on Hadamard manifolds
• Some inexact hybrid proximal augmented Lagrangian algorithms
• Resolvents of set-valued monotone vector fields in Hadamard manifolds
• Inexact proximal point methods in metric spaces
• Convex analysis and nonlinear optimization. Theory and examples.
• Proximal methods in reflexive Banach spaces without monotonicity
• A proximal point algorithm for DC functions on Hadamard manifolds
• On the proximal point algorithm
• Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
• An inexact interior point proximal method for the variational inequality problem
• Functional analysis, Sobolev spaces and partial differential equations
• Monotone (nonlinear) operators in Hilbert space
• An iterative row-action method for interval convex programming
• Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces
• Geometry of Banach spaces. Selected topics
• Produits infinis de resolvantes
• Approximate iterations in Bregman-function-based proximal algorithms
• A logarithmic-quadratic proximal method for variational inequalities
• Proximal minimization algorithm with \(D\)-functions
• Enlargement of monotone operators with applications to variational inequalities
• A strongly convergent hybrid proximal method in Banach spaces.
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• Rate of convergence for proximal point algorithms on Hadamard manifolds
• The proximal point algorithm in metric spaces
• Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
• An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities
• Fixed-point methods for a certain class of operators
• Set-valued mappings and enlargement of monotone operators.
• From Hahn--Banach to monotonicity
• \(c_ p\)
• On the maximal monotonicity of subdifferential mappings
• Uniformity and inexact version of a proximal method for metrically regular mappings
• A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
• Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
• An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
• Convex analysis and optimization in Hadamard spaces
• The Bregman Distance without the Bregman Function II
• Three Strong Convergence Theorems Regarding Iterative Methods for Solving Equilibrium Problems in Reflexive Banach Spaces
• The Legendre Transformation in Modern Optimization
• Proximal Methods with Penalization Effects in Banach Spaces
• A Generalization of the Proximal Point Algorithm
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• Perturbation resilience and superiorization of iterative algorithms
• Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
• A Class of Inexact Variable Metric Proximal Point Algorithms
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Bregman Monotone Optimization Algorithms
• ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Robustness of the hybrid extragradient proximal-point algorithm.

This page was built for publication: Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization