Inexact proximal point methods in metric spaces
From MaRDI portal
Publication:763334
DOI10.1007/S11228-011-0185-9zbMATH Open1261.90040OpenAlexW2080387046MaRDI QIDQ763334FDOQ763334
Authors: Alexander J. Zaslavski 
Publication date: 9 March 2012
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-011-0185-9
Recommendations
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- Inexact and accelerated proximal point algorithms
- Strong convergence of two proximal point algorithms with possible unbounded error sequences
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A redistributed proximal bundle method for nonconvex optimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregman Monotone Optimization Algorithms
- Proximité et dualité dans un espace hilbertien
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
- Title not available (Why is that?)
- A class of variable metric decomposition methods for monotone variational inclusions
- Proximal point methods and nonconvex optimization
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
- The Proximal Average: Basic Theory
- Title not available (Why is that?)
- An inexact interior point proximal method for the variational inequality problem
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Title not available (Why is that?)
- Self-adaptive inexact proximal point methods
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
- Title not available (Why is that?)
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Convergence of a proximal-like algorithm in the presence of computational errors
- Generic Well-Posedness of Optimal Control Problems without Convexity Assumptions
- Well-posedness and porosity in optimal control without convexity assumptions
- A proximal point method in nonreflexive Banach spaces
- An infeasible interior proximal method for convex programming problems with linear constraints
- Uniformity and inexact version of a proximal method for metrically regular mappings
- Variational Principles and Well-Posedness in Optimization and Calculus of Variations
Cited In (12)
- Convergence of a proximal-like algorithm in the presence of computational errors
- Title not available (Why is that?)
- Old and new challenges in Hadamard spaces
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- The proximal point algorithm in metric spaces
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- An approximate exact penalty in constrained vector optimization on metric spaces
- Coercivity and generalized proximal algorithms: application -- traveling around the world
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- The developments of proximal point algorithms
- Inexact proximal point algorithms and descent methods in optimization
This page was built for publication: Inexact proximal point methods in metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763334)
