Sensitivity analysis for mixed binary quadratic programming
Fuente:
arXiv
Saved in:
| Main Authors: | Cifuentes, Diego, Dey, Santanu S., Xu, Jingye |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)
by: Cifuentes, Diego, et al.
Published: (2024)
Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)
by: Dey, Santanu S., et al.
Published: (2026)
Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
by: Dey, Santanu S., et al.
Published: (2024)
by: Dey, Santanu S., et al.
Published: (2024)
Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026)
by: Dey, Santanu S, et al.
Published: (2026)
A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)
by: Dey, Santanu S., et al.
Published: (2025)
Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
by: Derval, Guillaume, et al.
Published: (2024)
by: Derval, Guillaume, et al.
Published: (2024)
Improving Full Strong Branching Decisions by Incorporating Additional Information
by: Shah, Prachi, et al.
Published: (2025)
by: Shah, Prachi, et al.
Published: (2025)
Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)
by: Dey, Santanu S., et al.
Published: (2025)
On the integrality gap of convex mixed-integer programs
by: Kocuk, Burak, et al.
Published: (2024)
by: Kocuk, Burak, et al.
Published: (2024)
Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)
by: Dey, Santanu S., et al.
Published: (2025)
On Sparse Canonical Correlation Analysis
by: Li, Yongchun, et al.
Published: (2023)
by: Li, Yongchun, et al.
Published: (2023)
Extreme Strong Branching for QCQPs
by: Dey, Santanu S., et al.
Published: (2025)
by: Dey, Santanu S., et al.
Published: (2025)
Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)
by: Shah, Prachi, et al.
Published: (2024)
Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
by: Dey, Santanu S, et al.
Published: (2024)
by: Dey, Santanu S, et al.
Published: (2024)
Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
by: Yamakawa, Yuya
Published: (2022)
by: Yamakawa, Yuya
Published: (2022)
Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
by: Khajavirad, Aida
Published: (2026)
by: Khajavirad, Aida
Published: (2026)
Sensitivity analysis for parametric nonlinear programming: A tutorial
by: Pacaud, François
Published: (2025)
by: Pacaud, François
Published: (2025)
On semidefinite descriptions for convex hulls of quadratic programs
by: Wang, Alex L., et al.
Published: (2024)
by: Wang, Alex L., et al.
Published: (2024)
A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)
by: Li, Yijiang, et al.
Published: (2023)
Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
by: Yamakawa, Yuya
Published: (2025)
by: Yamakawa, Yuya
Published: (2025)
Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints
by: Greening, Lacy M., et al.
Published: (2025)
by: Greening, Lacy M., et al.
Published: (2025)
Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
by: Becu, Berkay, et al.
Published: (2024)
by: Becu, Berkay, et al.
Published: (2024)
Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
by: Han, Dahye, et al.
Published: (2024)
by: Han, Dahye, et al.
Published: (2024)
Sensitivity analysis of multiobjective linear programming from a geometric perspective
by: Kaci, Mustapha
Published: (2024)
by: Kaci, Mustapha
Published: (2024)
Clarabel: An interior-point solver for conic programs with quadratic objectives
by: Goulart, Paul J., et al.
Published: (2024)
by: Goulart, Paul J., et al.
Published: (2024)
Model-free stochastic linear quadratic design by semidefinite programming
by: Guo, Jing, et al.
Published: (2024)
by: Guo, Jing, et al.
Published: (2024)
Curvature batching gives single-exponential integer quadratic programming
by: Ari, Cinar, et al.
Published: (2026)
by: Ari, Cinar, et al.
Published: (2026)
New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)
by: Lu, Cheng, et al.
Published: (2026)
Mixed-Integer Programming for Change-point Detection
by: Narula, Apoorva, et al.
Published: (2026)
by: Narula, Apoorva, et al.
Published: (2026)
Linear-quadratic mixed Stackelberg-zero-sum game for mean-field regime switching system
by: Huang, Pengyan, et al.
Published: (2026)
by: Huang, Pengyan, 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)
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)
A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)
by: Hou, Di, et al.
Published: (2025)
Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
by: Dey, Santanu S., et al.
Published: (2026)
by: Dey, Santanu S., et al.
Published: (2026)
Piecewise regression via mixed-integer programming for MPC
by: Teichrib, Dieter, et al.
Published: (2024)
by: Teichrib, Dieter, et al.
Published: (2024)
Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
by: Marshall, Luke, et al.
Published: (2026)
by: Marshall, Luke, et al.
Published: (2026)
Parallel splitting method for large-scale quadratic programs
by: Vandelli, Matteo, et al.
Published: (2025)
by: Vandelli, Matteo, et al.
Published: (2025)
Provably data-driven projection method for quadratic programming
by: Nguyen, Anh Tuan, et al.
Published: (2025)
by: Nguyen, Anh Tuan, et al.
Published: (2025)
Adaptive projected SOR algorithms for nonnegative quadratic programming
by: Miyatake, Yuto, et al.
Published: (2021)
by: Miyatake, Yuto, et al.
Published: (2021)
Inverse problems for linear parabolic equations using mixed formulations - Part 1 : Theoretical analysis
by: Munch, Arnaud, et al.
Published: (2015)
by: Munch, Arnaud, et al.
Published: (2015)
Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)
by: Locatelli, Marco, et al.
Published: (2022)
Similar Items
-
Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024) -
Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026) -
Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
by: Dey, Santanu S., et al.
Published: (2024) -
Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026) -
A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)