Cover Image

Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Papageorgiou, Dimitri J., Trespalacios, Francisco
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

On disjunction convex hulls by lifting
by: Qu, Yushan, et al.
Published: (2024)

Data-Driven Distributionally Robust Optimization for Long-Term Contract vs. Spot Allocation Decisions: Application to Electricity Markets
by: Papageorgiou, Dimitri J.
Published: (2025)

Computing normalized Nash equilibria for generalized Nash games with nonconvex players
by: Harwood, Stuart M., et al.
Published: (2025)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
by: Wang, Boran
Published: (2024)

Data-driven MPC with stability guarantees using extended dynamic mode decomposition
by: Bold, Lea, et al.
Published: (2023)

Semi-definite programs for online control of nonlinear systems with stability guarantees
by: Dai, Xiaoyan
Published: (2026)

Solving mathematical programs with complementarity constraints by disjunctive regularizations
by: Lämmel, Sebastian, et al.
Published: (2026)

Compressed Traffic Assignment with the Augmented Lagrangian Method
by: Xuesong, et al.
Published: (2026)

P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints
by: Kronqvist, Jan, et al.
Published: (2022)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

An Error Bound for Aggregation in Approximate Dynamic Programming
by: Li, Yuchao, et al.
Published: (2025)

Learning a convex cost-to-go for single step model predictive control
by: Turan, E. M., et al.
Published: (2023)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

On the integrality gap of convex mixed-integer programs
by: Kocuk, Burak, et al.
Published: (2024)

On semidefinite descriptions for convex hulls of quadratic programs
by: Wang, Alex L., et al.
Published: (2024)

A distributed augmented Lagrangian decomposition algorithm for constrained optimization
by: Guo, Wenyou, et al.
Published: (2025)

Dynamic programming and dimensionality in convex stochastic optimization and control
by: Pennanen, Teemu, et al.
Published: (2025)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

Connectivity via convexity: Bounds on the edge expansion in graphs
by: Hrga, Timotej, et al.
Published: (2024)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
by: Kanzow, Christian, et al.
Published: (2025)

Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework
by: Yamakawa, Yuya, et al.
Published: (2026)

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)

Solution Polishing via Path Relinking for Continuous Black-Box Optimization
by: Papageorgiou, Dimitri, et al.
Published: (2024)

Bounds for the number of basic feasible solutions generated by the simplex method with the largest distance rule
by: Kitahara, Tomonari
Published: (2025)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

Butterfly factorization with error guarantees
by: Le, Quoc-Tung, et al.
Published: (2024)

An over-relaxed ADMM for separable convex programming and its applications to statistical learning
by: Ni, Renyuan
Published: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

A decomposition algorithm for two-stage stochastic programs with approximate rotational invariance
by: Bakhshi, Marzieh, et al.
Published: (2024)

A matrix-free interior point continuous trajectory for linearly constrained convex programming
by: Qian, Xun, et al.
Published: (2024)

Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
by: Mazzi, Nicolò, et al.
Published: (2025)

Koopman-based feedback design with stability guarantees
by: Strässer, Robin, et al.
Published: (2023)

A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
by: Chang, Xiaokai, et al.
Published: (2025)

Nonlinear Cruise Controllers with Bidirectional Sensing for a String of Vehicles
by: Karafyllis, Iasson, et al.
Published: (2025)

Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
by: Dzahini, K. J., et al.
Published: (2024)

A geodesic convexity-like structure for the polar decomposition of a square matrix
by: Alimisis, Foivos, et al.
Published: (2024)

High-probability complexity guarantees for nonconvex minimax problems
by: Laguel, Yassine, et al.
Published: (2024)

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
by: Liu, Wei, et al.
Published: (2025)