Alternating conditional gradient method for convex feasibility problems
From MaRDI portal
Abstract: The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the other set is compact such that the conditional gradient (CondG) method can be used for computing efficiently an inexact projection on it. Second, we assume that both sets involved are compact such that the CondG method can be used for computing efficiently inexact projections on them. We combine alternating projection method with CondG method to design a new method, which can be seen as an inexact feasible version of alternate projection method. The proposed method generates two different sequences belonging to each involved set, which converge to a point in the intersection of them whenever it is not empty. If the intersection is empty, then the sequences converge to points in the respective sets whose distance is equal to the distance between the sets in consideration.
Recommendations
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Alternating proximal gradient method for convex minimization
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional extragradient algorithms for solving variational inequalities
- An extension of the conditional gradient method to a class of nonconvex optimization problems
- Alternating minimization methods for strongly convex optimization
- A variable-penalty alternating directions method for convex optimization
- scientific article; zbMATH DE number 2210665
- Optimally linearizing the alternating direction method of multipliers for convex programming
- A modified alternating direction method for convex minimization problems
Cites work
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A Newton conditional gradient method for constrained nonlinear systems
- A relaxed projection method for variational inequalities
- A successive projection method
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Conditional gradient sliding for convex optimization
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Convex analysis and monotone operator theory in Hilbert spaces
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Dykstra's alternating projection algorithm for two sets
- Functional Operators (AM-22), Volume 2
- Hard-constrained inconsistent signal feasibility problems
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
- Local linear convergence for alternating and averaged nonconvex projections
- Local linear convergence for inexact alternating projections on nonconvex sets
- New analysis and results for the Frank-Wolfe method
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Practical augmented Lagrangian methods for constrained optimization
- Projection methods: an annotated bibliography of books and reviews
- Proximity Maps for Convex Sets
- Quasi-Fejérian analysis of some optimization algorithms
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
Cited in
(9)- Some convergence strategies for the alternating generalized projection method
- On the inexact scaled gradient projection method
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
- Extragradient method with feasible inexact projection to variational inequality problem
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
- Splitting the conditional gradient algorithm
- Self-adaptive inexact projection algorithms and applications to Cnc-Lasso image restoration models
- An inexact alternating projection method with application to matrix completion
This page was built for publication: Alternating conditional gradient method for convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044579)
