scispace - formally typeset
Journal ArticleDOI

Some comments of Wolfe's `away step'

J Guélat, +1 more
- 01 May 1986 - 
- Vol. 35, Iss: 1, pp 110-119
TLDR
It is given a detailed proof, under slightly weaker conditions on the objective function, that a modified Frank-Wolfe algorithm based on Wolfe's ‘away step’ strategy can achieve geometric convergence, provided a strict complementarity assumption holds.
Abstract
We give a detailed proof, under slightly weaker conditions on the objective function, that a modified Frank-Wolfe algorithm based on Wolfe's ‘away step’ strategy can achieve geometric convergence, provided a strict complementarity assumption holds.

read more

Citations
More filters
Posted Content

A Scalable Frank-Wolfe based Augmented Lagrangian Method for Linearly Constrained Composite Convex Programming

TL;DR: The proposed FW-AL method is well suitable for solving large-scale problems, because its computational cost per step scales (essentially) linearly with the size of the input.

Nonparametric Estimation of Choice Models

TL;DR: The choice-based demand model as discussed by the authors assumes that the demand observed for a product is independent of the availability or characteristics, such as price, of other products, and ignores any cross-product cannibalization effects.

Convex mixed-integer optimization with Frank-Wolfe methods

TL;DR: In this article , a branch-and-bound algorithm with convex node relaxations is proposed to solve mixed-integer nonlinear optimization problems with a convex hull of feasible points.
Journal ArticleDOI

First-order methods for the convex hull membership problem

TL;DR: In this article , the authors present a comparison of first-order methods for convex hull membership, namely, Frank-Wolfe type methods, Projected Gradient methods and a recently introduced geometric algorithm, called Triangle Algorithm (TA).