:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dizon, N. D., Huang, Q. Y., Chuong, T. D., Li, G., Jeyakumar, V.
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control
Accès en ligne:	https://arxiv.org/abs/2602.20660
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
par: Roberson, David E., et autres
Publié: (2023)

Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
par: Gribling, Sander, et autres
Publié: (2025)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
par: Huang, Queenie Yingkun, et autres
Publié: (2024)

Variational Analysis in the Wasserstein Hierarchy
par: Vauthier, Christophe
Publié: (2025)

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls
par: Byeon, Geunyeong, et autres
Publié: (2022)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
par: Hua, Zheng, et autres
Publié: (2021)

Harmonic Hierarchies for Polynomial Optimization
par: Cristancho, Sergio, et autres
Publié: (2022)

Sum-of-Squares Hierarchy for the Gromov Wasserstein Problem
par: Tran, Hoang Anh, et autres
Publié: (2025)

Convergence of SGD for Training Neural Networks with Sliced Wasserstein Losses
par: Tanguy, Eloi
Publié: (2023)

Squared polynomial approximation kernels for the hypercube: improved error bounds and implications for Lasserre hierarchies
par: Gribling, Sander, et autres
Publié: (2026)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
par: Laurent, Monique, et autres
Publié: (2024)

Differential estimates for fast first-order multilevel nonconvex optimisation
par: Dizon, Neil, et autres
Publié: (2024)

Moment Sum-of-Squares Hierarchy for Gromov Wasserstein: Continuous Extensions and Sample Complexity
par: Tran, Hoang Anh, et autres
Publié: (2025)

A Parameter-Free Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals
par: Wang, Qi, et autres
Publié: (2025)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
par: Kharitenko, Andrey, et autres
Publié: (2025)

Distributionally and Adversarially Robust Logistic Regression via Intersecting Wasserstein Balls
par: Selvi, Aras, et autres
Publié: (2024)

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
par: Huang, Yufan, et autres
Publié: (2024)

Contextual Optimization under Covariate Shift: A Robust Approach by Intersecting Wasserstein Balls
par: Wang, Tianyu, et autres
Publié: (2024)

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

Flowing Datasets with Wasserstein over Wasserstein Gradient Flows
par: Bonet, Clément, et autres
Publié: (2025)

Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
par: Wei, Jingrong, et autres
Publié: (2024)

Properties of Discrete Sliced Wasserstein Losses
par: Tanguy, Eloi, et autres
Publié: (2023)

Fundamental Convergence Analysis of Sharpness-Aware Minimization
par: Khanh, Pham Duy, et autres
Publié: (2024)

Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks
par: Robin, David A. R., et autres
Publié: (2025)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
par: Pan, Rui, et autres
Publié: (2023)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
par: Liu, Zijian
Publié: (2026)

On Piecewise Quadratic Terminal Costs for MPC
par: Mulagaleti, Sampath Kumar, et autres
Publié: (2026)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
par: Zhu, Shuailong, et autres
Publié: (2025)

Offline Learning of Decision Functions in Multiplayer Games with Expectation Constraints
par: Huang, Yuanhanqing, et autres
Publié: (2024)

Piecewise Polynomial Regression of Tame Functions via Integer Programming
par: Bareilles, Gilles, et autres
Publié: (2023)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
par: Gruntkowska, Kaja, et autres
Publié: (2025)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
par: Sinjorgo, Lennart, et autres
Publié: (2025)

A Unified Framework for Rank-based Loss Minimization
par: Xiao, Rufeng, et autres
Publié: (2023)

Prediction techniques for dynamic imaging with online primal-dual methods
par: Dizon, Neil, et autres
Publié: (2024)

Online optimisation for dynamic electrical impedance tomography
par: Dizon, Neil, et autres
Publié: (2024)

A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
par: Liang, Ling, et autres
Publié: (2026)

Stochastic Approximation for Expectation Objective and Expectation Inequality-Constrained Nonconvex Optimization
par: Facchinei, Francisco, et autres
Publié: (2023)

Piecewise regression via mixed-integer programming for MPC
par: Teichrib, Dieter, et autres
Publié: (2024)

On the hardness of deciding the finite convergence of Lasserre hierarchies
par: Vargas, Luis Felipe
Publié: (2024)