Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Van Dessel, Guillaume, Glineur, François
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
par: Van Dessel, Guillaume, et autres
Publié: (2025)

Global minimization of a minimum of a finite collection of functions
par: Van Dessel, Guillaume, et autres
Publié: (2024)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
par: Vernimmen, Pierre, et autres
Publié: (2025)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
par: Vernimmen, Pierre, et autres
Publié: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
par: Rotaru, Teodor, et autres
Publié: (2024)

Exact Convergence rate of the subgradient method by using Polyak step size
par: Zamani, Moslem, et autres
Publié: (2024)

Dual first-order methods for efficient computation of convex hull prices
par: Tanji, Sofiane, et autres
Publié: (2025)

Presolving for GPU-Accelerated First-Order LP Solvers
par: Cederberg, Daniel, et autres
Publié: (2026)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
par: Rotaru, Teodor, et autres
Publié: (2025)

Proximal gradient methods with inexact oracle of degree q for composite optimization
par: Nabou, Yassine, et autres
Publié: (2024)

Improved convergence rates for the Difference-of-Convex algorithm
par: Rotaru, Teodor, et autres
Publié: (2024)

Presolving Convexified Optimal Power Flow with Mixtures of Gradient Experts
par: Bose, Shourya, et autres
Publié: (2023)

On the Set of Possible Minimizers of a Sum of Convex Functions
par: Zamani, Moslem, et autres
Publié: (2024)

Solving contextual chance-constrained programming under decision-dependent uncertainty
par: Liu, Xiangting, et autres
Publié: (2026)

Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
par: Hoen, Alexander, et autres
Publié: (2024)

On the supporting quasi-hyperplane and separation theorem of geodesic convex sets with applications on Riemannian manifolds
par: Zhou, Li-wen, et autres
Publié: (2024)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
par: Rotaru, Teodor, et autres
Publié: (2025)

PaPILO: A Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support
par: Gleixner, Ambros, et autres
Publié: (2022)

A characteristic function framework for chance constraint programming in stochastic model predictive control
par: Ying, Yuwei, et autres
Publié: (2026)

Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
par: Bousselmi, Nizar, et autres
Publié: (2024)

Convexity of chance constraints for elliptical and skewed distributions with copula structures dependent on decision variables
par: Zhang, Heng, et autres
Publié: (2025)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
par: Leplat, Valentin, et autres
Publié: (2021)

Globalized distributionally robust chance-constrained support vector machine based on core sets
par: Li, Yueyao, et autres
Publié: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
par: Lv, Wei, et autres
Publié: (2024)

Numerical Design of Optimized First-Order Algorithms
par: Kamri, Yassine, et autres
Publié: (2025)

On the Convex Interpolation for Linear Operators
par: Bousselmi, Nizar, et autres
Publié: (2025)

Snacks: a fast large-scale kernel SVM solver
par: Tanji, Sofiane, et autres
Publié: (2023)

On quasi-convex smooth optimization problems by a comparison oracle
par: Gasnikov, A. V., et autres
Publié: (2024)

A feedback control approach to convex optimization with inequality constraints
par: Cerone, V., et autres
Publié: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
par: Nedich, Angelia, et autres
Publié: (2019)

Convergence rates of regularized quasi-Newton methods without strong convexity
par: Wang, Shida, et autres
Publié: (2025)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
par: Kamri, Yassine, et autres
Publié: (2025)

Weak optimal transport with moment constraints: constraint qualification, dual attainment and entropic regularization
par: Carlier, Guillaume, et autres
Publié: (2025)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
par: Lu, Zhaosong, et autres
Publié: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
par: Kılınç-Karzan, Fatma, et autres
Publié: (2024)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
par: Singh, Nitesh Kumar, et autres
Publié: (2024)

Robustness certificates in data-driven non-convex optimization with additively-uncertain constraints
par: Gallo, Alexander J, et autres
Publié: (2026)

Robust approximation of chance constrained optimization with polynomial perturbation
par: Rao, Bo, et autres
Publié: (2022)

Regularity in shape optimization under convexity constraint
par: Lamboley, Jimmy, et autres
Publié: (2022)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
par: Hermant, Julien, et autres
Publié: (2024)