:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Dizon, N. D., Huang, Q. Y., Chuong, T. D., Li, G., Jeyakumar, V.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2602.20660
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
by: Dizon, Neil D., et al.
Published: (2026)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
by: Gribling, Sander, et al.
Published: (2025)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

Variational Analysis in the Wasserstein Hierarchy
by: Vauthier, Christophe
Published: (2025)

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls
by: Byeon, Geunyeong, et al.
Published: (2022)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Harmonic Hierarchies for Polynomial Optimization
by: Cristancho, Sergio, et al.
Published: (2022)

Sum-of-Squares Hierarchy for the Gromov Wasserstein Problem
by: Tran, Hoang Anh, et al.
Published: (2025)

Convergence of SGD for Training Neural Networks with Sliced Wasserstein Losses
by: Tanguy, Eloi
Published: (2023)

Squared polynomial approximation kernels for the hypercube: improved error bounds and implications for Lasserre hierarchies
by: Gribling, Sander, et al.
Published: (2026)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
by: Laurent, Monique, et al.
Published: (2024)

Differential estimates for fast first-order multilevel nonconvex optimisation
by: Dizon, Neil, et al.
Published: (2024)

Moment Sum-of-Squares Hierarchy for Gromov Wasserstein: Continuous Extensions and Sample Complexity
by: Tran, Hoang Anh, et al.
Published: (2025)

A Parameter-Free Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals
by: Wang, Qi, et al.
Published: (2025)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)

Distributionally and Adversarially Robust Logistic Regression via Intersecting Wasserstein Balls
by: Selvi, Aras, et al.
Published: (2024)

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
by: Huang, Yufan, et al.
Published: (2024)

Contextual Optimization under Covariate Shift: A Robust Approach by Intersecting Wasserstein Balls
by: Wang, Tianyu, et al.
Published: (2024)

Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns
by: N, Nefedov V.
Published: (2026)

Flowing Datasets with Wasserstein over Wasserstein Gradient Flows
by: Bonet, Clément, et al.
Published: (2025)

Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
by: Wei, Jingrong, et al.
Published: (2024)

Properties of Discrete Sliced Wasserstein Losses
by: Tanguy, Eloi, et al.
Published: (2023)

Fundamental Convergence Analysis of Sharpness-Aware Minimization
by: Khanh, Pham Duy, et al.
Published: (2024)

Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks
by: Robin, David A. R., et al.
Published: (2025)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
by: Pan, Rui, et al.
Published: (2023)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
by: Liu, Zijian
Published: (2026)

On Piecewise Quadratic Terminal Costs for MPC
by: Mulagaleti, Sampath Kumar, et al.
Published: (2026)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
by: Zhu, Shuailong, et al.
Published: (2025)

Offline Learning of Decision Functions in Multiplayer Games with Expectation Constraints
by: Huang, Yuanhanqing, et al.
Published: (2024)

Piecewise Polynomial Regression of Tame Functions via Integer Programming
by: Bareilles, Gilles, et al.
Published: (2023)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
by: Gruntkowska, Kaja, et al.
Published: (2025)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
by: Sinjorgo, Lennart, et al.
Published: (2025)

A Unified Framework for Rank-based Loss Minimization
by: Xiao, Rufeng, et al.
Published: (2023)

Prediction techniques for dynamic imaging with online primal-dual methods
by: Dizon, Neil, et al.
Published: (2024)

Online optimisation for dynamic electrical impedance tomography
by: Dizon, Neil, et al.
Published: (2024)

A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
by: Liang, Ling, et al.
Published: (2026)

Stochastic Approximation for Expectation Objective and Expectation Inequality-Constrained Nonconvex Optimization
by: Facchinei, Francisco, et al.
Published: (2023)

Piecewise regression via mixed-integer programming for MPC
by: Teichrib, Dieter, et al.
Published: (2024)

On the hardness of deciding the finite convergence of Lasserre hierarchies
by: Vargas, Luis Felipe
Published: (2024)