On the public citation graph

BFGS‐like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming

0 signed · 49 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/(sici)1099-1506(199805/06)5:3<219::aid-nla134>3.0.co;2-7openalex-snapshot
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
inferredcites →https://doi.org/10.1002/1099-1506(200010/12)7:7/8<585::aid-nla214>3.0.co;2-fopenalex-snapshot
Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
inferredcites →https://doi.org/10.1002/nla.2058openalex-snapshot
Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
inferredcites →https://doi.org/10.1002/nla.308openalex-snapshot
Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
inferredcites →https://doi.org/10.1007/s10589-006-9001-0openalex-snapshot
Inexact constraint preconditioners for linear systems arising in interior point methods
inferredcites →https://doi.org/10.1007/s10589-006-9007-7openalex-snapshot
Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
inferredcites →https://doi.org/10.1007/s10589-007-9035-yopenalex-snapshot
On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
inferredcites →https://doi.org/10.1007/s10589-008-9226-1openalex-snapshot
On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
inferredcites →https://doi.org/10.1007/s10589-014-9687-3openalex-snapshot
CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization
inferredcites →https://doi.org/10.1007/s10589-016-9830-4openalex-snapshot
On the update of constraint preconditioners for regularized KKT systems
inferredcites →https://doi.org/10.1007/s10957-007-9264-3openalex-snapshot
Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming
inferredcites →https://doi.org/10.1007/s11590-009-0150-9openalex-snapshot
Starting-point strategies for an infeasible potential reduction method
inferredcites →https://doi.org/10.1016/0168-9274(95)00089-5openalex-snapshot
Software for simplified Lanczos and QMR algorithms
inferredcites →https://doi.org/10.1016/j.ejor.2011.09.017openalex-snapshot
Interior point methods 25 years later
inferredcites →https://doi.org/10.1016/j.laa.2012.11.022openalex-snapshot
Spectral analysis of inexact constraint preconditioning for symmetric saddle point matrices
inferredcites →https://doi.org/10.1016/j.mcm.2010.11.064openalex-snapshot
Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
inferredcites →https://doi.org/10.1017/s0962492904000212openalex-snapshot
Numerical solution of saddle point problems
inferredcites →https://doi.org/10.1023/b:coap.0000026882.34332.1bopenalex-snapshot
Preconditioning Indefinite Systems in Interior Point Methods for Optimization
inferredcites →https://doi.org/10.1080/10556788.2016.1264398openalex-snapshot
Low rank updates in preconditioning the saddle point systems arising from data assimilation problems
inferredcites →https://doi.org/10.1137/04060768xopenalex-snapshot
Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
inferredcites →https://doi.org/10.1137/0716059openalex-snapshot
A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
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/0801023openalex-snapshot
A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
inferredcites →https://doi.org/10.1137/08074008openalex-snapshot
On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
inferredcites →https://doi.org/10.1137/1.9781611971453openalex-snapshot
Primal-Dual Interior-Point Methods
inferredcites →https://doi.org/10.1137/100803419openalex-snapshot
Efficient Preconditioner Updates for Shifted Linear Systems
inferredcites →https://doi.org/10.1137/110860707openalex-snapshot
A Preconditioning Framework for Sequences of Diagonally Modified Linear Systems Arising in Optimization
inferredcites →https://doi.org/10.1137/130947155openalex-snapshot
Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
inferredcites →https://doi.org/10.1137/s0895479800375540openalex-snapshot
Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
inferredcites →https://doi.org/10.1137/s0895479899351805openalex-snapshot
Constraint Preconditioning for Indefinite Linear Systems
inferredcites →https://doi.org/10.1137/s1052623497327854openalex-snapshot
Automatic Preconditioning by Limited Memory Quasi-Newton Updating
inferredcites →https://doi.org/10.1137/s106482759529382xopenalex-snapshot
An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations
inferredcites →https://doi.org/10.21236/ada131444openalex-snapshot
Quasi-Newton Methods Using Multiple Secant Equations.
inferredcites →https://doi.org/10.48550/arxiv.1412.8045openalex-snapshot
Action constrained quasi-Newton 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/gamm.202000015openalex-snapshot
Preconditioners for Krylov subspace methods: An overview
inferred← citeshttps://doi.org/10.1002/nla.2181openalex-snapshot
Editorial: Novel methods and theories in numerical algebra with interdisciplinary applications
inferred← citeshttps://doi.org/10.1007/s10589-019-00102-zopenalex-snapshot
Quasi-Newton approaches to interior point methods for quadratic problems
inferred← citeshttps://doi.org/10.1007/s10589-024-00584-6openalex-snapshot
Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/s10589-024-00606-3openalex-snapshot
Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations
inferred← citeshttps://doi.org/10.1007/s11012-019-01006-2openalex-snapshot
Mathematical analysis of a solution method for finite-strain holonomic plasticity of Cosserat materials
inferred← citeshttps://doi.org/10.1007/s11565-022-00422-9openalex-snapshot
Block preconditioners for linear systems in interior point methods for convex constrained optimization
inferred← citeshttps://doi.org/10.1007/s11831-022-09739-2openalex-snapshot
Linear Solvers for Reservoir Simulation Problems: An Overview and Recent Developments
inferred← citeshttps://doi.org/10.1007/s40819-019-0760-6openalex-snapshot
Extending the Applicability of a Seventh Order Method Without Inverses of Derivatives Under Weak Conditions
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.134568openalex-snapshot
NeuroSQP: Learning-accelerated sequential quadratic programming for large-scale equality-constrained nonlinear optimization
inferred← citeshttps://doi.org/10.1137/19m1256907openalex-snapshot
A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/19m1291753openalex-snapshot
Constraint-Preconditioned Krylov Solvers for Regularized Saddle-Point Systems
inferred← citeshttps://doi.org/10.3390/a13040100openalex-snapshot
A Survey of Low-Rank Updates of Preconditioners for Sequences of Symmetric Linear Systems
inferred← citeshttps://doi.org/10.3390/axioms7030044openalex-snapshot
On Partial Cholesky Factorization and a Variant of Quasi-Newton Preconditioners for Symmetric Positive Definite Matrices
inferred← citeshttps://doi.org/10.5281/zenodo.3926751openalex-snapshot
Constraint-Preconditioned Krylov Solvers for Regularized Saddle-Point 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.