On the Frank-Wolfe algorithm for non-compact constrained optimization problems
From MaRDI portal
Abstract: This paper is concerned with the Frank--Wolfe algorithm for a special class of {it non-compact} constrained optimization problems. The notion of asymptotic cone is used to introduce this class of problems as well as to establish that the algorithm is well defined. These problems, with closed and convex constraint set, are characterized by two conditions on the gradient of the objective function. The first establishes that the gradient of the objective function is Lipschitz continuous, which is quite usual in the analysis of this algorithm. The second, which is new in this subject, establishes that the gradient belongs to the interior of the dual asymptotic cone of the constraint set. Classical results on the asymptotic behavior and iteration-complexity bounds for the sequence generated by the Frank--Wolfe algorithm are extended to this new class of problems. Examples of problems with non-compact constraints and objective functions satisfying the aforementioned conditions are also provided.
Recommendations
- A modified Frank-Wolfe algorithm and its convergence properties
- Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Frank-Wolfe algorithm from optimization to equilibrium problems
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
Cites work
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- An extended Frank-Wolfe method with ``in-face directions, and its application to low-rank matrix completion
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Conditional gradient sliding for convex optimization
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- First-order methods in optimization
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3345848 (Why is no real title available?)
- Simplified versions of the conditional gradient method
- The alternating descent conditional gradient method for sparse inverse problems
Cited in
(16)- Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- A modified Frank-Wolfe algorithm and its convergence properties
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
- scientific article; zbMATH DE number 5812275 (Why is no real title available?)
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
- Frank-Wolfe algorithm from optimization to equilibrium problems
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- The Frank-Wolfe algorithm: a short introduction
- Self-adaptive algorithms for quasiconvex programming and applications to machine learning
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
- On the convergence of conditional gradient method for unbounded multiobjective optimization problems
This page was built for publication: On the Frank-Wolfe algorithm for non-compact constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034936)
