The perturbed proximal point algorithm and some of its applications
From MaRDI portal
Publication:1317307
DOI10.1007/BF01204180zbMath0791.65039OpenAlexW1993305160MaRDI QIDQ1317307
Publication date: 7 July 1994
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01204180
stabilityvariational inequalitiesnumerical resultsperturbationregularizationfixed pointHilbert spacemaximal monotone operatorproximal point algorithm
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
Iterative Methods for the Elastography Inverse Problem of Locating Tumors, Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework, Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems, Convergence of a proximal point algorithm for maximal monotone operators in Hilbert spaces, New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems, The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces, Relatively inexact proximal point algorithm and linear convergence analysis, Inexact \(A\)-proximal point algorithm and applications to nonlinear variational inclusion problems, A generalized hybrid steepest-descent method for variational inequalities in Banach spaces, Rockafellar's celebrated theorem based on \(A\)-maximal monotonicity design, Solving monotone inclusions via compositions of nonexpansive averaged operators, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Hybrid inexact proximal point algorithms based on RMM frameworks with applications to variational inclusion problems, The perturbed Tikhonov's algorithm and some of its applications, Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design, A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces, Modified proximal point algorithms on Hadamard manifolds, On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework, Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions, General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces, Proximal Methods for the Elastography Inverse Problem of Tumor Identification Using an Equation Error Approach, Hierarchical Minimization Problems and Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalty-proximal methods in convex programming
- Penalization in non-classical convex programming via variational convergence
- An exponential penalty method for nondifferentiable minimax problems with general constraints
- Variational metric and exponential penalization
- On the maximal monotonicity of subdifferential mappings
- On the monotonicity of the gradient of a convex function
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- On exponential penalty function methods1
- Isometries for the Legendre-Fenchel Transform
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Convex Analysis