Image de couverture de livre

Finite Convergence of Circumcentered-Reflection Method on Closed Polyhedral Cones in Euclidean Spaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Liao, Hongzhi
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallelizing the Circumcentered-Reflection Method
par: Barros, Pablo, et autres
Publié: (2025)

Deep Centralization for the Circumcentered Reflection Method
par: Barros, Pablo
Publié: (2025)

Monotonicity and Contraction on Polyhedral Cones
par: Jafarpour, Saber, et autres
Publié: (2022)

Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
par: Klamroth, Kathrin, et autres
Publié: (2026)

Polyhedral Control Design: Theory and Methods
par: Houska, Boris, et autres
Publié: (2024)

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
par: Pichugin, Alexander, et autres
Publié: (2024)

On Covering Euclidean Space with Q-arrangements of Cones
par: Ghorbal, Khalil, et autres
Publié: (2022)

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
par: Cui, Zilong, et autres
Publié: (2025)

On the Convergence and Complexity of the Stochastic Central Finite-Difference Based Gradient Estimation Methods
par: Bollapragada, Raghu, et autres
Publié: (2025)

Modified Polyhedral Method for Elicitation of Shape-Free Utility and Conservatism Reduction in Robust Optimization
par: Zhang, Sainan, et autres
Publié: (2025)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
par: Liao, Feng-Yi, et autres
Publié: (2024)

Network Consensus in the Wasserstein Space of Probability Measures Defined on Multi-Dimensional Euclidean Spaces
par: Jung, Pilgyu, et autres
Publié: (2025)

Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry
par: Solodkin, Vladimir, et autres
Publié: (2024)

Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
par: Liu, Peijing, et autres
Publié: (2024)

Polyhedral results for two classes of submodular sets with GUB constraints
par: Qian, Weikang, et autres
Publié: (2026)

Control Lyapunov Function Design via Configuration-Constrained Polyhedral Computing
par: Houska, Boris, et autres
Publié: (2025)

Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
par: De Loera, Jesús A., et autres
Publié: (2024)

MUSIC: Accelerated Convergence for Distributed Optimization With Inexact and Exact Methods
par: Wu, Mou, et autres
Publié: (2024)

Convexification of a Separable Function over a Polyhedral Ground Set
par: Dey, Santanu S., et autres
Publié: (2025)

On the Convergence of the Accelerated Riccati Iteration Method
par: Rajasingam, Prasanthan, et autres
Publié: (2017)

The Generalized Multiplicative Gradient Method for A Class of Convex Optimization Problems Over Symmetric Cones
par: Zhao, Renbo
Publié: (2022)

A Polyhedral Study on Unit Commitment with a Single Type of Binary Variables
par: Tian, Bin, et autres
Publié: (2026)

Reachability Analysis of Nonlinear Discrete-Time Systems Using Polyhedral Relaxations and Constrained Zonotopes
par: Rego, Brenner S., et autres
Publié: (2025)

Convergence of the Iterates of the Stochastic Proximal Gradient Method
par: Madariaga, Javier I.
Publié: (2026)

Full Convergence of Regularized Methods for Unconstrained Optimization
par: Cristofari, Andrea
Publié: (2025)

Subtransversality and Strong CHIP of Closed Sets in Asplund Spaces
par: Wei, Zhou, et autres
Publié: (2023)

A Bundle-based Augmented Lagrangian Framework: Algorithm, Convergence, and Primal-dual Principles
par: Liao, Feng-Yi, et autres
Publié: (2025)

On Integral Linear Constraints on Convex Cones
par: Vladu, Emil, et autres
Publié: (2026)

Sparse Cuts for the Positive Semidefinite Cone
par: Günlük, Oktay, et autres
Publié: (2026)

Multilevel Regularized Newton Methods with Fast Convergence Rates
par: Tsipinakis, Nick, et autres
Publié: (2024)

OPTAMI: Global Superlinear Convergence of High-order Methods
par: Kamzolov, Dmitry, et autres
Publié: (2024)

Anderson Acceleration for Linearly Converging SQP-Type Methods
par: Frey, Jonathan, et autres
Publié: (2026)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
par: Roberts, Lindon, et autres
Publié: (2026)

On the Rate of Convergence of Iterative Methods for Nonexpansive Mappings in CAT(0) Spaces and Hyperbolic Optimization
par: Foglia, Katherine Rossella, et autres
Publié: (2025)

Stability and Performance Analysis on Self-dual Cones
par: Vladu, Emil
Publié: (2024)

Learning in Herding Mean Field Games: Single-Loop Algorithm with Finite-Time Convergence Analysis
par: Zeng, Sihan, et autres
Publié: (2024)

$\mathcal{V}$-Polyhedral Disjunctive Cuts
par: Balas, Egon, et autres
Publié: (2022)

Improved Convergence for Decentralized Stochastic Optimization with Biased Gradients
par: Xu, Qing, et autres
Publié: (2026)

Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers
par: Unser, Michael, et autres
Publié: (2025)

Convergence Rates of Online Critic Value Function Approximation in Native Spaces
par: Niu, Shengyuan, et autres
Publié: (2024)