Generalized self-concordant analysis of Frank-Wolfe algorithms
From MaRDI portal
Publication:2687046
DOI10.1007/s10107-022-01771-1OpenAlexW3089880967MaRDI QIDQ2687046
Mathias Staudigl, Shimrit Shtern, Kamil Safin, Pavel Dvurechensky
Publication date: 1 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.01009
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items (2)
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ First-order methods for convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-Weighted Discrimination
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Self-concordant barriers for convex approximations of structured convex sets
- Lectures on convex optimization
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- Complexity bounds for primal-dual methods minimizing the model of objective function
- Self-concordant analysis for logistic regression
- The condition number of a function relative to a set
- Finite-sample analysis of \(M\)-estimators using self-concordance
- Generalized self-concordant functions: a recipe for Newton-type methods
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Convergence of the exponentiated gradient method with Armijo line search
- Conditional Gradient Sliding for Convex Optimization
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Self-concordance for empirical likelihood
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion
- Some comments on Wolfe's ‘away step’
- Universal Portfolios
- Universal prediction
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems
- An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
- Regularization and Variable Selection Via the Elastic Net
- Composite Convex Minimization Involving Self-concordant-Like Cost Functions
- Prediction, Learning, and Games
- Composite Self-Concordant Minimization
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Inexact model: a framework for optimization and variational inequalities
- Benchmarking optimization software with performance profiles.
- First-order methods for convex optimization
This page was built for publication: Generalized self-concordant analysis of Frank-Wolfe algorithms
