Cover Image

Generalized Alternating Projections on Manifolds and Convex Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fält, Mattias, Giselsson, Pontus
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extending Douglas-Rachford Splitting for Convex Optimization
by: Nilsson, Max, et al.
Published: (2025)

The Symmetry Coefficient of Positively Homogeneous Functions
by: Nilsson, Max, et al.
Published: (2025)

The Chambolle--Pock method converges weakly with $θ>1/2$ and $τσ\|L\|^2<4/(1+2θ)$
by: Banert, Sebastian, et al.
Published: (2023)

A Lyapunov analysis of Korpelevich's extragradient method with fast and flexible extensions
by: Upadhyaya, Manu, et al.
Published: (2025)

Automated tight Lyapunov analysis for first-order methods
by: Upadhyaya, Manu, et al.
Published: (2023)

Strong Convexity of Sets in Riemannian Manifolds
by: Scieur, Damien, et al.
Published: (2023)

The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods
by: Upadhyaya, Manu, et al.
Published: (2025)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
by: Li, Xinxin, et al.
Published: (2026)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

What are Capra-Convex Sets?
by: Chancelier, Jean-Philippe, et al.
Published: (2025)

Modelling to Generate Continuous Alternatives: Enabling Real-Time Feasible Portfolio Generation in Convex Planning Models
by: Lau, Michael, et al.
Published: (2024)

Splitting the Forward-Backward Algorithm: A Full Characterization
by: Åkerman, Anton, et al.
Published: (2025)

Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets
by: Kuroda, Hiroki, et al.
Published: (2026)

Roundabout Constrained Convex Generators: A Unified Framework for Multiply-Connected Reachable Sets
by: Xie, Peng, et al.
Published: (2025)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
by: Lin, Qihang, et al.
Published: (2020)

Manifold Quadratic Penalty Alternating Minimization for Sparse Principal Component Analysis
by: Adam, Tarmizi
Published: (2024)

Lower Bounds for Frank-Wolfe on Strongly Convex Sets
by: Halbey, Jannis, et al.
Published: (2026)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

A Variable Smoothing for Weakly Convex Composite Minimization with Manifold Constraint via Parametrization
by: Kume, Keita, et al.
Published: (2024)

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems
by: Bui, Hoa T., et al.
Published: (2022)

A Block-Alternating Iterative Approach for a Class of Non-Convex Optimization Problems
by: Li, Anran, et al.
Published: (2026)

Marginal Analysis of Convex Optimization Problems with Set-Valued Inclusion Constraints
by: Uderzo, Amos
Published: (2024)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem
by: Shen, Yuting, et al.
Published: (2025)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
by: Xiao, Nachuan, et al.
Published: (2025)

Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
by: Hildebrand, Robert, et al.
Published: (2024)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

$A^*$ for Graphs of Convex Sets
by: Sundar, Kaarthik, et al.
Published: (2024)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
by: Xu, Meng, et al.
Published: (2024)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
by: Gould, Brendan, et al.
Published: (2026)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
by: Chen, Xiaojun, et al.
Published: (2026)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
by: Xu, Zi, et al.
Published: (2021)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
by: Roberts, Lindon, et al.
Published: (2026)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Riemannian Optimization Framework on the Generalized Quaternionic Stiefel Manifold
by: Sato, Hiroyuki
Published: (2026)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)