Alternating conditional gradient method for convex feasibility problems

DOI10.1007/s10589-021-00293-4zbMath1472.65068arXiv1912.04247OpenAlexW3176403052MaRDI QIDQ2044579

L. F. Prudente, R. Díaz Millán, Orizon P. Ferreira

Publication date: 9 August 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convex feasibility problemconditional gradient methodalternating projection methodinexact projections

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (2)

Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ On the inexact scaled gradient projection method

Uses Software

• ALGENCAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Newton conditional gradient method for constrained nonlinear systems
• Local linear convergence for alternating and averaged nonconvex projections
• A successive projection method
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• A conditional gradient method with linear rate of convergence for solving convex linear systems
• Local linear convergence for inexact alternating projections on nonconvex sets
• Hard-constrained inconsistent signal feasibility problems
• Conditional Gradient Sliding for Convex Optimization
• Proximity Maps for Convex Sets
• Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
• Projection methods: an annotated bibliography of books and reviews
• A relaxed projection method for variational inequalities
• Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• The Matching Polytope has Exponential Extension Complexity
• Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
• On Projection Algorithms for Solving Convex Feasibility Problems
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
• Practical Augmented Lagrangian Methods for Constrained Optimization
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Functional Operators (AM-22), Volume 2
• Convex analysis and monotone operator theory in Hilbert spaces
• New analysis and results for the Frank-Wolfe method

This page was built for publication: Alternating conditional gradient method for convex feasibility problems