On the public citation graph

Trust regions and projected gradients

https://doi.org/10.1007/bfb0042769
0 signed · 38 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/978-3-642-68874-4_11openalex-snapshot
Recent Developments in Algorithms and Software for Trust Region Methods
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/bf01448362openalex-snapshot
Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
inferredcites →https://doi.org/10.1007/bf02591998openalex-snapshot
On the global convergence of trust region algorithms for unconstrained minimization
inferredcites →https://doi.org/10.1007/bf02592073openalex-snapshot
Projected gradient methods for linearly constrained problems
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0929544-3openalex-snapshot
Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
inferredcites →https://doi.org/10.1093/imanum/8.2.231openalex-snapshot
Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0310009openalex-snapshot
The Gradient Projection Method under Mild Differentiability Conditions
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/0725068openalex-snapshot
On the Identification of Active Constraints

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-585-26778-4_4openalex-snapshot
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds
inferred← citeshttps://doi.org/10.1007/bf01580867openalex-snapshot
Convergence properties of trust region methods for linear and convex constraints
inferred← citeshttps://doi.org/10.1007/bf01582214openalex-snapshot
A note on exploiting structure when using slack variables
inferred← citeshttps://doi.org/10.1007/bf01585768openalex-snapshot
A trust-region strategy for minimization on arbitrary domains
inferred← citeshttps://doi.org/10.1007/bf02592099openalex-snapshot
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
inferred← citeshttps://doi.org/10.1007/bf02614392openalex-snapshot
A trust region method for minimization of nonsmooth functions with linear constraints
inferred← citeshttps://doi.org/10.1007/bf02614518openalex-snapshot
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
inferred← citeshttps://doi.org/10.1007/s10107-014-0784-yopenalex-snapshot
An adaptive augmented Lagrangian method for large-scale constrained optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01915-3openalex-snapshot
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
inferred← citeshttps://doi.org/10.1007/s10589-024-00628-xopenalex-snapshot
Efficient proximal subproblem solvers for a nonsmooth trust-region method
inferred← citeshttps://doi.org/10.1007/s10957-015-0853-2openalex-snapshot
An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem
inferred← citeshttps://doi.org/10.1007/s11766-011-1956-7openalex-snapshot
Projected gradient trust-region method for solving nonlinear systems with convex constraints
inferred← citeshttps://doi.org/10.1023/a:1008667728545openalex-snapshot
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds
inferred← citeshttps://doi.org/10.1080/00207160.2020.1755431openalex-snapshot
A trust region method with project step for bound constrained optimization without compact condition
inferred← citeshttps://doi.org/10.1080/01630563.2010.532269openalex-snapshot
Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
inferred← citeshttps://doi.org/10.1080/02331939808844387openalex-snapshot
A feasible trust region method for nonlinear inequality constrained optimization
inferred← citeshttps://doi.org/10.1080/10556780701322970openalex-snapshot
A filter-trust-region method for simple-bound constrained optimization
inferred← citeshttps://doi.org/10.1080/10556788.2015.1071813openalex-snapshot
Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
inferred← citeshttps://doi.org/10.1137/0330029openalex-snapshot
Mesh Independence of the Gradient Projection Method for Optimal Control Problems
inferred← citeshttps://doi.org/10.1137/0802016openalex-snapshot
A Robust Trust Region Method for Constrained Nonlinear Programming Problems
inferred← citeshttps://doi.org/10.1137/0803009openalex-snapshot
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
inferred← citeshttps://doi.org/10.1137/0804032openalex-snapshot
Exposing Constraints
inferred← citeshttps://doi.org/10.1137/s1052623492236481openalex-snapshot
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
inferred← citeshttps://doi.org/10.1137/s1052623498345075openalex-snapshot
Newton's Method for Large Bound-Constrained Optimization Problems
inferred← citeshttps://doi.org/10.3934/naco.2013.3.283openalex-snapshot
A structured trust region method for nonconvex programming with separable structure
inferred← citeshttps://doi.org/10.5194/gmd-7-303-2014openalex-snapshot
Atmospheric inverse modeling with known physical bounds: an example from trace gas emissions
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.