An extension of the frank and Wolfe method of feasible directions
From MaRDI portal
Publication:4770213
DOI10.1007/BF01580219zbMath0283.90042MaRDI QIDQ4770213
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items (28)
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network ⋮ A modified Frank-Wolfe algorithm and its convergence properties ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ A combinatorial approximation algorithm for supply chain network flow problem ⋮ A smooth penalty function algorithm for network-structured problems ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ First-order methods for convex optimization ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm ⋮ Analysis of relaxations for the multi-item capacitated lot-sizing problem ⋮ Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints ⋮ Conditional gradient algorithms for norm-regularized smooth convex optimization ⋮ Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Simplicial decomposition in nonlinear programming algorithms ⋮ A decomposition algorithm for quadratic programming ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ An augmented Lagrangian decomposition method for block diagonal linear programming problems ⋮ Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods ⋮ Generalized Conditional Gradient for Sparse Estimation ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ Finiteness in restricted simplicial decomposition
Cites Work
This page was built for publication: An extension of the frank and Wolfe method of feasible directions
