Saved in:
| Main Author: | Liao, Hongzhi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.00512 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)
by: Barros, Pablo, et al.
Published: (2025)
Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)
by: Barros, Pablo
Published: (2025)
Monotonicity and Contraction on Polyhedral Cones
by: Jafarpour, Saber, et al.
Published: (2022)
by: Jafarpour, Saber, et al.
Published: (2022)
Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
by: Klamroth, Kathrin, et al.
Published: (2026)
by: Klamroth, Kathrin, et al.
Published: (2026)
Polyhedral Control Design: Theory and Methods
by: Houska, Boris, et al.
Published: (2024)
by: Houska, Boris, et al.
Published: (2024)
On Covering Euclidean Space with Q-arrangements of Cones
by: Ghorbal, Khalil, et al.
Published: (2022)
by: Ghorbal, Khalil, et al.
Published: (2022)
Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
by: Pichugin, Alexander, et al.
Published: (2024)
by: Pichugin, Alexander, et al.
Published: (2024)
Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
by: Cui, Zilong, et al.
Published: (2025)
by: Cui, Zilong, et al.
Published: (2025)
On the Convergence and Complexity of the Stochastic Central Finite-Difference Based Gradient Estimation Methods
by: Bollapragada, Raghu, et al.
Published: (2025)
by: Bollapragada, Raghu, et al.
Published: (2025)
Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
by: Liao, Feng-Yi, et al.
Published: (2024)
by: Liao, Feng-Yi, et al.
Published: (2024)
Modified Polyhedral Method for Elicitation of Shape-Free Utility and Conservatism Reduction in Robust Optimization
by: Zhang, Sainan, et al.
Published: (2025)
by: Zhang, Sainan, et al.
Published: (2025)
Network Consensus in the Wasserstein Space of Probability Measures Defined on Multi-Dimensional Euclidean Spaces
by: Jung, Pilgyu, et al.
Published: (2025)
by: Jung, Pilgyu, et al.
Published: (2025)
Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry
by: Solodkin, Vladimir, et al.
Published: (2024)
by: Solodkin, Vladimir, et al.
Published: (2024)
MUSIC: Accelerated Convergence for Distributed Optimization With Inexact and Exact Methods
by: Wu, Mou, et al.
Published: (2024)
by: Wu, Mou, et al.
Published: (2024)
Control Lyapunov Function Design via Configuration-Constrained Polyhedral Computing
by: Houska, Boris, et al.
Published: (2025)
by: Houska, Boris, et al.
Published: (2025)
Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
by: Liu, Peijing, et al.
Published: (2024)
by: Liu, Peijing, et al.
Published: (2024)
Polyhedral results for two classes of submodular sets with GUB constraints
by: Qian, Weikang, et al.
Published: (2026)
by: Qian, Weikang, et al.
Published: (2026)
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
by: De Loera, Jesús A., et al.
Published: (2024)
by: De Loera, Jesús A., et al.
Published: (2024)
Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)
by: Dey, Santanu S., et al.
Published: (2025)
Reachability Analysis of Nonlinear Discrete-Time Systems Using Polyhedral Relaxations and Constrained Zonotopes
by: Rego, Brenner S., et al.
Published: (2025)
by: Rego, Brenner S., et al.
Published: (2025)
On the Convergence of the Accelerated Riccati Iteration Method
by: Rajasingam, Prasanthan, et al.
Published: (2017)
by: Rajasingam, Prasanthan, et al.
Published: (2017)
A Bundle-based Augmented Lagrangian Framework: Algorithm, Convergence, and Primal-dual Principles
by: Liao, Feng-Yi, et al.
Published: (2025)
by: Liao, Feng-Yi, et al.
Published: (2025)
The Generalized Multiplicative Gradient Method for A Class of Convex Optimization Problems Over Symmetric Cones
by: Zhao, Renbo
Published: (2022)
by: Zhao, Renbo
Published: (2022)
A Polyhedral Study on Unit Commitment with a Single Type of Binary Variables
by: Tian, Bin, et al.
Published: (2026)
by: Tian, Bin, et al.
Published: (2026)
$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)
by: Balas, Egon, et al.
Published: (2022)
Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
by: Song, Zhao, et al.
Published: (2025)
by: Song, Zhao, et al.
Published: (2025)
Stability and Performance Analysis on Self-dual Cones
by: Vladu, Emil
Published: (2024)
by: Vladu, Emil
Published: (2024)
Convergence of the Iterates of the Stochastic Proximal Gradient Method
by: Madariaga, Javier I.
Published: (2026)
by: Madariaga, Javier I.
Published: (2026)
Full Convergence of Regularized Methods for Unconstrained Optimization
by: Cristofari, Andrea
Published: (2025)
by: Cristofari, Andrea
Published: (2025)
Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers
by: Unser, Michael, et al.
Published: (2025)
by: Unser, Michael, et al.
Published: (2025)
On Integral Linear Constraints on Convex Cones
by: Vladu, Emil, et al.
Published: (2026)
by: Vladu, Emil, et al.
Published: (2026)
Sparse Cuts for the Positive Semidefinite Cone
by: Günlük, Oktay, et al.
Published: (2026)
by: Günlük, Oktay, et al.
Published: (2026)
On the Rate of Convergence of Iterative Methods for Nonexpansive Mappings in CAT(0) Spaces and Hyperbolic Optimization
by: Foglia, Katherine Rossella, et al.
Published: (2025)
by: Foglia, Katherine Rossella, et al.
Published: (2025)
Subtransversality and Strong CHIP of Closed Sets in Asplund Spaces
by: Wei, Zhou, et al.
Published: (2023)
by: Wei, Zhou, et al.
Published: (2023)
Improved Convergence for Decentralized Stochastic Optimization with Biased Gradients
by: Xu, Qing, et al.
Published: (2026)
by: Xu, Qing, et al.
Published: (2026)
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
by: Roberts, Lindon, et al.
Published: (2026)
by: Roberts, Lindon, et al.
Published: (2026)
Multilevel Regularized Newton Methods with Fast Convergence Rates
by: Tsipinakis, Nick, et al.
Published: (2024)
by: Tsipinakis, Nick, et al.
Published: (2024)
OPTAMI: Global Superlinear Convergence of High-order Methods
by: Kamzolov, Dmitry, et al.
Published: (2024)
by: Kamzolov, Dmitry, et al.
Published: (2024)
Anderson Acceleration for Linearly Converging SQP-Type Methods
by: Frey, Jonathan, et al.
Published: (2026)
by: Frey, Jonathan, et al.
Published: (2026)
Near Optimal Approximations and Finite Memory Policies for POMPDs with Continuous Spaces
by: Kara, Ali Devran, et al.
Published: (2024)
by: Kara, Ali Devran, et al.
Published: (2024)
Similar Items
-
Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025) -
Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025) -
Monotonicity and Contraction on Polyhedral Cones
by: Jafarpour, Saber, et al.
Published: (2022) -
Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
by: Klamroth, Kathrin, et al.
Published: (2026) -
Polyhedral Control Design: Theory and Methods
by: Houska, Boris, et al.
Published: (2024)