Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
From MaRDI portal
Publication:4188351
DOI10.1137/0317015zbMath0403.49028OpenAlexW2097970385MaRDI QIDQ4188351
No author found.
Publication date: 1979
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0317015
Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Controllability (93B05)
Related Items (28)
A Relaxed Picard Iteration Process for Set-Valued Operators of the Monotone Type ⋮ A generalized conditional gradient method and its connection to an iterative shrinkage method ⋮ Convergence of algorithms for perturbed optimization problems ⋮ On finite convergence of iterative methods for variational inequalities in Hilbert spaces ⋮ Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ Gradient methods on strongly convex feasible sets and optimal control of affine systems ⋮ A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization ⋮ Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ First-order methods for convex optimization ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual ⋮ Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions ⋮ New analysis and results for the Frank-Wolfe method ⋮ Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees ⋮ Generalized Conditional Gradient for Sparse Estimation ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ The effect of perturbations on the convergence rates of optimization algorithms ⋮ A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems ⋮ Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs ⋮ A class of superlinearly convergent projection algorithms with relaxed stepsizes ⋮ Convergent stepsizes for constrained optimization algorithms ⋮ Sublinear convergence of the chord method at singular points ⋮ Rates of convergence for adaptive Newton methods ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities
This page was built for publication: Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals