Cover Image

Discreteness to Convexity: Promotion Planning via Simplotope Triangulation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Taotao, Tawarmalani, Mohit
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

MIP Relaxations in Factorable Programming
by: He, Taotao, et al.
Published: (2023)

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

Minimizing risk measures with applications in network traffic engineering
by: Chandra, Ashish, et al.
Published: (2025)

Axis-Aligned Relaxations for Mixed-Integer Nonlinear Programming
by: Zhu, Haisheng, et al.
Published: (2026)

Minimum reflux calculation for multicomponent distillation in multi-feed, multi-product columns: Algorithms and examples
by: Jiang, Zheyu, et al.
Published: (2025)

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

Switched Systems Control via Discreteness-Promoting Regularization
by: Nagahara, Masaaki, et al.
Published: (2025)

Parameter Optimization in Trajectory Planning via Differentiable Convex Programming
by: Xu, Ziqi, et al.
Published: (2025)

Assortment Optimization Under History-Dependent Effects
by: He, Taotao, et al.
Published: (2024)

On MIP Formulations for Logit-Based Multi-Purchase Choice Models and Applications
by: He, Taotao, et al.
Published: (2026)

Optimal Data Reduction under Information-Theoretic Criteria
by: He, Taotao, et al.
Published: (2025)

Adaptive Clutter Suppression via Convex Optimization
by: He, Yifan, et al.
Published: (2025)

An integer programming approach for quick-commerce assortment planning
by: Chen, Yajing, et al.
Published: (2024)

A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level
by: Jiang, Xiaotian, et al.
Published: (2025)

Approximate Resolution of Stochastic Choice-based Discrete Planning
by: Zhang, Jiajie, et al.
Published: (2024)

A Convex Optimization Approach to the Discrete Hanging Chain Problem
by: Gabrys, Russell, et al.
Published: (2025)

Curvilinear Mask Optimization for Inverse Lithography Based on B-splines and Delaunay Triangulation
by: Yi, Xiaoru, et al.
Published: (2025)

Aging-Aware Battery Control via Convex Optimization
by: Nnorom Jr., Obidike, et al.
Published: (2025)

On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning
by: Li, Yulin, et al.
Published: (2025)

Modelling to Generate Continuous Alternatives: Enabling Real-Time Feasible Portfolio Generation in Convex Planning Models
by: Lau, Michael, et al.
Published: (2024)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

Validating Convex Optimization of Reconfigurable Intelligent Surfaces via Measurements
by: Lang, Hans-Dieter, et al.
Published: (2024)

New Characterizations of Nonsmooth Convex Functions via Generalized Derivatives
by: Phat, Vo Thanh
Published: (2026)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm
by: Peng, Zedong, et al.
Published: (2024)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Nash Equilibrium and Minimax Theorems via Variational Tools of Convex Analysis
by: Bao, Nguyen Xuan Duy, et al.
Published: (2024)

Convex Trajectory Optimization via Monomial Coordinates Transcription for Cislunar Rendezvous
by: Regantini, Omar, et al.
Published: (2025)

Systematic Constraint Formulation and Collision-Free Trajectory Planning Using Space-Time Graphs of Convex Sets
by: Osburn, Matthew D., et al.
Published: (2025)

Convex Network Flows
by: Diamandis, Theo, et al.
Published: (2024)

Taxicab distance based best-worst method for multi-criteria decision-making: An analytical approach
by: Ratandhara, Harshit, et al.
Published: (2024)

An analytic framework for the multiplicative best-worst method
by: Ratandhara, Harshit, et al.
Published: (2023)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
by: Wu, Chenyang, et al.
Published: (2024)

Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
by: Hildebrand, Robert, et al.
Published: (2024)

Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-Łojasiewicz Inequality
by: Aktas, Fatih Selim, et al.
Published: (2025)

Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging
by: Burns, Matthew X., et al.
Published: (2026)

Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework
by: Latorre, Vittorio
Published: (2025)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
by: Baghbadorani, Reza Rahimi, et al.
Published: (2025)