The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems

zbMath1398.90171arXiv1701.02874MaRDI QIDQ5376287

No author found.

Publication date: 17 September 2018

Full work available at URL: https://arxiv.org/abs/1701.02874

zbMATH Keywords

optimization problemconditional gradient methodthreshold controlpairwise variationpolyhedral feasible set

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ On a variational problem for a model of a Stieltjes string with a backlash at the end ⋮ Gradient methods with regularization for constrained optimization problems and their complexity estimates ⋮ Simplified versions of the conditional gradient method ⋮ Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization