On the public citation graph
A projected Newton method for minimization problems with nonlinear inequality constraints
0 signed · 62 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/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/bf00932842openalex-snapshot
A stable approach to Newton's method for general mathematical programming problems inR n
inferredcites →https://doi.org/10.1007/bf00933161openalex-snapshot
Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
inferredcites →https://doi.org/10.1007/bf00933861openalex-snapshot
A stable approach to Newton's method for general mathematical programming problems inR n
inferredcites →https://doi.org/10.1007/bf00934463openalex-snapshot
Differential dynamic programming and Newton's method for discrete optimal control problems
inferredcites →https://doi.org/10.1007/bf00935303openalex-snapshot
Differential dynamic programming and separable programs
inferredcites →https://doi.org/10.1007/bf00939081openalex-snapshot
On the convergence of projected gradient processes to singular critical points
inferredcites →https://doi.org/10.1007/bf00939866openalex-snapshot
A projected Newton method in a Cartesian product of balls
inferredcites →https://doi.org/10.1007/bf00940728openalex-snapshot
Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
inferredcites →https://doi.org/10.1007/bf01442181openalex-snapshot
Newton's method for singular constrained optimization problems
inferredcites →https://doi.org/10.1007/bf01448362openalex-snapshot
Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
inferredcites →https://doi.org/10.1007/bf01449032openalex-snapshot
A class of superlinearly convergent projection algorithms with relaxed stepsizes
inferredcites →https://doi.org/10.1007/bf01449042openalex-snapshot
Newton?Goldstein convergence rates for convex constrained minimization problems with singular solutions
inferredcites →https://doi.org/10.1007/bf01580366openalex-snapshot
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bf01588224openalex-snapshot
The computation of Lagrange-multiplier estimates for constrained minimization
inferredcites →https://doi.org/10.1007/bf01589439openalex-snapshot
Continuity of the null space basis and constrained optimization
inferredcites →https://doi.org/10.1007/bf02591747openalex-snapshot
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
inferredcites →https://doi.org/10.1016/0022-247x(87)90161-2openalex-snapshot
Asymptotic decay rates from the growth properties of Liapunov functions near singular attractors
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1063/1.3051179openalex-snapshot
Introduction to Functional Analysis for Scientists and Technologists
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0318050openalex-snapshot
Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
inferredcites →https://doi.org/10.1137/0319022openalex-snapshot
Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
inferredcites →https://doi.org/10.1137/0320014openalex-snapshot
On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0320018openalex-snapshot
Projected Newton Methods for Optimization Problems with Simple Constraints
inferredcites →https://doi.org/10.1137/0322061openalex-snapshot
Two-Metric Projection Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0720020openalex-snapshot
Convergence Rates for Newton’s Method at Singular Points
inferredcites →https://doi.org/10.1137/0722050openalex-snapshot
Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
inferredcites →https://doi.org/10.1137/0725068openalex-snapshot
On the Identification of Active Constraints
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1137/1.9781611971200openalex-snapshot
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2314308openalex-snapshot
Introduction to Functional Analysis for Scientists and Technologists.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_105openalex-snapshot
Dynamic Programming and Newton’s Method in Unconstrained Optimal Control
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_150openalex-snapshot
Dynamic Programming and Newton’s Method in Unconstrained Optimal Control
inferred← citeshttps://doi.org/10.1007/978-1-4612-0439-8_32openalex-snapshot
Scaled Gradient Projection Methods for Optimal Control Problems and Other Structured Nonlinear Programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-3632-7_6openalex-snapshot
Gradient-Related Constrained Minimization Algorithms in Function Spaces: Convergence Properties and Computational Implications
inferred← citeshttps://doi.org/10.1007/978-1-4757-6095-8_7openalex-snapshot
Augmented Gradient Projection Calculations for Regulator Problems with Pointwise State and Control Constraints
inferred← citeshttps://doi.org/10.1007/bf00940784openalex-snapshot
Interior point methods for optimal control of discrete time systems
inferred← citeshttps://doi.org/10.1007/bf01182323openalex-snapshot
A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01385498openalex-snapshot
Solution of projection problems over polytopes
inferred← citeshttps://doi.org/10.1007/bfb0110540openalex-snapshot
Response optimization of a discrete-time bang-bang optimal control problem
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90060-mopenalex-snapshot
Solution of discrete-time optimal control problems on parallel computers
inferred← citeshttps://doi.org/10.1016/j.cma.2026.119015openalex-snapshot
A gradient-aggregated energy variational XFEM for multi-fracture growth in layered heterogeneous formations
inferred← citeshttps://doi.org/10.1016/s0065-2377(08)60124-6openalex-snapshot
Optimization Strategies for Complex Process Models
inferred← citeshttps://doi.org/10.1023/a:1021733425632openalex-snapshot
Dynamic Programming Method for Constrained Discrete-Time Optimal Control
inferred← citeshttps://doi.org/10.1023/a:1022635205221openalex-snapshot
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control
inferred← citeshttps://doi.org/10.1023/a:1022690711754openalex-snapshot
Family of Projected Descent Methods for Optimization Problems with Simple Bounds
inferred← citeshttps://doi.org/10.1080/00207179108953650openalex-snapshot
Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints
inferred← citeshttps://doi.org/10.1109/cdc.1989.70136openalex-snapshot
A sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints
inferred← citeshttps://doi.org/10.1109/cdc.1989.70139openalex-snapshot
Numerical method for control on shared-memory systems
inferred← citeshttps://doi.org/10.1109/cdc.1989.70140openalex-snapshot
Formal augmented Newtonian projection methods for continuous-time optimal control problems
inferred← citeshttps://doi.org/10.1109/cdc.1989.70141openalex-snapshot
Gradient projection techniques for large-scale optimization problems
inferred← citeshttps://doi.org/10.1109/cdc.2001.980412openalex-snapshot
On state constraint representations and mesh-dependent gradient projection convergence rates for optimal control problems
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263933openalex-snapshot
A simple and efficient algorithm for nonlinear model predictive control
inferred← citeshttps://doi.org/10.1137/0329062openalex-snapshot
A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory
inferred← citeshttps://doi.org/10.1137/0331014openalex-snapshot
A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory
inferred← citeshttps://doi.org/10.1137/0802023openalex-snapshot
An Interior-Point Algorithm for Linearly Constrained Optimization
inferred← citeshttps://doi.org/10.1137/0806026openalex-snapshot
A Parallel Method for Unconstrained Discrete-Time Optimal Control 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.