Inexact proximal point methods in metric spaces
type: Item
instance of: scholarly article
title: Inexact proximal point methods in metric spaces
zbMATH Open document ID: 1261.90040
published in: Set-Valued and Variational Analysis
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 6013488
zbMATH Keywords: computational error
zbMATH Keywords: metric space
zbMATH Keywords: proximal method
zbMATH Keywords: well-posed problem
author: Alexander J. Zaslavski
MaRDI profile type: Publication
full work available at URL: s11228-011-0185-9
OpenAlex ID: W2080387046
cites work: Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
cites work: Uniformity and inexact version of a proximal method for metrically regular mappings
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Bregman Monotone Optimization Algorithms
cites work: The Proximal Average: Basic Theory
cites work: Q5580053
cites work: An inexact interior point proximal method for the variational inequality problem
cites work: A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
cites work: Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
cites work: A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
cites work: Q3173954
cites work: Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
cites work: Self-adaptive inexact proximal point methods
cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization
cites work: Variational Principles and Well-Posedness in Optimization and Calculus of Variations
cites work: Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
cites work: A proximal point method in nonreflexive Banach spaces
cites work: Q4295274
cites work: Proximal point methods and nonconvex optimization
cites work: Q3794783
cites work: Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
cites work: Q3035147
cites work: Q5852067
cites work: Proximité et dualité dans un espace hilbertien
cites work: Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
cites work: Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: An infeasible interior proximal method for convex programming problems with linear constraints
cites work: Generic Well-Posedness of Optimal Control Problems without Convexity Assumptions
cites work: Well-posedness and porosity in optimal control without convexity assumptions
cites work: Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
cites work: Convergence of a proximal-like algorithm in the presence of computational errors
cites work: The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
cites work: Maximal monotone operators and the proximal point algorithm in the presence of computational errors
DOI: 10.1007/S11228-011-0185-9
description: scientific article; zbMATH DE number 6013488