On the public citation graph

A Generalization of the Proximal Point Algorithm

https://doi.org/10.1137/0328029
0 signed · 56 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nme.1620190609openalex-snapshot
A decomposition procedure for large‐scale optimum plastic design problems
inferredcites →https://doi.org/10.1007/bf01448388openalex-snapshot
Partial inverse of a monotone operator
inferredcites →https://doi.org/10.1007/bf01586091openalex-snapshot
Applications of the method of partial inverses to convex programming: Decomposition
inferredcites →https://doi.org/10.1007/bf02756796openalex-snapshot
Image d’une somme d’operateurs monotones et applications
inferredcites →https://doi.org/10.1007/bfb0120850openalex-snapshot
Generalized equations and their solutions, Part I: Basic theory
inferredcites →https://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1080/01630568208816109openalex-snapshot
Submonotone mappings and the proximal point algorithm
inferredcites →https://doi.org/10.1090/s0002-9947-1970-0282272-5openalex-snapshot
On the Maximality of Sums of Nonlinear Monotone Operators
inferredcites →https://doi.org/10.1112/blms/17.5.487openalex-snapshot
APPLIED NONLINEAR ANALYSIS
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0322019openalex-snapshot
Asymptotic Convergence Analysis of the Proximal Point Algorithm
inferredcites →https://doi.org/10.1215/s0012-7094-62-02933-2openalex-snapshot
Monotone (nonlinear) operators in Hilbert space
inferredcites →https://doi.org/10.1307/mmj/1029000324openalex-snapshot
Local boundedness of nonlinear, monotone operators.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nme.3188openalex-snapshot
A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_77openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_101openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_25openalex-snapshot
Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_16openalex-snapshot
The LP Dual Active Set Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_101-1openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_9openalex-snapshot
Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_8openalex-snapshot
Stable Solution of Variational Inequalities with Composed Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_27openalex-snapshot
Non-Cooperative Games; Methods of Subgradient Projection and Proximal Point
inferred← citeshttps://doi.org/10.1007/978-94-007-5425-6_2openalex-snapshot
Decomposition Methods and Strain Driven Algorithms for Limit and Shakedown Analysis
inferred← citeshttps://doi.org/10.1007/bf00248762openalex-snapshot
Application of the dual active set algorithm to quadratic network optimization
inferred← citeshttps://doi.org/10.1007/bf00253807openalex-snapshot
Primal-dual proximal point algorithm for linearly constrained convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01580598openalex-snapshot
On the convergence of the exponential multiplier method for convex programming
inferred← citeshttps://doi.org/10.1007/bf02025452openalex-snapshot
Dual active sets and constrained optimization
inferred← citeshttps://doi.org/10.1007/bf02192181openalex-snapshot
Generalized proximal point algorithm for convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-014-0853-2openalex-snapshot
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
inferred← citeshttps://doi.org/10.1007/s10589-007-9067-3openalex-snapshot
Self-adaptive inexact proximal point methods
inferred← citeshttps://doi.org/10.1007/s10589-013-9616-xopenalex-snapshot
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
inferred← citeshttps://doi.org/10.1007/s10898-010-9551-7openalex-snapshot
Nonmonotone equilibrium problems: coercivity conditions and weak regularization
inferred← citeshttps://doi.org/10.1007/s12215-017-0318-6openalex-snapshot
Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
inferred← citeshttps://doi.org/10.1007/s12532-014-0069-8openalex-snapshot
A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
inferred← citeshttps://doi.org/10.1007/s12532-023-00250-8openalex-snapshot
Self-adaptive ADMM for semi-strongly convex problems
inferred← citeshttps://doi.org/10.1016/0377-2217(94)e0355-fopenalex-snapshot
Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
inferred← citeshttps://doi.org/10.1016/j.amc.2005.05.044openalex-snapshot
A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2020.124315openalex-snapshot
Warped proximal iterations for monotone inclusions
inferred← citeshttps://doi.org/10.1023/a:1019148207669openalex-snapshot
Some approaches to solving a multihour broadband network capacity design problem with single-path routing
inferred← citeshttps://doi.org/10.1023/a:1022243127667openalex-snapshot
Prox-regularization and solution of ill-posed elliptic variational inequalities
inferred← citeshttps://doi.org/10.1080/01630569608816705openalex-snapshot
Convergence analysis of a proximal newton method1
inferred← citeshttps://doi.org/10.1080/02331939508844083openalex-snapshot
Multi-step-prox-regularization method for solving convex variation problems
inferred← citeshttps://doi.org/10.1080/10556780500094838openalex-snapshot
Partial proximal point method for nonmonotone equilibrium problems
inferred← citeshttps://doi.org/10.1080/10556789408805578openalex-snapshot
Some Saddle-function splitting methods for convex programming
inferred← citeshttps://doi.org/10.1109/jsac.2006.879356openalex-snapshot
Distributed utility maximization for network coding based multicasting: a shortest path approach
inferred← citeshttps://doi.org/10.1137/060666627openalex-snapshot
Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
inferred← citeshttps://doi.org/10.1137/0804031openalex-snapshot
Partial Proximal Minimization Algorithms for Convex Pprogramming
inferred← citeshttps://doi.org/10.1137/110855867openalex-snapshot
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
inferred← citeshttps://doi.org/10.1137/s0363012902407120openalex-snapshot
Bregman Monotone Optimization Algorithms
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
inferred← citeshttps://doi.org/10.1142/s0219198908001765openalex-snapshot
FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
inferred← citeshttps://doi.org/10.1287/moor.18.1.202openalex-snapshot
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
inferred← citeshttps://doi.org/10.15807/jorsj.39.213openalex-snapshot
PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.00979openalex-snapshot
A Bregman nonlinear proximal point algorithm for adaptive control
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.3934/math.2022601openalex-snapshot
Application of ADMM to robust model predictive control problems for the turbofan aero-engine with external disturbances
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.