On the public citation graph

A family of variable metric proximal methods

https://doi.org/10.1007/bf01585756
0 signed · 131 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.1007/978-3-642-51682-5_12openalex-snapshot
Newton’s Method Based on Generalized Derivatives for Nonsmooth Functions: Convergence Analysis
inferredcites →https://doi.org/10.1007/bf01580895openalex-snapshot
Local convergence of quasi-Newton methods for B-differentiable equations
inferredcites →https://doi.org/10.1007/bf01581275openalex-snapshot
A nonsmooth version of Newton's method
inferredcites →https://doi.org/10.1007/bf01585170openalex-snapshot
Convergence of some algorithms for convex minimization
inferredcites →https://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferredcites →https://doi.org/10.1007/bf01589113openalex-snapshot
Some numerical experiments with variable-storage quasi-Newton algorithms
inferredcites →https://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferredcites →https://doi.org/10.1007/bf02592098openalex-snapshot
A quasi-second-order proximal bundle algorithm
inferredcites →https://doi.org/10.1007/bfb0004506openalex-snapshot
A view of line-searches
inferredcites →https://doi.org/10.1007/bfb0035464openalex-snapshot
An approach to variable metric bundle methods
inferredcites →https://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferredcites →https://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1051/m2an/197004r301541openalex-snapshot
Brève communication. Régularisation d'inéquations variationnelles par approximations successives
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343581-1openalex-snapshot
A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
inferredcites →https://doi.org/10.1093/imamat/12.3.223openalex-snapshot
On the Local and Superlinear Convergence of Quasi-Newton Methods
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0722074openalex-snapshot
Orthogonal Projections on Convex Sets for Newton-Like Methods
inferredcites →https://doi.org/10.1137/0726042openalex-snapshot
A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
inferredcites →https://doi.org/10.1137/0803021openalex-snapshot
Nonsmooth Equations: Motivation and Algorithms
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1019005openalex-snapshot
Quasi-Newton Methods, Motivation and Theory
inferredcites →https://doi.org/10.1287/moor.15.2.311openalex-snapshot
Newton's Method for B-Differentiable Equations
inferredcites →https://doi.org/10.1287/moor.18.1.227openalex-snapshot
Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.21236/ada188327openalex-snapshot
A View of Unconstrained Optimization.
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien

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-4613-0287-2_13openalex-snapshot
Surver of the Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_6openalex-snapshot
Fixed and virtual stability center methods for convex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-5233-5_5openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_16openalex-snapshot
On the Local Super-Linear Convergence of a Matrix Secant Implementation of the Variable Metric Proximal Point Algorithm for Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_14openalex-snapshot
Semismoothness and Superlinear Convergence in Nonsmooth Optimization and Nonsmooth Equations
inferred← citeshttps://doi.org/10.1007/978-3-030-03009-4_62-1openalex-snapshot
Bregman Methods for Large-Scale Optimisation with Applications in Imaging
inferred← citeshttps://doi.org/10.1007/978-3-030-03009-4_62-2openalex-snapshot
Bregman Methods for Large-Scale Optimization with Applications in Imaging
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_9openalex-snapshot
Beyond First Order: V U $$\mathcal {V}\mathcal {U}$$ -Decomposition Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_273-1openalex-snapshot
Ill-posed Variational Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-98661-2_62openalex-snapshot
Bregman Methods for Large-Scale Optimization with Applications in Imaging
inferred← citeshttps://doi.org/10.1007/978-3-319-41589-5_10openalex-snapshot
First Order Algorithms in Variational Image Processing
inferred← citeshttps://doi.org/10.1007/978-3-642-45767-8_2openalex-snapshot
Optimal Power Generation under Uncertainty via Stochastic Programming
inferred← citeshttps://doi.org/10.1007/bf02193060openalex-snapshot
A globally convergent Newton method for convex SC1 minimization problems
inferred← citeshttps://doi.org/10.1007/bf02592098openalex-snapshot
A quasi-second-order proximal bundle algorithm
inferred← citeshttps://doi.org/10.1007/bf02614390openalex-snapshot
Variable metric bundle methods: From conceptual to implementable forms
inferred← citeshttps://doi.org/10.1007/bfb0035464openalex-snapshot
An approach to variable metric bundle methods
inferred← citeshttps://doi.org/10.1007/pl00011373openalex-snapshot
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
inferred← citeshttps://doi.org/10.1007/s00245-005-0831-4openalex-snapshot
Composition Duality Methods for Mixed Variational Inclusions
inferred← citeshttps://doi.org/10.1007/s002459900086openalex-snapshot
A General Approach to Convergence Properties of Some Methods for Nonsmooth Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10107-007-0124-6openalex-snapshot
Computing proximal points of nonconvex functions
inferred← citeshttps://doi.org/10.1007/s10107-012-0514-2openalex-snapshot
Nonsmooth optimization via quasi-Newton methods
inferred← citeshttps://doi.org/10.1007/s10107-021-01621-6openalex-snapshot
Limited-memory BFGS with displacement aggregation
inferred← citeshttps://doi.org/10.1007/s101070050059openalex-snapshot
Proximal quasi-Newton methods for nondifferentiable convex optimization
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/s10288-019-00425-xopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10559-025-00797-5openalex-snapshot
The Operator Extrapolation Method for Variational Inequalities and its Application
inferred← citeshttps://doi.org/10.1007/s10589-010-9363-1openalex-snapshot
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1007/s10589-012-9485-8openalex-snapshot
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
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/s10589-017-9912-yopenalex-snapshot
Forward–backward quasi-Newton methods for nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/s10915-023-02393-1openalex-snapshot
Scaled Proximal Gradient Methods for Sparse Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10915-025-02951-9openalex-snapshot
An Accelerated Semi-Proximal ADMM with Applications to Multi-Block Sparse Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-013-0465-7openalex-snapshot
Variable Metric Forward–Backward Algorithm for Minimizing the Sum of a Differentiable Function and a Convex Function
inferred← citeshttps://doi.org/10.1007/s10957-014-0526-6openalex-snapshot
A Splitting Algorithm for Coupled System of Primal–Dual Monotone Inclusions
inferred← citeshttps://doi.org/10.1007/s10957-015-0781-1openalex-snapshot
A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/s10957-020-01636-7openalex-snapshot
A Modified Nonlinear Conjugate Gradient Algorithm for Large-Scale Nonsmooth Convex Optimization
inferred← citeshttps://doi.org/10.1007/s11075-006-9056-0openalex-snapshot
Fast Moreau envelope computation I: numerical algorithms
inferred← citeshttps://doi.org/10.1007/s11075-015-0034-2openalex-snapshot
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s11075-023-01700-zopenalex-snapshot
A two-metric variable scaled forward-backward algorithm for $$\ell _0$$ optimization problem and its applications
inferred← citeshttps://doi.org/10.1007/s11075-025-02040-wopenalex-snapshot
An inertial Hestenes-Stiefel algorithm for nonsmooth convex optimization and its applications in machine learning
inferred← citeshttps://doi.org/10.1007/s11222-025-10742-3openalex-snapshot
Two-Metric Variable Scaled Splitting Algorithm for Nonsmooth Nonconvex Sparsity-penalized Quantile Regression
inferred← citeshttps://doi.org/10.1007/s11590-011-0437-5openalex-snapshot
Conjugate gradient type methods for the nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/s12190-015-0912-8openalex-snapshot
A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
inferred← citeshttps://doi.org/10.1007/s12190-015-0940-4openalex-snapshot
An ODE-like nonmonotone method for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1007/s40305-021-00352-xopenalex-snapshot
The Developments of Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1007/s40305-023-00518-9openalex-snapshot
On the Metric Resolvent: Nonexpansiveness, Convergence Rates and Applications
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.cam.2013.04.032openalex-snapshot
A modified Polak–Ribière–Polyak conjugate gradient algorithm for nonsmooth convex programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.04.005openalex-snapshot
A bundle modification strategy for convex minimization
inferred← citeshttps://doi.org/10.1016/j.mcm.2004.10.022openalex-snapshot
Composition duality principles for mixed variational inequalities
inferred← citeshttps://doi.org/10.1016/j.na.2012.09.008openalex-snapshot
Variable metric quasi-Fejér monotonicity
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00012-6openalex-snapshot
On superlinear convergence of quasi-Newton methods for nonsmooth equations
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.1017/s096249291600009xopenalex-snapshot
An introduction to continuous optimization for imaging
inferred← citeshttps://doi.org/10.1023/a:1004633524446openalex-snapshot
Globally Convergent BFGS Method for Nonsmooth Convex Optimization1
inferred← citeshttps://doi.org/10.1023/a:1008282922372openalex-snapshot
Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities
inferred← citeshttps://doi.org/10.1023/b:jota.0000005046.70410.02openalex-snapshot
On Approximations with Finite Precision in Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/00207160.2014.955483openalex-snapshot
A memory gradient method for non-smooth convex optimization
inferred← citeshttps://doi.org/10.1080/01630563.2013.763825openalex-snapshot
A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
inferred← citeshttps://doi.org/10.1080/01630569608816705openalex-snapshot
Convergence analysis of a proximal newton method1
inferred← citeshttps://doi.org/10.1080/02331934.2012.733883openalex-snapshot
Variable metric forward–backward splitting with applications to monotone inclusions in duality
inferred← citeshttps://doi.org/10.1080/02331934.2020.1751158openalex-snapshot
The indefinite proximal point algorithms for maximal monotone operators
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780290027837openalex-snapshot
A Method for Minimization of Quasidifferentiable Functions
inferred← citeshttps://doi.org/10.1080/10556780802264071openalex-snapshot
Non-smoothness in classification problems
inferred← citeshttps://doi.org/10.1080/10556780903236911openalex-snapshot
Gradient set splitting in nonconvex nonsmooth numerical optimization
inferred← citeshttps://doi.org/10.1080/10556780903483356openalex-snapshot
Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
inferred← citeshttps://doi.org/10.1093/imanum/drz008openalex-snapshot
A self-correcting variable-metric algorithm framework for nonsmooth optimization
inferred← citeshttps://doi.org/10.1109/icassp.2014.6853847openalex-snapshot
A preconditioned Forward-Backward approach with application to large-scale nonconvex spectral unmixing problems
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054193openalex-snapshot
Variable Metric Proximal Gradient Method with Diagonal Barzilai-Borwein Stepsize
inferred← citeshttps://doi.org/10.1109/icassp55912.2026.11461318openalex-snapshot
Variable Metric Stochastic Line-Search For Primal-Dual Hybrid Gradient
inferred← citeshttps://doi.org/10.1109/lsp.2022.3169088openalex-snapshot
Unmatched Preconditioning of the Proximal Gradient Algorithm
inferred← citeshttps://doi.org/10.1109/lsp.2025.3553790openalex-snapshot
A Proximal Newton Adaptive Importance Sampler
inferred← citeshttps://doi.org/10.1137/15m1018253openalex-snapshot
Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs
inferred← citeshttps://doi.org/10.1137/17m1156678openalex-snapshot
Adaptive FISTA for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/19m1251795openalex-snapshot
An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
inferred← citeshttps://doi.org/10.1137/21m1428601openalex-snapshot
Optimal Convergence Rates for the Proximal Bundle Method
inferred← citeshttps://doi.org/10.1137/22m1488181openalex-snapshot
A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
inferred← citeshttps://doi.org/10.1137/24m1650053openalex-snapshot
Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings
inferred← citeshttps://doi.org/10.1137/24m1673899openalex-snapshot
Nesterov’s Accelerated Jacobi-Type Methods for Large-Scale Symmetric Positive Semidefinite Linear Systems
inferred← citeshttps://doi.org/10.1137/24m1713132openalex-snapshot
A General Framework for Symmetric and Asymmetric Variable Metric Proximal Point Methods, with Relations between Relative-Errors and Summable-Errors
inferred← citeshttps://doi.org/10.1137/s1052623494279316openalex-snapshot
Generalized Hessian Properties of Regularized Nonsmooth Functions
inferred← citeshttps://doi.org/10.1186/s13660-020-02398-6openalex-snapshot
A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
inferred← citeshttps://doi.org/10.1371/journal.pone.0164289openalex-snapshot
The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1371/journal.pone.0189290openalex-snapshot
An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints
inferred← citeshttps://doi.org/10.1561/2400000003openalex-snapshot
Proximal Algorithms
inferred← citeshttps://doi.org/10.19139/soic.v2i3.64openalex-snapshot
A Modified Fletcher-Reeves-Type Method for Nonsmooth Convex Minimization
inferred← citeshttps://doi.org/10.2298/bg20120517gardasevicopenalex-snapshot
Numericke metode za resavanje konveksnih nediferencijabilnih optimizacionih problema
inferred← citeshttps://doi.org/10.34229/kca2522-9664.25.4.9openalex-snapshot
The operator extrapolation method for variational inequalities and its application
inferred← citeshttps://doi.org/10.3846/13926292.2012.661375openalex-snapshot
THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.3934/jimo.2017075openalex-snapshot
A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.3934/jimo.2021084openalex-snapshot
Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
inferred← citeshttps://doi.org/10.4236/ajcm.2020.101001openalex-snapshot
A Scaled Conjugate Gradient Method Based on New BFGS Secant Equation with Modified Nonmonotone Line Search
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5705openalex-snapshot
Variable Metric Quasi-Fejér Monotonicity
inferred← citeshttps://doi.org/10.48550/arxiv.1206.6791openalex-snapshot
Variable Metric Forward-Backward Splitting with Applications to Monotone Inclusions in Duality
inferred← citeshttps://doi.org/10.48550/arxiv.1402.6655openalex-snapshot
Forward-backward truncated Newton methods for convex composite optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1803.01621openalex-snapshot
Proximal Gradient Algorithms: Applications in Signal Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2003.03437openalex-snapshot
Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00817openalex-snapshot
A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize
inferred← citeshttps://doi.org/10.68381/jca12005openalex-snapshot
Relating U-Lagrangians to Second-Order Epi-Derivatives and Proximal Tracks
inferred← citeshttps://doi.org/10.68381/jca16052openalex-snapshot
A Class of Variable Metric Decomposition Methods for Monotone Variational Inclusions
inferred← citeshttps://doi.org/10.68381/jca23016openalex-snapshot
How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.70675/1ee98c1fz19e6z44c0z8069z7157c1d086d3openalex-snapshot
Développement de méthodes itératives pour la reconstruction en tomographie spectrale
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.