On the public citation graph
The perturbed proximal point algorithm and some of its applications
0 signed · 57 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-9297-1_12openalex-snapshot
Coupling optimization methods and variational convergence
inferredcites →https://doi.org/10.1007/bf00933227openalex-snapshot
An exponential penalty method for nondifferentiable minimax problems with general constraints
inferredcites →https://doi.org/10.1007/bf00939042openalex-snapshot
Penalty-proximal methods in convex programming
inferredcites →https://doi.org/10.1007/bf00939743openalex-snapshot
Variational metric and exponential penalization
inferredcites →https://doi.org/10.1007/bf01582147openalex-snapshot
Quantitative stability of variational systems: III.ε-approximate solutions
inferredcites →https://doi.org/10.1007/bf01586942openalex-snapshot
Penalization in non-classical convex programming via variational convergence
inferredcites →https://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7125-7openalex-snapshot
Operateurs Maximaux Monotones - Et Semi-Groupes De Contractions Dans Les Espaces De Hilbert
inferredcites →https://doi.org/10.1080/02331938008842634openalex-snapshot
On exponential penalty function methods1
inferredcites →https://doi.org/10.1090/s0002-9947-1986-0837797-xopenalex-snapshot
Isometries for the Legendre-Fenchel Transform
inferredcites →https://doi.org/10.1090/s0002-9947-1991-1018570-0openalex-snapshot
Quantitative stability of variational systems. I. The epigraphical distance
inferredcites →https://doi.org/10.1137/0312052openalex-snapshot
A Class of Exponential Penalty Functions
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0328051openalex-snapshot
A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
inferredcites →https://doi.org/10.1137/0803016openalex-snapshot
Quantitative Stability of Variational Systems II. A Framework for Nonlinear Conditioning
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.2140/pjm.1964.14.243openalex-snapshot
On the monotonicity of the gradient of a convex function
inferredcites →https://doi.org/10.2140/pjm.1970.33.209openalex-snapshot
On the maximal monotonicity of subdifferential mappings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_22openalex-snapshot
A Comparison of Rates of Convergence of Two Inexact Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-14490-0_7openalex-snapshot
Proximal Methods for the Elastography Inverse Problem of Tumor Identification Using an Equation Error Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-31338-2_6openalex-snapshot
Iterative Methods for the Elastography Inverse Problem of Locating Tumors
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_6openalex-snapshot
Relaxed Assumptions for Iteration Methods
inferred← citeshttps://doi.org/10.1007/978-81-322-1883-8_7openalex-snapshot
Hierarchical Minimization Problems and Applications
inferred← citeshttps://doi.org/10.1007/s10107-002-0366-2openalex-snapshot
Solving monotone inclusions with linear multi-step methods
inferred← citeshttps://doi.org/10.1007/s10107-003-0374-xopenalex-snapshot
A practical general approximation criterion for methods of multipliers based on Bregman distances
inferred← citeshttps://doi.org/10.1007/s101070050022openalex-snapshot
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
inferred← citeshttps://doi.org/10.1007/s10898-011-9647-8openalex-snapshot
The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10957-009-9615-3openalex-snapshot
Inexact A-Proximal Point Algorithm and Applications to Nonlinear Variational Inclusion Problems
inferred← citeshttps://doi.org/10.1007/s11117-008-2268-xopenalex-snapshot
General proximal point algorithm involving η-maximal accretiveness framework in Banach spaces
inferred← citeshttps://doi.org/10.1007/s12190-011-0529-5openalex-snapshot
Hybrid inexact proximal point algorithms based on RMM frameworks with applications to variational inclusion problems
inferred← citeshttps://doi.org/10.1016/j.amc.2010.08.048openalex-snapshot
New approach to the η-proximal point algorithm and nonlinear variational inclusion problems
inferred← citeshttps://doi.org/10.1016/j.aml.2007.05.004openalex-snapshot
Rockafellar’s celebrated theorem based on A -maximal monotonicity design
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.04.026openalex-snapshot
Generalized Eckstein–Bertsekas proximal point algorithm based on A -maximal monotonicity design
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.633openalex-snapshot
Input-to-State Stability of a Bilevel Proximal Gradient Descent Algorithm*
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.09.019openalex-snapshot
Generalized Eckstein–Bertsekas proximal point algorithm involving (H,η) -monotonicity framework
inferred← citeshttps://doi.org/10.1016/j.nahs.2008.09.001openalex-snapshot
On Rockafellar’s theorem using proximal point algorithm involving H -maximal monotonicity framework
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80026-4openalex-snapshot
On the Relation Between Bundle Methods for Maximal Monotone Inclusions and Hybrid Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008777829180openalex-snapshot
A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator
inferred← citeshttps://doi.org/10.1023/a:1022687412779openalex-snapshot
Conditioning and Upper-Lipschitz Inverse Subdifferentials in Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1051/m2an/1994280201891openalex-snapshot
The perturbed Tikhonov's algorithm and some of its applications
inferred← citeshttps://doi.org/10.1080/02331930412331327157openalex-snapshot
Solving monotone inclusions via compositions of nonexpansive averaged operators
inferred← citeshttps://doi.org/10.1080/02331934.2010.505962openalex-snapshot
Modified proximal point algorithms on Hadamard manifolds
inferred← citeshttps://doi.org/10.1081/nfa-100108320openalex-snapshot
A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS *
inferred← citeshttps://doi.org/10.1112/s0024610702003332openalex-snapshot
Iterative Algorithms for Nonlinear Operators
inferred← citeshttps://doi.org/10.1137/070688146openalex-snapshot
A Class of Inexact Variable Metric Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1155/2009/691952openalex-snapshot
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
inferred← citeshttps://doi.org/10.1155/2009/957407openalex-snapshot
Super-Relaxed ("Equation missing" <!-- No EquationSource Format="TEX", only image -->)-Proximal Point Algorithms, Relaxed ("Equation missing" <!-- No EquationSource Format="TEX", only image -->)-Proximal Point Algorithms, Linear Convergence Analysis, and Nonlinear Variational Inclusions
inferred← citeshttps://doi.org/10.1155/2011/754702openalex-snapshot
A Generalized Hybrid Steepest-Descent Method for Variational Inequalities in Banach Spaces
inferred← citeshttps://doi.org/10.1155/2019/8059135openalex-snapshot
A Halpern-Type Iteration Method for Bregman Nonspreading Mapping and Monotone Operators in Reflexive Banach Spaces
inferred← citeshttps://doi.org/10.11650/tjm.19.2015.4972openalex-snapshot
THE PROX-TIKHONOV-LIKE FORWARD-BACKWARD METHOD AND APPLICATIONS
inferred← citeshttps://doi.org/10.1186/1029-242x-2012-137openalex-snapshot
Convergence of a proximal point algorithm for maximal monotone operators in Hilbert spaces
inferred← citeshttps://doi.org/10.1287/moor.27.1.170.331openalex-snapshot
Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
inferred← citeshttps://doi.org/10.23952/jano.2.2020.1.03openalex-snapshot
Superiorization vs. accelerated convex optimization: The superiorized / regularized least-squares case
inferred← citeshttps://doi.org/10.24193/fpt-ro.2020.1.20openalex-snapshot
Weak and strong convergence results for sum of two monotone operators in reflexive Banach spaces
inferred← citeshttps://doi.org/10.3390/math7020131openalex-snapshot
Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces
inferred← citeshttps://doi.org/10.4067/s0719-06462011000300010openalex-snapshot
Linear Convergence Analysis for General Proximal Point Algorithms Involving (H,η)- Mo notonicity Frameworks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.