Inexact proximal point methods in metric spaces
From MaRDI portal
Publication:763334
DOI10.1007/s11228-011-0185-9zbMath1261.90040OpenAlexW2080387046MaRDI QIDQ763334
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
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Programming in abstract spaces (90C48)
Related Items
The developments of proximal point algorithms ⋮ Old and new challenges in Hadamard spaces ⋮ The proximal point algorithm in metric spaces ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ An approximate exact penalty in constrained vector optimization on metric spaces ⋮ Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of a proximal-like algorithm in the presence of computational errors
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
- An inexact interior point proximal method for the variational inequality problem
- Proximal point methods and nonconvex optimization
- A proximal point method in nonreflexive Banach spaces
- Self-adaptive inexact proximal point methods
- Uniformity and inexact version of a proximal method for metrically regular mappings
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- 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
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- The Proximal Average: Basic Theory
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregman Monotone Optimization Algorithms
- Generic Well-Posedness of Optimal Control Problems without Convexity Assumptions
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Variational Principles and Well-Posedness in Optimization and Calculus of Variations
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- Proximité et dualité dans un espace hilbertien
- Well-posedness and porosity in optimal control without convexity assumptions
