:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhu, Hao, Yan, Shengchao, Hoffmann, Jasper, Boedecker, Joschka
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Computational Engineering, Finance, and Science Machine Learning 90C25 (Primary), 90C59, 90C90
Online Access:	https://arxiv.org/abs/2504.01431
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fitting Reinforcement Learning Model to Behavioral Data under Bandits
by: Zhu, Hao, et al.
Published: (2025)

Disciplined Biconvex Programming
by: Zhu, Hao, et al.
Published: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
by: Badenbroek, Riley, et al.
Published: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Tractable downfall of basis pursuit in structured sparse optimization
by: Marmary, Maya V., et al.
Published: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
by: Hoogervorst, Rowan, et al.
Published: (2024)

CHAP: A Hybrid GPU-CPU Heuristic for MIP
by: Tjusila, Gennesaret Kharistio, et al.
Published: (2026)

A solution procedure for minimizing total completion time in a parallel-batching environment
by: Alfieri, Arianna, et al.
Published: (2020)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
by: Gonçalves-Dosantos, Juan Carlos, et al.
Published: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

MOCVXPY: a CVXPY extension for multiobjective optimization
by: Salomon, Ludovic, et al.
Published: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
by: Morinaga, Daiki, et al.
Published: (2022)

Perpertual Coupled Simulated Annealing for Continuous Optimization
by: Gonçalves-e-Silva, Kayo, et al.
Published: (2018)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

Boscia.jl: A review and tutorial
by: Xiao, Wenjie, et al.
Published: (2025)

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty
by: Blanco, Víctor, et al.
Published: (2025)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
by: Harris, Elizabeth, et al.
Published: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
by: Sakabe, Keiya
Published: (2026)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
by: Bai, Xiaoning, et al.
Published: (2022)