On the public citation graph

A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm

https://doi.org/10.1137/0306032
0 signed · 84 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.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/net.3230050404openalex-snapshot
A minimum‐cost multicommodity network flow problem concerning imports and exports
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_2openalex-snapshot
Nonlinear Programming in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0219-3_18openalex-snapshot
Cyclic Linearization and Decomposition of Team Game Models
inferred← citeshttps://doi.org/10.1007/978-3-030-34102-2_4openalex-snapshot
Methods for Traffic Flow Assignment in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-97077-1_1openalex-snapshot
Adaptive Variants of Frank-Wolfe Method with Relative Inexact Gradient Information
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/978-3-642-59179-2_17openalex-snapshot
Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_21openalex-snapshot
Soft Margin Boosting as Frank-Wolfe Algorithms
inferred← citeshttps://doi.org/10.1007/bf00939668openalex-snapshot
Partial linearization methods in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf00940201openalex-snapshot
On the convexity of integrals of multivalued mappings: Applications in control theory
inferred← citeshttps://doi.org/10.1007/bf00941156openalex-snapshot
Minimizing pseudoconvex functions on convex compact sets
inferred← citeshttps://doi.org/10.1007/bf01091662openalex-snapshot
Minimization methods with constraints
inferred← citeshttps://doi.org/10.1007/bf01449042openalex-snapshot
Newton?Goldstein convergence rates for convex constrained minimization problems with singular solutions
inferred← citeshttps://doi.org/10.1007/bf01460129openalex-snapshot
Extremal types for certainL p minimization problems and associated large scale nonlinear programs
inferred← citeshttps://doi.org/10.1007/bf01582149openalex-snapshot
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
inferred← citeshttps://doi.org/10.1007/bf02761184openalex-snapshot
Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
inferred← citeshttps://doi.org/10.1007/s001860300327openalex-snapshot
A conditional gradient method with linear rate of convergence for solving convex linear systems
inferred← citeshttps://doi.org/10.1007/s10107-016-1069-4openalex-snapshot
Linearly convergent away-step conditional gradient for non-strongly convex functions
inferred← citeshttps://doi.org/10.1007/s10107-017-1108-9openalex-snapshot
Primal and dual predicted decrease approximation methods
inferred← citeshttps://doi.org/10.1007/s10107-021-01735-xopenalex-snapshot
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
inferred← citeshttps://doi.org/10.1007/s10107-022-01820-9openalex-snapshot
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
inferred← citeshttps://doi.org/10.1007/s10107-022-01840-5openalex-snapshot
Riemannian Optimization via Frank-Wolfe Methods
inferred← citeshttps://doi.org/10.1007/s10107-023-01975-zopenalex-snapshot
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
inferred← citeshttps://doi.org/10.1007/s10115-018-1294-7openalex-snapshot
Distributing Frank–Wolfe via map-reduce
inferred← citeshttps://doi.org/10.1007/s10288-021-00493-yopenalex-snapshot
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods
inferred← citeshttps://doi.org/10.1007/s10479-024-06251-7openalex-snapshot
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods
inferred← citeshttps://doi.org/10.1007/s10589-014-9683-7openalex-snapshot
A constrained optimization reformulation and a feasible descent direction method for $$L_{1/2}$$ L 1 / 2 regularization
inferred← citeshttps://doi.org/10.1007/s10589-022-00434-3openalex-snapshot
Avoiding bad steps in Frank-Wolfe variants
inferred← citeshttps://doi.org/10.1007/s10957-021-01989-7openalex-snapshot
Restarting Frank–Wolfe: Faster Rates under Hölderian Error Bounds
inferred← citeshttps://doi.org/10.1007/s10957-025-02630-7openalex-snapshot
Improved Convergence Rates for the Multiobjective Frank–Wolfe Method
inferred← citeshttps://doi.org/10.1007/s12351-015-0171-3openalex-snapshot
A generic column generation principle: derivation and convergence analysis
inferred← citeshttps://doi.org/10.1007/s12351-015-0205-xopenalex-snapshot
Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method
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/0038-0121(86)90039-xopenalex-snapshot
The spatial price equilibrium problem with path variables
inferred← citeshttps://doi.org/10.1016/0167-6377(85)90016-1openalex-snapshot
Finiteness in restricted simplicial decomposition
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100015openalex-snapshot
First-Order Methods for Convex Optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.08.040openalex-snapshot
First-order methods for the convex hull membership problem
inferred← citeshttps://doi.org/10.1016/j.orl.2021.06.005openalex-snapshot
Complexity of linear minimization and projection on some sets
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00096-1openalex-snapshot
Numerical implementation of two nonconforming finite element methods for unilateral contact
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)62789-7openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80110-0openalex-snapshot
Chapter 6 Network equilibrium models and algorithms
inferred← citeshttps://doi.org/10.1051/cocv/2021042openalex-snapshot
Linear convergence of accelerated conditional gradient algorithms in spaces of measures
inferred← citeshttps://doi.org/10.1051/m2an/197105r100031openalex-snapshot
Tour d'horizon : programmation non linéaire
inferred← citeshttps://doi.org/10.1090/mcom/2002-71-237openalex-snapshot
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01318-7openalex-snapshot
Mixed finite element methods for unilateral problems: convergence analysis and numerical studies
inferred← citeshttps://doi.org/10.1109/tac.1969.1099299openalex-snapshot
Some efficient algorithms for a class of abstract optimization problems arising in optimal control
inferred← citeshttps://doi.org/10.1109/tac.1983.1103183openalex-snapshot
Projected Newton methods and optimization of multicommodity flows
inferred← citeshttps://doi.org/10.1134/s0361768823060038openalex-snapshot
Adaptive Variant of the Frank–Wolfe Algorithm for Convex Optimization Problems
inferred← citeshttps://doi.org/10.1137/0310033openalex-snapshot
A Geometrically Convergent Algorithm for Solving Optimal Control Problems
inferred← citeshttps://doi.org/10.1137/0312050openalex-snapshot
Accelerated Frank–Wolfe Algorithms
inferred← citeshttps://doi.org/10.1137/0317015openalex-snapshot
Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
inferred← citeshttps://doi.org/10.1137/0319022openalex-snapshot
Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
inferred← citeshttps://doi.org/10.1137/0710017openalex-snapshot
Rate of Convergence of a Class of Methods of Feasible Directions
inferred← citeshttps://doi.org/10.1137/1015071openalex-snapshot
An Historical Survey of Computational Methods in Optimal Control
inferred← citeshttps://doi.org/10.1137/15m1008397openalex-snapshot
The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
inferred← citeshttps://doi.org/10.1137/19m1309419openalex-snapshot
Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
inferred← citeshttps://doi.org/10.1137/21m1397349openalex-snapshot
On the Effectiveness of Richardson Extrapolation in Data Science
inferred← citeshttps://doi.org/10.1145/3765626openalex-snapshot
Improved Algorithms and Novel Applications of the FrankWolfe.jl Library
inferred← citeshttps://doi.org/10.1201/b17558-6openalex-snapshot
Hybrid Conditional Gradient-Smoothing Algorithms with Applications to Sparse and Low Rank Regularization
inferred← citeshttps://doi.org/10.1287/mnsc.19.1.62openalex-snapshot
Interactive Goal Programming
inferred← citeshttps://doi.org/10.1287/moor.2022.0057openalex-snapshot
The Iterates of the Frank–Wolfe Algorithm May Not Converge
inferred← citeshttps://doi.org/10.1287/moor.2023.0281openalex-snapshot
New Analysis of an Away-Step Frank–Wolfe Method for Minimizing Log-Homogeneous Barriers
inferred← citeshttps://doi.org/10.1287/opre.2018.1765openalex-snapshot
Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees
inferred← citeshttps://doi.org/10.1287/opre.22.1.160openalex-snapshot
The Effects of Errors in the Estimation of the Gradient on the Frank-Wolfe Algorithm, with Implications for Interactive Programming
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.1609/aaai.v34i04.6150openalex-snapshot
Apprenticeship Learning via Frank-Wolfe
inferred← citeshttps://doi.org/10.17760/d20290439openalex-snapshot
Distributing Frank-Wolfe via map-reduce
inferred← citeshttps://doi.org/10.17760/d20410362openalex-snapshot
Leveraging structural properties for large-scale optimization
inferred← citeshttps://doi.org/10.31857/s0132347423060031openalex-snapshot
Adaptive Variant of the Frank-Wolfe Algorithm for Convex Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5550openalex-snapshot
The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4828openalex-snapshot
Generalized Conditional Gradient for Sparse Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1502.03716openalex-snapshot
The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1511.05932openalex-snapshot
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
inferred← citeshttps://doi.org/10.48550/arxiv.1806.05123openalex-snapshot
Linearly Convergent Frank-Wolfe with Backtracking Line-Search
inferred← citeshttps://doi.org/10.48550/arxiv.2002.02835openalex-snapshot
On the Effectiveness of Richardson Extrapolation in Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04320openalex-snapshot
Self-Concordant Analysis of Frank-Wolfe Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06369openalex-snapshot
Boosting Frank-Wolfe by Chasing Gradients
inferred← citeshttps://doi.org/10.48550/arxiv.2006.08426openalex-snapshot
A Unifying Perspective on Descent Directions for Constrained Minimization and Switching Criteria
inferred← citeshttps://doi.org/10.48550/arxiv.2008.09781openalex-snapshot
A unifying framework for the analysis of projection-free first-order methods under a sufficient slope condition
inferred← citeshttps://doi.org/10.70675/efd511fczae84z49fdza671zed9f8eaf0bf1openalex-snapshot
Accelerating conditional gradient methods
inferred← citeshttps://doi.org/10.7916/d8ms3sm8openalex-snapshot
Optimization methods for power grid reliability
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.