On the public citation graph

Nonlinear programming methods in the presence of noise

https://doi.org/10.1007/bf01588952
0 signed · 66 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.1007/bf01071091openalex-snapshot
On the method of generalized stochastic gradients and quasi-F�jer sequences
inferredcites →https://doi.org/10.1007/bf01071403openalex-snapshot
Methods of solution of nonlinear extremal problems
inferredcites →https://doi.org/10.1007/bf01072852openalex-snapshot
On the minimization of nondifferentiable functions
inferredcites →https://doi.org/10.1016/0005-1098(76)90077-7openalex-snapshot
Multiplier methods: A survey
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/0041-5553(70)90036-4openalex-snapshot
Iterative methods using lagrange multipliers for solving extremal problems with constraints of the equation type
inferredcites →https://doi.org/10.1016/0041-5553(71)90004-8openalex-snapshot
Convergence of methods of feasible directions in extremal problems
inferredcites →https://doi.org/10.1016/0041-5553(71)90094-2openalex-snapshot
The convergence rate of the penalty function method
inferredcites →https://doi.org/10.1016/0041-5553(74)90004-4openalex-snapshot
The method of penalty estimates for conditional extremum problems
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6155-7openalex-snapshot
Adaptation and Learning in Automatic Systems
inferredcites →https://doi.org/10.1090/mmono/047openalex-snapshot
Stochastic Approximation and Recursive Estimation
inferredcites →https://doi.org/10.1090/s0002-9904-1943-07818-4openalex-snapshot
Variational methods for the solution of problems of equilibrium and vibrations
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11178-2openalex-snapshot
Convex programming in Hilbert space
inferredcites →https://doi.org/10.1093/comjnl/13.2.178openalex-snapshot
A new method for the optimization of a nonlinear function subject to nonlinear constraints
inferredcites →https://doi.org/10.1109/tac.1974.1100580openalex-snapshot
Stochastic approximation type methods for constrained systems: Algorithms and numerical results
inferredcites →https://doi.org/10.1214/aos/1176342759openalex-snapshot
Stochastic Approximation Algorithms for Constrained Optimization Problems
inferredcites →https://doi.org/10.2307/2002823openalex-snapshot
Studies in Linear and Non-Linear Programming.
inferredcites →https://doi.org/10.2307/2005111openalex-snapshot
Computational Methods in Optimization: A Unified Approach

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jae.3950050407openalex-snapshot
An algorithm for the solution of stochastic optimal control problems for large nonlinear econometric models
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_662openalex-snapshot
Stochastic Quasigradient Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_4openalex-snapshot
Nonlinear Programming Techniques Applied to Stochastic Programs with Recourse
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_6openalex-snapshot
Stochastic Quasigradient Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_22openalex-snapshot
Stochastic Programming: Solution Techniques and Approximation Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_29openalex-snapshot
Robust Optimal Policy Methods for Nonlinear Models
inferred← citeshttps://doi.org/10.1007/bf01581643openalex-snapshot
Feasible direction methods for stochastic programming problems
inferred← citeshttps://doi.org/10.1007/bf01874449openalex-snapshot
Modeling and solution strategies for unconstrained stochastic optimization problems
inferred← citeshttps://doi.org/10.1007/bf02204868openalex-snapshot
Stochastic modelling and optimization for environmental management
inferred← citeshttps://doi.org/10.1007/bf02576496openalex-snapshot
A modified Bernstein-technique for estimating noise-perturbed function values
inferred← citeshttps://doi.org/10.1007/bfb0006874openalex-snapshot
Algorithms based upon generalized linear programming for stochastic programs with recourse
inferred← citeshttps://doi.org/10.1007/bfb0006876openalex-snapshot
Contributions to the methodology of stochastic optimization
inferred← citeshttps://doi.org/10.1007/bfb0121123openalex-snapshot
Algorithms for stochastic programs: The case of nonstochastic tenders
inferred← citeshttps://doi.org/10.1007/s10107-008-0262-5openalex-snapshot
The effect of deterministic noise in subgradient methods
inferred← citeshttps://doi.org/10.1007/s10107-018-01361-0openalex-snapshot
Faster subgradient methods for functions with Hölderian growth
inferred← citeshttps://doi.org/10.1007/s10589-020-00194-yopenalex-snapshot
Convergence rates of subgradient methods for quasi-convex optimization problems
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90267-4openalex-snapshot
Stochastic and robust control of nonlinear economic systems
inferred← citeshttps://doi.org/10.1016/b978-0-08-037538-0.50035-6openalex-snapshot
OPTIMAL, TIME CONSISTENT ROBUST FEEDBACK RULES UNDER PARAMETER, FORECAST AND BEHAVIOURAL UNCERTAINTY
inferred← citeshttps://doi.org/10.1016/b978-0-12-012736-8.50007-3openalex-snapshot
Methods for Optimal Economic Policy Design
inferred← citeshttps://doi.org/10.1016/j.aml.2022.108348openalex-snapshot
On finite termination of an inexact Proximal Point algorithm
inferred← citeshttps://doi.org/10.1016/j.csda.2004.06.007openalex-snapshot
Stochastic programming methods in the response surface methodology
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.011openalex-snapshot
A stochastic quasi-Newton method for simulation response optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.07.044openalex-snapshot
Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
inferred← citeshttps://doi.org/10.1016/s0005-1098(98)00150-2openalex-snapshot
An algorithm for constrained nonlinear optimization under uncertainty
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00034-xopenalex-snapshot
Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)53451-5openalex-snapshot
Optimal, Time Consistent Robust Feedback Rules Under Parameter, Forecast and Behavioural Uncertainty
inferred← citeshttps://doi.org/10.1080/00207177908922835openalex-snapshot
Global optimization of functions by the random optimization method
inferred← citeshttps://doi.org/10.1080/02331934.2020.1745205openalex-snapshot
Weak subgradient method for solving nonsmooth nonconvex optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2026.2663349openalex-snapshot
Complexity of inexact proximal point algorithm for minimizing convex functions with Holderian growth
inferred← citeshttps://doi.org/10.1080/02331938408842957openalex-snapshot
Convergence properties of stochastic optimization procedures
inferred← citeshttps://doi.org/10.1080/0305215x.2013.776550openalex-snapshot
Spiral bacterial foraging optimization method: Algorithm, evaluation and convergence analysis
inferred← citeshttps://doi.org/10.1080/17442508308833246openalex-snapshot
stochastic quasigradient methods and their application to system optimization †
inferred← citeshttps://doi.org/10.1109/acc.2015.7170902openalex-snapshot
Differentially private cloud-based multi-agent optimization with constraints
inferred← citeshttps://doi.org/10.1109/cdc.1989.70527openalex-snapshot
Robust optimal policy methods for nonlinear models
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798824openalex-snapshot
Differentially private objective functions in distributed cloud-based optimization
inferred← citeshttps://doi.org/10.1109/tcns.2017.2751458openalex-snapshot
Cloud-Enabled Differentially Private Multiagent Optimization With Constraints
inferred← citeshttps://doi.org/10.1109/tsp.2011.2143709openalex-snapshot
Power Control With Imperfect Exchanges and Applications to Spectrum Sharing
inferred← citeshttps://doi.org/10.1137/19m1244469openalex-snapshot
Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs
inferred← citeshttps://doi.org/10.1137/21m1450999openalex-snapshot
Constrained Optimization in the Presence of Noise
inferred← citeshttps://doi.org/10.1137/s0363012992238369openalex-snapshot
The Minimization of Semicontinuous Functions: Mollifier Subgradients
inferred← citeshttps://doi.org/10.1155/2021/5540262openalex-snapshot
A Study on Distributed Optimization over Large-Scale Networked Systems
inferred← citeshttps://doi.org/10.1287/moor.12.1.32openalex-snapshot
A Linearization Method for Nonsmooth Stochastic Programming Problems
inferred← citeshttps://doi.org/10.14288/1.0051537openalex-snapshot
New probabilistic inference algorithms that harness the strengths of variational and Monte Carlo methods
inferred← citeshttps://doi.org/10.48550/arxiv.1509.08161openalex-snapshot
Approximately Truthful Multi-Agent Optimization Using Cloud-Enforced Joint Differential Privacy
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03761openalex-snapshot
Adaptive Sequential SAA for Solving Two-stage Stochastic Linear Programs
inferred← citeshttps://doi.org/10.7551/mitpress/8996.003.0006openalex-snapshot
Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey
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.