On the public citation graph

Computable error bounds for nonlinear programming

https://doi.org/10.1007/bf01580124
0 signed · 32 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/bf01585500openalex-snapshot
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
inferredcites →https://doi.org/10.1007/bf02165313openalex-snapshot
The algorithmic language triplex-Algol 60
inferredcites →https://doi.org/10.1090/s0025-5718-1968-0229411-4openalex-snapshot
On Solving Systems of Equations Using Interval Arithmetic
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_232openalex-snapshot
αBB algorithm; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Continuous global optimization: Applications; Continuous global optimization: Models, algorithms and software; Global optimization: Application…
inferred← citeshttps://doi.org/10.1007/978-0-387-36721-7_5openalex-snapshot
An Interval Partitioning Approach for Continuous Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_306openalex-snapshot
Interval Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_14openalex-snapshot
Interval Methods
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_20openalex-snapshot
Signomial Dual Kuhn-Tucker Intervals
inferred← citeshttps://doi.org/10.1007/978-3-031-85096-7_12openalex-snapshot
Applications
inferred← citeshttps://doi.org/10.1007/bf00119986openalex-snapshot
What can interval analysis do for global optimization?
inferred← citeshttps://doi.org/10.1007/bf00933598openalex-snapshot
Signomial dual Kuhn-tucker intervals
inferred← citeshttps://doi.org/10.1007/bf01580732openalex-snapshot
Computable bounds on parametric solutions of convex problems
inferred← citeshttps://doi.org/10.1007/bf01582158openalex-snapshot
Characterization of perturbed mathematical programs and interval analysis
inferred← citeshttps://doi.org/10.1007/bf02055203openalex-snapshot
Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
inferred← citeshttps://doi.org/10.1007/bf02281726openalex-snapshot
Interval analytic treatment of convex programming problems
inferred← citeshttps://doi.org/10.1007/s10589-006-6447-zopenalex-snapshot
An Algorithm for Approximate Multiparametric Convex Programming
inferred← citeshttps://doi.org/10.1007/s10898-008-9297-7openalex-snapshot
Efficient interval partitioning for constrained global optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(82)90004-1openalex-snapshot
Basic results in the development of sensitivity and stability analysis in nonlinear programming
inferred← citeshttps://doi.org/10.1016/0377-0427(93)e0201-vopenalex-snapshot
Computable error bounds for an optimization problem with parallelepiped constraint
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00132-4openalex-snapshot
Verification of constrained minima
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90282-zopenalex-snapshot
Bounds for lagrange multipliers and optimal points
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90288-7openalex-snapshot
Nonlinear equations and optimization
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)60662-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/0714040openalex-snapshot
A Test for Existence of Solutions to Nonlinear Systems
inferred← citeshttps://doi.org/10.1137/1020068openalex-snapshot
Bounding Sets in Function Spaces with Applications to Nonlinear Operator Equations
inferred← citeshttps://doi.org/10.1201/9780203026922.bmattopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1287/opre.27.4.743openalex-snapshot
Bounding Global Minima with Interval Arithmetic
inferred← citeshttps://doi.org/10.1287/opre.35.6.859openalex-snapshot
An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming
inferred← citeshttps://doi.org/10.32657/10356/6217openalex-snapshot
New interval partitioning algorithms for global optimization problems
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.