On the public citation graph
Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
0 signed · 72 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.1002/jcc.540140115openalex-snapshot
Molecular conformations from distance matrices
inferredcites →https://doi.org/10.1007/978-1-4899-2112-3openalex-snapshot
Introduction to Parallel and Vector Solution of Linear Systems
inferredcites →https://doi.org/10.1007/bf01931691openalex-snapshot
A class of first order factorization methods
inferredcites →https://doi.org/10.1007/bf01934996openalex-snapshot
A survey of preconditioned iterative methods for linear systems of algebraic equations
inferredcites →https://doi.org/10.1016/0010-4655(89)90145-8openalex-snapshot
A historical overview of iterative methods
inferredcites →https://doi.org/10.1016/0377-0427(88)90344-5openalex-snapshot
Conjugate gradient type methods and preconditioning
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1080/10556789508805602openalex-snapshot
A new method for large-scale box constrained convex quadratic minimization problems
inferredcites →https://doi.org/10.1093/imanum/13.3.321openalex-snapshot
On the Barzilai and Borwein choice of steplength for the gradient method
inferredcites →https://doi.org/10.1093/imanum/8.1.141openalex-snapshot
Two-Point Step Size Gradient Methods
inferredcites →https://doi.org/10.1137/0906018openalex-snapshot
Block Preconditioning for the Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/1031003openalex-snapshot
Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nla.516openalex-snapshot
Inexact Barzilai‐Borwein method for saddle point problems
inferred← citeshttps://doi.org/10.1007/0-387-24255-4_10openalex-snapshot
On the Barzilai-Borwein Method
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_629openalex-snapshot
Spectral Projected Gradient Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_629-1openalex-snapshot
Spectral Projected Gradient Methods
inferred← citeshttps://doi.org/10.1007/s00024-017-1723-7openalex-snapshot
Large Airborne Full Tensor Gradient Data Inversion Based on a Non-Monotone Gradient Method
inferred← citeshttps://doi.org/10.1007/s10107-011-0479-6openalex-snapshot
A limited memory steepest descent method
inferred← citeshttps://doi.org/10.1007/s10444-011-9207-2openalex-snapshot
Preconditioning non-monotone gradient methods for retrieval of seismic reflection signals
inferred← citeshttps://doi.org/10.1007/s10589-023-00455-6openalex-snapshot
A harmonic framework for stepsize selection in gradient methods
inferred← citeshttps://doi.org/10.1007/s10898-008-9318-6openalex-snapshot
Hybrid spectral gradient method for the unconstrained minimization problem
inferred← citeshttps://doi.org/10.1007/s10957-005-2093-3openalex-snapshot
Spectral Gradient Methods for Linearly Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s10957-020-01677-yopenalex-snapshot
Analysis of the Barzilai-Borwein Step-Sizes for Problems in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s11075-009-9350-8openalex-snapshot
Accelerated gradient descent methods with line search
inferred← citeshttps://doi.org/10.1007/s11075-017-0460-4openalex-snapshot
Hybridization of accelerated gradient descent method
inferred← citeshttps://doi.org/10.1007/s11075-025-02120-xopenalex-snapshot
Regularized Barzilai-Borwein Method
inferred← citeshttps://doi.org/10.1007/s11590-017-1116-yopenalex-snapshot
A computation study on an integrated alternating direction method of multipliers for large scale optimization
inferred← citeshttps://doi.org/10.1007/s40314-019-0787-7openalex-snapshot
Accelerated augmented Lagrangian method for total variation minimization
inferred← citeshttps://doi.org/10.1007/springerreference_72707openalex-snapshot
Spectral Projected Gradient Methods
inferred← citeshttps://doi.org/10.1016/j.amc.2007.12.054openalex-snapshot
Multivariate spectral gradient method for unconstrained optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2014.10.104openalex-snapshot
An Accelerated Double Step Size model in unconstrained optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113033openalex-snapshot
Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2015.04.010openalex-snapshot
Parallel optimization by means of a Spectral-Projected-Gradient approach
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105334openalex-snapshot
Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains
inferred← citeshttps://doi.org/10.1016/j.engappai.2018.03.017openalex-snapshot
Random Barzilai–Borwein step size for mini-batch algorithms
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.118864openalex-snapshot
k-best feature selection and ranking via stochastic approximation
inferred← citeshttps://doi.org/10.1016/j.ins.2023.01.090openalex-snapshot
A stochastic approximation approach to fixed instance selection
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121738openalex-snapshot
SpIS: A stochastic approximation approach to minimal subset instance selection
inferred← citeshttps://doi.org/10.1016/j.jappgeo.2023.105276openalex-snapshot
Improvement of density inversion efficiency with projected gradient method: Application to FTG data
inferred← citeshttps://doi.org/10.1016/j.neucom.2018.06.002openalex-snapshot
Mini-batch algorithms with Barzilai–Borwein update step
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00112-3openalex-snapshot
Multiparameter descent methods
inferred← citeshttps://doi.org/10.1016/s0895-7177(02)00266-2openalex-snapshot
Smooth and adaptive gradient method with retards
inferred← citeshttps://doi.org/10.1016/s0926-9851(00)00034-3openalex-snapshot
A fast and global two point low storage optimization technique for tracing rays in 2D and 3D isotropic media
inferred← citeshttps://doi.org/10.1017/s0003445272007585openalex-snapshot
Universidad Central de Venezuela
inferred← citeshttps://doi.org/10.1023/a:1014828526857openalex-snapshot
Spectral Variants of Krylov Subspace Methods
inferred← citeshttps://doi.org/10.1023/a:1020181927999openalex-snapshot
Preconditioned Spectral Gradient Method
inferred← citeshttps://doi.org/10.1023/a:1020587701058openalex-snapshot
Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient Method
inferred← citeshttps://doi.org/10.1088/1742-6596/1533/2/022099openalex-snapshot
Application of Definite Solution of Partial Differential Equation in Deep Learning
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01840-0openalex-snapshot
Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
inferred← citeshttps://doi.org/10.1109/acssc.1999.832438openalex-snapshot
A super-linear converging two-point gradient algorithm for adaptive filters
inferred← citeshttps://doi.org/10.1111/j.1365-2478.2006.00554.xopenalex-snapshot
Non‐monotone spectral projected gradient method applied to full waveform inversion
inferred← citeshttps://doi.org/10.1137/19m1268641openalex-snapshot
Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1137/20m1321140openalex-snapshot
Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
inferred← citeshttps://doi.org/10.1137/s003614299427315xopenalex-snapshot
Gradient Method with Retards and Generalizations
inferred← citeshttps://doi.org/10.1155/2014/965104openalex-snapshot
Accelerated Double Direction Method for Solving Unconstrained Optimization Problems
inferred← citeshttps://doi.org/10.1155/2015/283679openalex-snapshot
A Transformation of Accelerated Double Step Size Method for Unconstrained Optimization
inferred← citeshttps://doi.org/10.1155/2018/1523267openalex-snapshot
Hybrid Modification of Accelerated Double Direction Method
inferred← citeshttps://doi.org/10.14288/1.0051410openalex-snapshot
Fluid surface reconstruction from particles
inferred← citeshttps://doi.org/10.1590/s0101-82052008000200003openalex-snapshot
Residual iterative schemes for large-scale nonsymmetric positive definite linear systems
inferred← citeshttps://doi.org/10.18637/jss.v060.i03openalex-snapshot
Spectral Projected Gradient Methods: Review and Perspectives
inferred← citeshttps://doi.org/10.26422/mat.a.2004.7.veropenalex-snapshot
A survey of the spectral gradient method
inferred← citeshttps://doi.org/10.3390/a18100622openalex-snapshot
Feature Selection Method Based on Simultaneous Perturbation Stochastic Approximation Technique Evaluated on Cancer Genome Data Classification
inferred← citeshttps://doi.org/10.4208/jcm.2001-m2018-0205openalex-snapshot
Two Novel Gradient Methods with Optimal Step Sizes
inferred← citeshttps://doi.org/10.4208/jcm.v23.n3.p225openalex-snapshot
Preconditioned Spectral Projected Gradient Method on Convex Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1806.10974openalex-snapshot
Analysis and Performance of the Barzilai-Borwein Step-Size Rules for Optimization Problems in Hilbert Spaces
inferred← citeshttps://doi.org/10.70675/b1b31cb5z86a1z4bb3z982ez8dff981917bdopenalex-snapshot
Iterative methods with retards for the solution of large-scale linear systems
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.