On the public citation graph

A second-order method for unconstrained optimization

https://doi.org/10.1007/bf00933149
0 signed · 23 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/bf00927673openalex-snapshot
Multiplier and gradient methods
inferredcites →https://doi.org/10.1016/0005-1098(76)90053-4openalex-snapshot
On the global stabilization of locally convergent algorithms
inferredcites →https://doi.org/10.1016/b978-0-12-468650-2.50014-6openalex-snapshot
NEWTON DERIVED METHODS FOR NONLINEAR EQUATIONS AND INEQUALITIES
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50011-7openalex-snapshot
A Second Order Method for the Linearly Constrained Nonlinear Programming Problem
inferredcites →https://doi.org/10.1016/s1474-6670(17)67758-9openalex-snapshot
On The Global Stabilization of Locally Convergent Algorithms for Optimization and Root Finding
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00933150openalex-snapshot
A second-order method for the general nonlinear programming problem
inferred← citeshttps://doi.org/10.1007/bf01582091openalex-snapshot
On the use of directions of negative curvature in a modified newton method
inferred← citeshttps://doi.org/10.1007/s11590-009-0132-yopenalex-snapshot
A nonmonotone truncated Newton–Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
inferred← citeshttps://doi.org/10.1051/m2an/1990240405231openalex-snapshot
Training multi-layered neural network with a trust-region based algorithm
inferred← citeshttps://doi.org/10.1080/01630560008816959openalex-snapshot
Implicitly restarted projection algorithm for solving optimization problems
inferred← citeshttps://doi.org/10.1080/10556780008805794openalex-snapshot
Exploiting negative curvature directions in linesearch methods for unconstrained optimization
inferred← citeshttps://doi.org/10.1109/tit.2016.2632149openalex-snapshot
Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
inferred← citeshttps://doi.org/10.1115/1.3426439openalex-snapshot
International Bibliographies
inferred← citeshttps://doi.org/10.1137/0330023openalex-snapshot
On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
inferred← citeshttps://doi.org/10.1137/0614040openalex-snapshot
Newton Methods for Large-Scale Linear Equality-Constrained Minimization
inferred← citeshttps://doi.org/10.1137/0719026openalex-snapshot
Newton’s Method with a Model Trust Region Modification
inferred← citeshttps://doi.org/10.1137/0722003openalex-snapshot
A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
inferred← citeshttps://doi.org/10.1137/0804017openalex-snapshot
Convergence Theory of Nonlinear Newton–Krylov Algorithms
inferred← citeshttps://doi.org/10.1137/0916009openalex-snapshot
Computing Modified Newton Directions Using a Partial Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s1052623496305560openalex-snapshot
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
inferred← citeshttps://doi.org/10.1155/2009/435851openalex-snapshot
Newton‐Krylov Type Algorithm for Solving Nonlinear Least Squares Problems
inferred← citeshttps://doi.org/10.2118/25252-paopenalex-snapshot
New Procedure for Phase-Equilibrium Computations in Compositional Reservoir Simulators
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.