Cover Image

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barbato, Michele, Ceselli, Alberto, Messana, Rosario
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Computational Geometry Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
by: Messana, Rosario, et al.
Published: (2024)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

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

Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
by: Lew, Thomas, et al.
Published: (2023)

Man, Machine, and Mathematics
by: Dogra, Akshunna S.
Published: (2026)

RACH-Space: Reconstructing Adaptive Convex Hull Space with Applications in Weak Supervision
by: Na, Woojoo, et al.
Published: (2023)

Optimal Regularization Under Uncertainty: Distributional Robustness and Convexity Constraints
by: Leong, Oscar, et al.
Published: (2025)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming
by: Iommazzo, Gabriele, et al.
Published: (2024)

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
by: Liu, Shanqi, et al.
Published: (2024)

A Mathematical Programming Approach to Optimal Classification Forests
by: Blanco, Víctor, et al.
Published: (2022)

Persistence-based topological optimization: a survey
by: Carriere, Mathieu, et al.
Published: (2026)

A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements
by: Blanco, Víctor, et al.
Published: (2025)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
by: Ploussard, Quentin, et al.
Published: (2025)

Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization
by: Cardinal, Jean, et al.
Published: (2025)

Shuffling Momentum Gradient Algorithm for Convex Optimization
by: Tran, Trang H., et al.
Published: (2024)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Learning Algorithm Hyperparameters for Fast Parametric Convex Optimization
by: Sambharya, Rajiv, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Meta-Learning from Learning Curves for Budget-Limited Algorithm Selection
by: Nguyen, Manh Hung, et al.
Published: (2024)

Sum-of-Squares Programming for Ma-Trudinger-Wang Regularity of Optimal Transport Maps
by: Shivakumar, Sachin, et al.
Published: (2024)

Blackwell's Approachability with Approximation Algorithms
by: Garber, Dan, et al.
Published: (2025)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
by: Zhang, Huaqing, et al.
Published: (2024)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
by: Wu, Yuman, et al.
Published: (2026)

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

An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale
by: Javaloy, Adrián, et al.
Published: (2026)

On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization
by: Shumaylov, Zakhar, et al.
Published: (2025)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
by: Mai, Ngoc Hoang Anh, et al.
Published: (2022)

Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport
by: Piening, Moritz, et al.
Published: (2025)

Benchmarking Stochastic Approximation Algorithms for Fairness-Constrained Training of Deep Neural Networks
by: Kliachkin, Andrii, et al.
Published: (2025)

Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time
by: Kim, Sungyoon, et al.
Published: (2024)

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
by: Yang, Linxin, et al.
Published: (2024)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

On Efficient Approximation of the Maximum Distance to A Point Over an Intersection of Balls
by: Costandin, Beniamin, et al.
Published: (2024)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

Disciplined Geodesically Convex Programming
by: Cheng, Andrew, et al.
Published: (2024)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
by: Hu, Quanqi, et al.
Published: (2024)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization
by: Condat, Laurent, et al.
Published: (2025)