On the public citation graph

Parametric optimal design

0 signed · 39 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/nme.1620050204openalex-snapshot
A computational method for optimal structural design. I. Piecewise uniform structures
inferredcites →https://doi.org/10.1007/978-3-642-85643-3openalex-snapshot
Approximation of Functions: Theory and Numerical Methods
inferredcites →https://doi.org/10.1007/bf00933345openalex-snapshot
Parametric optimal design
inferredcites →https://doi.org/10.1007/bf00934653openalex-snapshot
Optimum design in the presence of parametric uncertainty
inferredcites →https://doi.org/10.1007/bf01580247openalex-snapshot
Computational experience in sensitivity analysis for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01580677openalex-snapshot
Sensitivity analysis for nonlinear programming using penalty methods
inferredcites →https://doi.org/10.1016/0020-7403(68)90021-0openalex-snapshot
Structural optimization under multiple loading
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1080/00401706.1966.10490393openalex-snapshot
A First Course in Numerical Analysis
inferredcites →https://doi.org/10.1090/mmono/028openalex-snapshot
The Functional Method and Its Applications
inferredcites →https://doi.org/10.1090/qam/10666openalex-snapshot
A method for the solution of certain non-linear problems in least squares
inferredcites →https://doi.org/10.1109/tac.1971.1099741openalex-snapshot
Optimal control with minimax cost
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1115/1.3426572openalex-snapshot
Optimization Methods for Engineering Design
inferredcites →https://doi.org/10.1115/1.3426750openalex-snapshot
An Algorithmic Approach to Nonlinear Analysis and Optimization
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1287/opre.21.1.37openalex-snapshot
Mathematical Programs with Optimization Problems in the Constraints
inferredcites →https://doi.org/10.1515/9781400882014-002openalex-snapshot
1. Some Topics in Two-Person Games
inferredcites →https://doi.org/10.2307/2004443openalex-snapshot
Introduction to Approximation Theory
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2005111openalex-snapshot
Computational Methods in Optimization: A Unified Approach
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum
inferredcites →https://doi.org/10.2307/2005592openalex-snapshot
Numerical Methods for Unconstrained Optimization
inferredcites →https://doi.org/10.2307/2313284openalex-snapshot
Introduction to Topology and Modern Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nme.1620110106openalex-snapshot
Optimal structural design under dynamic loads
inferred← citeshttps://doi.org/10.1002/nme.1620381604openalex-snapshot
A linear programming formulation for incremental contact analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-52465-3_20openalex-snapshot
Design Sensitivity Analysis and Optimization of Kinematically Driven Systems
inferred← citeshttps://doi.org/10.1007/bf02953387openalex-snapshot
Numerical implementation of three-dimensional frictional contact by a linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0020-7683(92)90027-qopenalex-snapshot
Periodic loading in frictional contact formulated by complementarity
inferred← citeshttps://doi.org/10.1016/0045-7949(87)90064-2openalex-snapshot
Sensitivity analysis for reliability-based optimization using an AFOSM method
inferred← citeshttps://doi.org/10.1016/0045-7949(93)90200-wopenalex-snapshot
Sensitivity analysis for automatic loading in frictional contact formulated by complementarity
inferred← citeshttps://doi.org/10.1016/0045-7949(94)00439-aopenalex-snapshot
Reliability-based structural optimal design using the Neumann expansion technique
inferred← citeshttps://doi.org/10.1016/0045-7949(95)00433-5openalex-snapshot
Reliability-based shape optimization of two-dimensional elastic problems using BEM
inferred← citeshttps://doi.org/10.1016/0096-3003(83)90005-xopenalex-snapshot
Parametric optimization with dynamic systems
inferred← citeshttps://doi.org/10.1080/03052157608960596openalex-snapshot
FAIL-SAFE OPTIMAL DESIGN OF STRUCTURES
inferred← citeshttps://doi.org/10.1080/03052157608960597openalex-snapshot
OPTIMAL SYNTHESIS OF PLANAR MECHANISMS BY PARAMETRIC DESIGN TECHNIQUES
inferred← citeshttps://doi.org/10.1080/03052159008941162openalex-snapshot
DESIGN OPTIMIZATION WITH SENSITIVITY CONSTRAINTS
inferred← citeshttps://doi.org/10.1080/08905458708905132openalex-snapshot
A Reliability-Based Optimal Design Using Advanced First Order Second Moment Method
showing the first 14 of 15 · page through all 15
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.