On the public citation graph
Feasible direction methods for stochastic programming problems
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.
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.1007/978-1-4684-9352-8openalex-snapshot
Stochastic Approximation Methods for Constrained and Unconstrained Systems
inferredcites →https://doi.org/10.1007/bf01588952openalex-snapshot
Nonlinear programming methods in the presence of noise
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/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: 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/9781119815068.ch5openalex-snapshot
Derivative‐Based Stochastic Search
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_6openalex-snapshot
Stochastic Quasigradient Methods
inferred← citeshttps://doi.org/10.1007/bfb0006877openalex-snapshot
A method of feasible directions for solving nonsmooth stochastic programming problems
inferred← citeshttps://doi.org/10.1016/0167-7152(87)90092-7openalex-snapshot
A stochastic approximation counterpart of the feasible direction method
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0218-mopenalex-snapshot
A new approach to stochastic programming problems: Discrete model
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/s0305-0548(96)00056-1openalex-snapshot
A new heuristic algorithm for probabilistic optimization
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)00024-2openalex-snapshot
A nested layered network model for parallel solutions of discrete SPPs
inferred← citeshttps://doi.org/10.1080/02331939008843527openalex-snapshot
Optimal Step Sizes in Semi-Stochastic Approximation Procedures. I
inferred← citeshttps://doi.org/10.1080/02331939008843548openalex-snapshot
Optimal Step Sizes in Semi-Stochastic Approximation Procedures. II
inferred← citeshttps://doi.org/10.1080/02331939008843562openalex-snapshot
Approximate Feasible Direction Method for Stochastic Programming Problems with Recourse. Linear Inequality Deterministic Constraints
inferred← citeshttps://doi.org/10.1109/access.2019.2963196openalex-snapshot
Stochastic Downlink Power Control for Various User Requirements
inferred← citeshttps://doi.org/10.1109/icassp.2017.7953048openalex-snapshot
Large-scale nonconvex stochastic optimization by Doubly Stochastic Successive Convex approximation
inferred← citeshttps://doi.org/10.1109/icassp.2018.8461449openalex-snapshot
Parallel Stochastic Successive Convex Approximation Method for Large-Scale Dictionary Learning
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9501004openalex-snapshot
Sample-based Federated Learning via Mini-batch SSCA
inferred← citeshttps://doi.org/10.1109/jiot.2020.3003473openalex-snapshot
Stochastic Transceiver Optimization in Multi-Tags Symbiotic Radio Systems
inferred← citeshttps://doi.org/10.1109/jiot.2024.3367752openalex-snapshot
A Two-Stage Multiband Delay Estimation Scheme via Stochastic Particle-Based Variational Bayesian Inference
inferred← citeshttps://doi.org/10.1109/jsac.2022.3196095openalex-snapshot
Robust Beamforming for Active Reconfigurable Intelligent Omni-Surface in Vehicular Communications
inferred← citeshttps://doi.org/10.1109/jsac.2024.3414626openalex-snapshot
A Stochastic Particle Variational Bayesian Inference Inspired Deep-Unfolding Network for Sensing Over Wireless Networks
inferred← citeshttps://doi.org/10.1109/jstsp.2018.2819084openalex-snapshot
Stochastic Successive Convex Optimization for Two-Timescale Hybrid Precoding in Massive MIMO
inferred← citeshttps://doi.org/10.1109/lcomm.2021.3093165openalex-snapshot
Latency Minimization in Intelligent Reflecting Surface Assisted D2D Offloading Systems
inferred← citeshttps://doi.org/10.1109/lwc.2019.2963032openalex-snapshot
Stochastic Successive Convex Approximation for General Stochastic Optimization Problems
inferred← citeshttps://doi.org/10.1109/lwc.2021.3112984openalex-snapshot
Delay-Aware Stochastic Resource Management for Mobile Edge Computing Systems via Constrained Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/spawc.2013.6612036openalex-snapshot
Parallel stochastic decomposition algorithms for multi-agent systems
inferred← citeshttps://doi.org/10.1109/tac.1983.1103184openalex-snapshot
Stochastic approximation method with gradient averaging for unconstrained problems
inferred← citeshttps://doi.org/10.1109/tsp.2016.2531627openalex-snapshot
A Parallel Decomposition Method for Nonconvex Stochastic Multi-Agent Optimization Problems
inferred← citeshttps://doi.org/10.1109/tsp.2018.2871389openalex-snapshot
Online Successive Convex Approximation for Two-Stage Stochastic Nonconvex Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2019.2905813openalex-snapshot
Two-Timescale Hybrid Compression and Forward for Massive MIMO Aided C-RAN
inferred← citeshttps://doi.org/10.1109/tsp.2019.2925601openalex-snapshot
Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2019.2926017openalex-snapshot
Randomized Two-Timescale Hybrid Precoding for Downlink Multicell Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/tsp.2021.3079807openalex-snapshot
Two-Stage Stochastic Optimization Via Primal-Dual Decomposition and Deep Unrolling
inferred← citeshttps://doi.org/10.1109/tsp.2021.3094971openalex-snapshot
Practical Precoding via Asynchronous Stochastic Successive Convex Approximation
inferred← citeshttps://doi.org/10.1109/tsp.2022.3158737openalex-snapshot
Successive Convex Approximation Based Off-Policy Optimization for Constrained Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tsp.2022.3185895openalex-snapshot
Sample-Based and Feature-Based Federated Learning for Unconstrained and Constrained Nonconvex Optimization via Mini-batch SSCA
inferred← citeshttps://doi.org/10.1109/tsp.2024.3461963openalex-snapshot
Single-Loop Deep Actor-Critic for Constrained Reinforcement Learning With Provable Convergence
inferred← citeshttps://doi.org/10.1109/tsp.2026.3733690openalex-snapshot
Stochastic SCA-Based Beamforming for NOMA-Assisted UAVs Backscatter-ISAC With Imperfect CSI
inferred← citeshttps://doi.org/10.1109/tvt.2024.3510372openalex-snapshot
RISs-Enabled Separation of Multi-User Collided Signals in IQ Domain Based on Two-Stage Online Optimization
inferred← citeshttps://doi.org/10.1109/twc.2020.2993442openalex-snapshot
Randomized Channel Sparsifying Hybrid Precoding for FDD Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/twc.2021.3072382openalex-snapshot
Two-Timescale Beamforming Optimization for Intelligent Reflecting Surface Aided Multiuser Communication With QoS Constraints
inferred← citeshttps://doi.org/10.1109/twc.2021.3139097openalex-snapshot
Sparse Hybrid Precoding for Power Minimization With an Adaptive Antenna Structure in Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/twc.2023.3297995openalex-snapshot
Joint UL/DL Dictionary Learning and Channel Estimation via Two-Timescale Optimization in Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/twc.2025.3597962openalex-snapshot
Context-Aware Constrained Reinforcement Learning-Based Energy-Efficient Power Scheduling for Non-Stationary XR Data Traffic
inferred← citeshttps://doi.org/10.1287/mnsc.27.6.698openalex-snapshot
Decision Problems Under Risk and Chance Constrained Programming: Dilemmas in the Transition
inferred← citeshttps://doi.org/10.1287/moor.1040.0107openalex-snapshot
Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.12.1.32openalex-snapshot
A Linearization Method for Nonsmooth Stochastic Programming Problems
inferred← citeshttps://doi.org/10.1287/opre.48.1.73.12452openalex-snapshot
Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
inferred← citeshttps://doi.org/10.1287/trsc.36.1.21.570openalex-snapshot
An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02927openalex-snapshot
Lightweight Stochastic Optimization for Minimizing Finite Sums with Infinite Data
inferred← citeshttps://doi.org/10.48550/arxiv.1903.01932openalex-snapshot
Escaping Saddle Points with the Successive Convex Approximation Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09901openalex-snapshot
Parallel Stochastic Optimization Framework for Large-Scale Non-Convex Stochastic Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2005.10696openalex-snapshot
Novel Policy Seeking with Constrained Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2103.09506openalex-snapshot
Sample-based Federated Learning via Mini-batch SSCA
inferred← citeshttps://doi.org/10.70675/85fd6e51z4b30z433bz9739z38941480926fopenalex-snapshot
Online Distributed Learning : A Projection-Free Approach
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.