Cover Image

Convexification of a Separable Function over a Polyhedral Ground Set

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dey, Santanu S., Kocuk, Burak
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

Conic Reformulations for Kullback-Leibler Divergence Constrained Distributionally Robust Optimization and Applications
by: Kocuk, Burak
Published: (2020)

A Stochastic Programming Approach to the Railcar Maintenance Problem with Service Level and Track Capacity Considerations
by: Elhüseyni, Murat, et al.
Published: (2025)

Risk-Averse Antibiotics Time Machine Problem
by: Tuncer, Deniz, et al.
Published: (2025)

Discretization-Based Solution Approaches for the Circle Packing Problem
by: Taşpınar, Rabia, et al.
Published: (2023)

MIQCP and MISOCP-Based Solution Methods for the Multi-Layer Thin Films Problem
by: Tuncer, Deniz, et al.
Published: (2026)

An MISOCP-Based Decomposition Approach for the Unit Commitment Problem with AC Power Flows
by: Tuncer, Deniz, et al.
Published: (2022)

Copositive Matrices with Ordered Off-Diagonal Entries
by: Blekherman, Grigoriy, et al.
Published: (2026)

A Dynamic Strategic Plan for the Transition to a Clean Bus Fleet using Multi-Stage Stochastic Programming with a Case Study in Istanbul
by: Karimi, Neman, et al.
Published: (2024)

Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations
by: Okumusoglu, Bahar Cennet, et al.
Published: (2025)

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

Generator Subadditive Functions for Mixed-Integer Programs
by: Olivares, Gustavo Ivan Angulo, et al.
Published: (2024)

Learning to Relax Nonconvex Quadratically Constrained Quadratic Programs
by: Dedeoglu, Muge, et al.
Published: (2025)

A Dynamic Strategic Plan for Transition to Campus-Scale Clean Electricity Using Multi-Stage Stochastic Programming
by: Şener, Ahmet Emir, et al.
Published: (2025)

On the Convexification of a Class of Mixed-Integer Conic Sets
by: Du, Guxin, et al.
Published: (2025)

On the Convexification of Spectral Sets Induced by Non-Invariant Sets
by: Zhao, Renbo
Published: (2024)

Solving the Heilbronn Triangle Problem using Global Optimization Methods
by: Monji, Amirhossein, et al.
Published: (2025)

Convexification of bilinear terms over network polytopes
by: Khademnia, Erfan, et al.
Published: (2023)

Lossless Convexification and Duality
by: Lee, Donghwan
Published: (2021)

Improving Full Strong Branching Decisions by Incorporating Additional Information
by: Shah, Prachi, et al.
Published: (2025)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026)

Convexification Techniques for Fractional Programs
by: He, Taotao, et al.
Published: (2023)

Convexification of Multi-period Quadratic Programs with Indicators
by: Lee, Jisun, et al.
Published: (2024)

Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach
by: Li, Tianwei, 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)

Intrinsic Successive Convexification: Trajectory Optimization on Smooth Manifolds
by: Kraisler, Spencer, et al.
Published: (2025)

Extreme Strong Branching for QCQPs
by: Dey, Santanu S., et al.
Published: (2025)

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

On Sparse Canonical Correlation Analysis
by: Li, Yongchun, et al.
Published: (2023)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
by: Dey, Santanu S, et al.
Published: (2024)

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

Trajectory Optimization by Successive Pseudospectral Convexification on Riemannian Manifolds
by: Narumi, Tatsuya, et al.
Published: (2025)

Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
by: Han, Dahye, et al.
Published: (2024)

Convexification of classes of mixed-integer sets with L$^\natural$-convexity
by: Yu, Qimeng, et al.
Published: (2025)

Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction
by: Elango, Purnanand, et al.
Published: (2024)

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

Control Lyapunov Function Design via Configuration-Constrained Polyhedral Computing
by: Houska, Boris, et al.
Published: (2025)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
by: Roberts, Lindon, et al.
Published: (2026)