On the public citation graph
Accelerated Frank–Wolfe Algorithms
0 signed · 37 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/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/s0022-247x(62)80015-8openalex-snapshot
An iterative solution to time-optimal control
inferredcites →https://doi.org/10.1051/m2an/196802r100031openalex-snapshot
Convergence d'un algorithme de Franck et Wolfe appliqué à un problème de contrôle
inferredcites →https://doi.org/10.1109/tac.1965.1098170openalex-snapshot
Iterative computation procedures for an optimum control problem
inferredcites →https://doi.org/10.1137/0304007openalex-snapshot
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
inferredcites →https://doi.org/10.1137/0305019openalex-snapshot
The Minimization of a Smooth Convex Functional on a Convex Set
inferredcites →https://doi.org/10.1137/0305029openalex-snapshot
An Iterative Procedure for Solving the Time-Optimal Regulator Problem
inferredcites →https://doi.org/10.1137/0306032openalex-snapshot
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
inferredcites →https://doi.org/10.1137/0307030openalex-snapshot
An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
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_146openalex-snapshot
Rosen's method, global convergence, and Powell's conjectureCost approximation algorithms; Simplicial decomposition; Stochastic transportation and location problems; Traffic network equilibriumFRANK–WOLFE ALGORITHM
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_468openalex-snapshot
Simplicial Decomposition Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_615openalex-snapshot
Simplicial Decomposition Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-69404-7_29openalex-snapshot
Projection Approach Versus Gradient Descent for Network’s Flows Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-51572-9_11openalex-snapshot
An Extended Frank-Wolfe Algorithm with Application to Portfolio Selection Problems
inferred← citeshttps://doi.org/10.1007/s101070100255openalex-snapshot
Solving large quadratic assignment problems on computational grids
inferred← citeshttps://doi.org/10.1007/s10696-011-9107-2openalex-snapshot
Project portfolio selection under uncertainty with outsourcing opportunities
inferred← citeshttps://doi.org/10.1016/0009-2509(78)80084-0openalex-snapshot
A quadratic programming technique with application to kinetic rate constant determination
inferred← citeshttps://doi.org/10.1016/0022-247x(78)90137-3openalex-snapshot
Conditional gradient algorithms with open loop step size rules
inferred← citeshttps://doi.org/10.1016/j.engappai.2022.105393openalex-snapshot
A bi-level model and hybrid heuristic algorithm for the optimal location of prefabricated building industrial park
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.11.155openalex-snapshot
A Post-processing Technique for the Four-step Travel Demand Modeling Executed Through a Feedback Loop
inferred← citeshttps://doi.org/10.1080/02331939008843577openalex-snapshot
An algorithm for nonlinear programs over Cartesian product sets
inferred← citeshttps://doi.org/10.1080/02331939308843903openalex-snapshot
A partial linearization method for the traffic assignment problem
inferred← citeshttps://doi.org/10.1109/59.207311openalex-snapshot
Daily generation scheduling optimization with transmission constraints: a new class of algorithms
inferred← citeshttps://doi.org/10.1109/iiai-aai.2018.00116openalex-snapshot
An Acceleration Method for Equilibrium Solution Search in Multiple OD Selfish Routing Games
inferred← citeshttps://doi.org/10.1287/trsc.19.4.445openalex-snapshot
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
inferred← citeshttps://doi.org/10.1287/trsc.26.1.4openalex-snapshot
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
inferred← citeshttps://doi.org/10.13140/2.1.3071.3120openalex-snapshot
Convex Cost Multicommodity Flow Problems: Applications and Algorithms
inferred← citeshttps://doi.org/10.17615/k256-xr13openalex-snapshot
Continuous Optimization Methods for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.26153/tsw/10153openalex-snapshot
Provably effective algorithms for min-max optimization
inferred← citeshttps://doi.org/10.3141/1771-13openalex-snapshot
Accelerating Strategies and Computational Studies of the Frank–Wolfe Algorithm for the Traffic Assignment Problem
inferred← citeshttps://doi.org/10.3141/2283-14openalex-snapshot
Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4828openalex-snapshot
Generalized Conditional Gradient for Sparse Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1906.02436openalex-snapshot
Primal-Dual Block Frank-Wolfe
inferred← citeshttps://doi.org/10.7708/ijtte.2014.4(3).05openalex-snapshot
SLOPE-BASED PATH SHIFT PROPENSITY ALGORITHM FOR THE STATIC TRAFFIC ASSIGNMENT PROBLEM
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.