Cover Image

Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Van Dessel, Guillaume, Glineur, François
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)

Global minimization of a minimum of a finite collection of functions
by: Van Dessel, Guillaume, et al.
Published: (2024)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
by: Vernimmen, Pierre, et al.
Published: (2025)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
by: Vernimmen, Pierre, et al.
Published: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)

Presolving for GPU-Accelerated First-Order LP Solvers
by: Cederberg, Daniel, et al.
Published: (2026)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

Presolving Convexified Optimal Power Flow with Mixtures of Gradient Experts
by: Bose, Shourya, et al.
Published: (2023)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

Solving contextual chance-constrained programming under decision-dependent uncertainty
by: Liu, Xiangting, et al.
Published: (2026)

Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
by: Hoen, Alexander, et al.
Published: (2024)

On the supporting quasi-hyperplane and separation theorem of geodesic convex sets with applications on Riemannian manifolds
by: Zhou, Li-wen, et al.
Published: (2024)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)

PaPILO: A Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support
by: Gleixner, Ambros, et al.
Published: (2022)

A characteristic function framework for chance constraint programming in stochastic model predictive control
by: Ying, Yuwei, et al.
Published: (2026)

Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
by: Bousselmi, Nizar, et al.
Published: (2024)

Convexity of chance constraints for elliptical and skewed distributions with copula structures dependent on decision variables
by: Zhang, Heng, et al.
Published: (2025)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
by: Leplat, Valentin, et al.
Published: (2021)

Globalized distributionally robust chance-constrained support vector machine based on core sets
by: Li, Yueyao, et al.
Published: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)

Numerical Design of Optimized First-Order Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

On the Convex Interpolation for Linear Operators
by: Bousselmi, Nizar, et al.
Published: (2025)

Snacks: a fast large-scale kernel SVM solver
by: Tanji, Sofiane, et al.
Published: (2023)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

A feedback control approach to convex optimization with inequality constraints
by: Cerone, V., et al.
Published: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

Convergence rates of regularized quasi-Newton methods without strong convexity
by: Wang, Shida, et al.
Published: (2025)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

Weak optimal transport with moment constraints: constraint qualification, dual attainment and entropic regularization
by: Carlier, Guillaume, et al.
Published: (2025)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Robustness certificates in data-driven non-convex optimization with additively-uncertain constraints
by: Gallo, Alexander J, et al.
Published: (2026)

Robust approximation of chance constrained optimization with polynomial perturbation
by: Rao, Bo, et al.
Published: (2022)

Regularity in shape optimization under convexity constraint
by: Lamboley, Jimmy, et al.
Published: (2022)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
by: Hermant, Julien, et al.
Published: (2024)