On the public citation graph
Finite termination of the proximal point algorithm
0 signed · 133 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-030-74640-7_1openalex-snapshot
Introduction to Optimization
inferredcites →https://doi.org/10.1007/978-3-642-46631-1_11openalex-snapshot
Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation
inferredcites →https://doi.org/10.1007/bf01582267openalex-snapshot
Error bounds for nondegenerate monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0121017openalex-snapshot
Normal solutions of linear programs
inferredcites →https://doi.org/10.1016/0001-8708(85)90126-4openalex-snapshot
Opérateurs maximaux monotones
inferredcites →https://doi.org/10.1016/0022-247x(74)90025-0openalex-snapshot
On the variational principle
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien
inferredcites →https://doi.org/10.31857/s04247388openalex-snapshot
Economics and Mathematical Methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199803/04)5:2<79::aid-nla126>3.0.co;2-4openalex-snapshot
Approximating minimum norm solutions of rank-deficient least squares problems
inferred← citeshttps://doi.org/10.1007/0-387-24255-4_17openalex-snapshot
Proximal-Like Methods for Convex Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_16openalex-snapshot
Error Bounds for Quadratic Systems
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-1-4757-6388-1_18openalex-snapshot
A Globally Convergent Inexact Newton Method for Systems of Monotone Equations
inferred← citeshttps://doi.org/10.1007/978-3-030-38603-0_32openalex-snapshot
Computational Experience and Challenges with the Conjugate Epi-Projection Algorithms for Non-smooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-8871-4_10openalex-snapshot
Unconstrained Minimization of Quadratic Splines and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-13710-0openalex-snapshot
Convex Optimization in Normed Spaces: Theory, Methods and Examples
inferred← citeshttps://doi.org/10.1007/bf01582267openalex-snapshot
Error bounds for nondegenerate monotone linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02510242openalex-snapshot
A proximal point algorithm for minimax problems
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s00245-020-09662-7openalex-snapshot
Weak Sharpness and Finite Convergence for Solutions of Nonsmooth Variational Inequalities in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10107-013-0730-4openalex-snapshot
Optimality, identifiability, and sensitivity
inferred← citeshttps://doi.org/10.1007/s10107-016-1091-6openalex-snapshot
From error bounds to the complexity of first-order descent methods for convex functions
inferred← citeshttps://doi.org/10.1007/s10107-017-1164-1openalex-snapshot
New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
inferred← citeshttps://doi.org/10.1007/s10107-018-01361-0openalex-snapshot
Faster subgradient methods for functions with Hölderian growth
inferred← citeshttps://doi.org/10.1007/s10107-022-01809-4openalex-snapshot
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
inferred← citeshttps://doi.org/10.1007/s10107-022-01901-9openalex-snapshot
Faster first-order primal-dual methods for linear programming using restarts and sharpness
inferred← citeshttps://doi.org/10.1007/s101070050015openalex-snapshot
Exact order of Hoffman’s error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
inferred← citeshttps://doi.org/10.1007/s101070050016openalex-snapshot
Error bounds for infinite systems of convex inequalities without Slater’s condition
inferred← citeshttps://doi.org/10.1007/s101079900113openalex-snapshot
Forcing strong convergence of proximal point iterations in a Hilbert space
inferred← citeshttps://doi.org/10.1007/s10208-021-09516-wopenalex-snapshot
Proximal Methods Avoid Active Strict Saddles of Weakly Convex Functions
inferred← citeshttps://doi.org/10.1007/s10589-005-3065-0openalex-snapshot
Double-Regularization Proximal Methods, with Complementarity Applications
inferred← citeshttps://doi.org/10.1007/s10589-012-9457-zopenalex-snapshot
Generalized weak sharp minima in cone-constrained convex optimization with applications
inferred← citeshttps://doi.org/10.1007/s10589-020-00194-yopenalex-snapshot
Convergence rates of subgradient methods for quasi-convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9428-9openalex-snapshot
Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping
inferred← citeshttps://doi.org/10.1007/s10898-019-00869-9openalex-snapshot
Linear conditioning, weak sharpness and finite convergence for equilibrium problems
inferred← citeshttps://doi.org/10.1007/s10957-005-4716-0openalex-snapshot
Combined Relaxation Method for Mixed Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/s10957-013-0460-zopenalex-snapshot
On Finite Convergence of Iterative Methods for Variational Inequalities in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10957-014-0642-3openalex-snapshot
Splitting Methods with Variable Metric for Kurdyka–Łojasiewicz Functions and General Convergence Rates
inferred← citeshttps://doi.org/10.1007/s10957-014-0689-1openalex-snapshot
Finite Termination of Inexact Proximal Point Algorithms in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10957-017-1181-5openalex-snapshot
Weak Sharp Solutions for Nonsmooth Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-023-02178-4openalex-snapshot
General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds
inferred← citeshttps://doi.org/10.1007/s10957-025-02700-wopenalex-snapshot
Extending Linear Conditioning to Convex-Concave Optimization: Finite Convergence of the Proximal Point Algorithm
inferred← citeshttps://doi.org/10.1007/s10957-025-02775-5openalex-snapshot
On second-order weak sharp minima of general nonconvex set-constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s11117-015-0324-xopenalex-snapshot
On the variational behaviour of functions with positive steepest descent rate
inferred← citeshttps://doi.org/10.1007/s11228-012-0225-0openalex-snapshot
Finite Convergence of the Proximal Point Algorithm for Variational Inequality Problems
inferred← citeshttps://doi.org/10.1007/s11228-014-0279-2openalex-snapshot
A Proximal Point-Type Method for Multicriteria Optimization
inferred← citeshttps://doi.org/10.1007/s11228-016-0394-3openalex-snapshot
Computing Proximal Points of Convex Functions with Inexact Subgradients
inferred← citeshttps://doi.org/10.1007/s11590-015-0906-3openalex-snapshot
Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities
inferred← citeshttps://doi.org/10.1007/s11590-018-1269-3openalex-snapshot
A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
inferred← citeshttps://doi.org/10.1007/s11856-019-1870-xopenalex-snapshot
Moduli of regularity and rates of convergence for Fejér monotone sequences
inferred← citeshttps://doi.org/10.1016/0191-2615(95)00016-7openalex-snapshot
An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00104-2openalex-snapshot
Error estimates and Lipschitz constants for best approximation in continuous function spaces
inferred← citeshttps://doi.org/10.1016/j.amc.2004.03.005openalex-snapshot
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
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.2022.108348openalex-snapshot
On finite termination of an inexact Proximal Point algorithm
inferred← citeshttps://doi.org/10.1016/j.aml.2024.109104openalex-snapshot
Finite termination of the optimal solution sequence in parametric optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2007.02.010openalex-snapshot
On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.03.026openalex-snapshot
On finite convergence of proximal point algorithms for variational inequalities
inferred← citeshttps://doi.org/10.1016/j.jmaa.2010.08.062openalex-snapshot
Weak sharp solutions for variational inequalities in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.09.032openalex-snapshot
Finite termination of the proximal point algorithm in Banach spaces
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.mcm.2008.11.014openalex-snapshot
Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems
inferred← citeshttps://doi.org/10.1016/j.na.2011.05.084openalex-snapshot
Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
inferred← citeshttps://doi.org/10.1016/j.nahs.2009.06.009openalex-snapshot
Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings
inferred← citeshttps://doi.org/10.1016/j.orl.2008.07.005openalex-snapshot
A note on finite termination of iterative algorithms in mathematical programming
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00600-0openalex-snapshot
The adventures of a simple algorithm
inferred← citeshttps://doi.org/10.1016/s0375-9601(98)00564-7openalex-snapshot
Feasible histories, maximum entropy and a MinMax choice criterion
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00730-6openalex-snapshot
Some recent advances in projection-type methods for variational inequalities
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80011-2openalex-snapshot
On Theory and Practice of Row Relaxation Methods
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:1017523331361openalex-snapshot
Robustness of the Hybrid Extragradient Proximal-Point Algorithm
inferred← citeshttps://doi.org/10.1080/01630560701766684openalex-snapshot
On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
inferred← citeshttps://doi.org/10.1080/01630563.2022.2109171openalex-snapshot
A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions
inferred← citeshttps://doi.org/10.1080/02331930903395857openalex-snapshot
Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
inferred← citeshttps://doi.org/10.1080/02331934.2012.730050openalex-snapshot
Finite termination of the proximal point method for convex functions on Hadamard manifolds
inferred← citeshttps://doi.org/10.1080/02331934.2016.1160398openalex-snapshot
Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms
inferred← citeshttps://doi.org/10.1080/02331934.2017.1397146openalex-snapshot
Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem
inferred← citeshttps://doi.org/10.1080/02331934.2021.1906873openalex-snapshot
On applications of the calmness moduli for multifunctions to error bounds
inferred← citeshttps://doi.org/10.1080/02331934.2026.2663349openalex-snapshot
Complexity of inexact proximal point algorithm for minimizing convex functions with Holderian growth
inferred← citeshttps://doi.org/10.1080/02331939408844020openalex-snapshot
Remarks to an equivalent formulation of ekeland’s variational principle
inferred← citeshttps://doi.org/10.1080/02522667.1999.10699419openalex-snapshot
A characterization of the optimal set of linear programs based on the augmented lagrangian
inferred← citeshttps://doi.org/10.1080/10556788.2011.579965openalex-snapshot
Global convergence and finite termination of a class of smooth penalty function algorithms
inferred← citeshttps://doi.org/10.1090/s0002-9939-2011-10883-9openalex-snapshot
On convergence of the proximal point algorithm in Banach spaces
inferred← citeshttps://doi.org/10.1109/acc.2014.6859377openalex-snapshot
The pseudomonotone stochastic variational inequality problem: Analytical statements and stochastic extragradient schemes
inferred← citeshttps://doi.org/10.1137/0804029openalex-snapshot
Problems of Hierarchical Optimization in Finite Dimensions
inferred← citeshttps://doi.org/10.1137/0804031openalex-snapshot
Partial Proximal Minimization Algorithms for Convex Pprogramming
inferred← citeshttps://doi.org/10.1137/09075367xopenalex-snapshot
Weak Sharp Minima on Riemannian Manifolds
inferred← citeshttps://doi.org/10.1137/110825352openalex-snapshot
Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
inferred← citeshttps://doi.org/10.1137/130916710openalex-snapshot
Orthogonal Invariance and Identifiability
inferred← citeshttps://doi.org/10.1137/15m1020770openalex-snapshot
Generic Minimizing Behavior in Semialgebraic Optimization
inferred← citeshttps://doi.org/10.1137/16m1139564openalex-snapshot
Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
inferred← citeshttps://doi.org/10.1137/19m1237909openalex-snapshot
Partial Smoothness and Constant Rank
inferred← citeshttps://doi.org/10.1137/22m1510467openalex-snapshot
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1137/22m152147xopenalex-snapshot
Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
inferred← citeshttps://doi.org/10.1137/s036301299222723xopenalex-snapshot
Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
inferred← citeshttps://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferred← citeshttps://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012995281742openalex-snapshot
Proximal Minimization Methods with Generalized Bregman Functions
inferred← citeshttps://doi.org/10.1137/s0363012995292548openalex-snapshot
Minimizing and Stationary Sequences of Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1137/s1052623400374379openalex-snapshot
Interior-Point Methods for Massive Support Vector Machines
inferred← citeshttps://doi.org/10.1137/s1052623495293160openalex-snapshot
The Linear l 1 Estimator and the Huber M-Estimator
inferred← citeshttps://doi.org/10.1137/s1052623499357957openalex-snapshot
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
inferred← citeshttps://doi.org/10.1155/2009/519065openalex-snapshot
A General Iterative Method for Variational Inequality Problems, Mixed Equilibrium Problems, and Fixed Point Problems of Strictly Pseudocontractive Mappings in Hilbert Spaces
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/2012/142862openalex-snapshot
Convergence of a Proximal Point Algorithm for Solving Minimization Problems
inferred← citeshttps://doi.org/10.1186/s13660-021-02733-5openalex-snapshot
Some aspects of nonsmooth variational inequalities on Hadamard manifolds
inferred← citeshttps://doi.org/10.12677/aam.2016.54072openalex-snapshot
Finite Convergence of the Solution Set for SQP Subproblem
inferred← citeshttps://doi.org/10.1287/moor.1110.0481openalex-snapshot
Generic Optimality Conditions for Semialgebraic Convex Programs
inferred← citeshttps://doi.org/10.1287/moor.2020.1075openalex-snapshot
Active‐Set Newton Methods and Partial Smoothness
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.17721/2706-9699.2019.3.03openalex-snapshot
FINITE CONVERGENCE OF TWO-STAGE ALGORITHMS FOR SOLVING OF EQUILIBRIUM PROBLEMS
inferred← citeshttps://doi.org/10.23952/jano.1.2019.1.07openalex-snapshot
Weak sharpness and finite convergence for mixed variational inequalities
inferred← citeshttps://doi.org/10.23952/jnva.3.2019.1.03openalex-snapshot
On the finite termination of the gradient projection method
inferred← citeshttps://doi.org/10.32657/10356/73066openalex-snapshot
A study on augmented Lagrangian-based splitting methods for separable convex programming
inferred← citeshttps://doi.org/10.3390/math12020352openalex-snapshot
The Augmented Weak Sharpness of Solution Sets in Equilibrium Problems
inferred← citeshttps://doi.org/10.3390/mca22020036openalex-snapshot
Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems
inferred← citeshttps://doi.org/10.37193/cjm.2020.01.10openalex-snapshot
Weak sharpness for solutions of nonsmooth variational inequalities and applications
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.621openalex-snapshot
Generalized weak sharp minima of variational inequality problems with functional constraints
inferred← citeshttps://doi.org/10.4067/s0719-06462011000300010openalex-snapshot
Linear Convergence Analysis for General Proximal Point Algorithms Involving (H,η)- Mo notonicity Frameworks
inferred← citeshttps://doi.org/10.4236/apm.2013.31011openalex-snapshot
Strong Convergence of a General Iterative Algorithm for Mixed Equilibrium, Variational Inequality and Common Fixed Points Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6628openalex-snapshot
Optimality, identifiability, and sensitivity
inferred← citeshttps://doi.org/10.48550/arxiv.1304.1198openalex-snapshot
Orthogonal Invariance and Identifiability
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07694openalex-snapshot
Generic minimizing behavior in semi-algebraic optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06275openalex-snapshot
General Convergence Rates Follow From Specialized Rates Assuming Growth Bounds
inferred← citeshttps://doi.org/10.68381/jca06005openalex-snapshot
A Hybrid Projection-Proximal Point Algorithm
inferred← citeshttps://doi.org/10.68381/jca14035openalex-snapshot
Prox-Regularity and Stability of the Proximal Mapping
inferred← citeshttps://doi.org/10.68381/jca16015openalex-snapshot
Asymptotic Convergence to the Optimal Value of Diagonal Proximal Iterations in Convex Minimization
inferred← citeshttps://doi.org/10.70675/7f14ce19z8a1az4279z91f6zce649f40744copenalex-snapshot
Systèmes dynamiques de descente et algorithmes pour l'optimisation modérée, et les problèmes multi-objectif
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.