On the public citation graph
Inexact Proximal Point Methods for Variational Inequality Problems
0 signed · 60 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-0-387-69757-4openalex-snapshot
Set-Valued Mappings and Enlargements of Monotone Operators
inferredcites →https://doi.org/10.1007/978-1-4757-6388-1_2openalex-snapshot
ε-Enlargements of Maximal Monotone Operators: Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-642-45780-7_3openalex-snapshot
Coupling the Logarithmic-Quadratic Proximal Method and the Block Nonlinear Gauss-Seidel Algorithm for Linearly Constrained Convex Minimization
inferredcites →https://doi.org/10.1007/bf01580089openalex-snapshot
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
inferredcites →https://doi.org/10.1007/bf01580598openalex-snapshot
On the convergence of the exponential multiplier method for convex programming
inferredcites →https://doi.org/10.1007/bf01592246openalex-snapshot
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
inferredcites →https://doi.org/10.1007/bf02680553openalex-snapshot
Approximate iterations in Bregman-function-based proximal algorithms
inferredcites →https://doi.org/10.1007/s10107-004-0568-xopenalex-snapshot
Interior projection-like methods for monotone variational inequalities
inferredcites →https://doi.org/10.1007/s101070050022openalex-snapshot
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
inferredcites →https://doi.org/10.1007/s10589-005-3065-0openalex-snapshot
Double-Regularization Proximal Methods, with Complementarity Applications
inferredcites →https://doi.org/10.1016/0024-3795(90)90204-popenalex-snapshot
Multiplicative iterative algorithms for convex programming
inferredcites →https://doi.org/10.1023/a:1008607511915openalex-snapshot
A Logarithmic-Quadratic Proximal Method for Variational Inequalities
inferredcites →https://doi.org/10.1023/a:1008615624787openalex-snapshot
Enlargement of Monotone Operators with Applications to Variational Inequalities
inferredcites →https://doi.org/10.1023/a:1008730230603openalex-snapshot
ε-Enlargements of Maximal Monotone Operators in Banach Spaces
inferredcites →https://doi.org/10.1081/nfa-100108320openalex-snapshot
A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS *
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0803026openalex-snapshot
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
inferredcites →https://doi.org/10.1137/s0363012995281742openalex-snapshot
Proximal Minimization Methods with Generalized Bregman Functions
inferredcites →https://doi.org/10.1137/s1052623403427823openalex-snapshot
Interior Gradient and Proximal Methods for Convex and Conic Optimization
inferredcites →https://doi.org/10.1137/s1052623493259215openalex-snapshot
Penalty/Barrier Multiplier Methods for Convex Programming Problems
inferredcites →https://doi.org/10.1137/s1052623495286302openalex-snapshot
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
inferredcites →https://doi.org/10.1137/s1052623495292130openalex-snapshot
Convergence of Proximal-Like Algorithms
inferredcites →https://doi.org/10.1137/s1052623499365784openalex-snapshot
Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
inferredcites →https://doi.org/10.1287/moor.17.3.670openalex-snapshot
Entropic Proximal Mappings with Applications to Nonlinear Programming
inferredcites →https://doi.org/10.1287/moor.18.1.202openalex-snapshot
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
inferredcites →https://doi.org/10.1287/moor.19.4.790openalex-snapshot
Entropy-Like Proximal Methods in Convex Programming
inferredcites →https://doi.org/10.1287/moor.20.3.657openalex-snapshot
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
inferredcites →https://doi.org/10.1287/moor.24.3.645openalex-snapshot
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
inferredcites →https://doi.org/10.1287/moor.25.2.214.12222openalex-snapshot
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
inferredcites →https://doi.org/10.1287/moor.26.4.816.10011openalex-snapshot
A Relative Error Tolerance for a Family of Generalized Proximal Point Methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10479-026-07241-7openalex-snapshot
A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
inferred← citeshttps://doi.org/10.1007/s10589-024-00592-6openalex-snapshot
Extragradient method with feasible inexact projection to variational inequality problem
inferred← citeshttps://doi.org/10.1007/s10898-015-0266-7openalex-snapshot
A proximal method with logarithmic barrier for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10898-021-01110-2openalex-snapshot
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces
inferred← citeshttps://doi.org/10.1007/s10898-023-01341-5openalex-snapshot
On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
inferred← citeshttps://doi.org/10.1007/s10957-012-0111-9openalex-snapshot
An Interior Proximal Method for a Class of Quasimonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-014-0605-8openalex-snapshot
Interior Proximal Method Without the Cutting Plane Property
inferred← citeshttps://doi.org/10.1007/s10957-018-1258-9openalex-snapshot
Inexact Multi-Objective Local Search Proximal Algorithms: Application to Group Dynamic and Distributive Justice Problems
inferred← citeshttps://doi.org/10.1007/s10957-021-01895-yopenalex-snapshot
Generalized Bregman Envelopes and Proximity Operators
inferred← citeshttps://doi.org/10.1007/s11228-019-00517-0openalex-snapshot
A Projection Algorithm for Non-Monotone Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s11228-023-00700-4openalex-snapshot
Nonlinear Forward-Backward Splitting with Momentum Correction
inferred← citeshttps://doi.org/10.1007/s40305-021-00352-xopenalex-snapshot
The Developments of Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1016/j.apnum.2019.08.008openalex-snapshot
Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: Convergence analysis
inferred← citeshttps://doi.org/10.1016/j.cnsns.2026.110881openalex-snapshot
Outer approximation projection methods for solving variational inequalities
inferred← citeshttps://doi.org/10.1051/ro/2020018openalex-snapshot
An inexact proximal decomposition method for variational inequalities with separable structure
inferred← citeshttps://doi.org/10.1080/02331934.2014.926898openalex-snapshot
Interior proximal extragradient method for equilibrium problems
inferred← citeshttps://doi.org/10.1080/02331934.2016.1261138openalex-snapshot
Convergence rate of a proximal multiplier algorithm for separable convex minimization
inferred← citeshttps://doi.org/10.1080/02331934.2018.1476859openalex-snapshot
An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
inferred← citeshttps://doi.org/10.1137/140975589openalex-snapshot
Generalized Proximal Distances for Bilevel Equilibrium Problems
inferred← citeshttps://doi.org/10.1145/3272127.3275021openalex-snapshot
Inexact descent methods for elastic parameter optimization
inferred← citeshttps://doi.org/10.14288/1.0071930openalex-snapshot
On monotone operator classes and the Borwein-Wiersma decomposition : with demonstrations using low dimensional examples and the construction of decompositions.
inferred← citeshttps://doi.org/10.23952/jnva.8.2024.3.03openalex-snapshot
Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
inferred← citeshttps://doi.org/10.48550/arxiv.1407.1939openalex-snapshot
A proximal point algorithm with generalized proximal distances to BEPs
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04182openalex-snapshot
An interior subgradient and a proximal linearized method for DC programming
inferred← citeshttps://doi.org/10.5540/03.2025.011.01.0340openalex-snapshot
An Interior Subgradient Method for DC Programming with Proximal Distance Regularization
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.