:: Library Catalog

Cover Image

Saved in:

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

Similar Items

Multi-convex Programming for Discrete Latent Factor Models Prototyping
by: Zhu, Hao, et al.
Published: (2025)

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

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

Tractable downfall of basis pursuit in structured sparse optimization
by: Marmary, Maya V., 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)

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

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
by: Aguirre, Jacob, et al.
Published: (2025)

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

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

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

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)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
by: Mansueto, Pierluigi, et al.
Published: (2024)

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

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

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
by: Liang, Ling, et al.
Published: (2024)

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

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)

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 conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)

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)

Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
by: Jiang, Ruichen, et al.
Published: (2022)

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

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

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
by: Roth, Jake, et al.
Published: (2024)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
by: Tran-Dinh, Quoc
Published: (2025)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2024)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)

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

Improving Directions in Mixed Integer Bilevel Linear Optimization
by: Battista, Federico, et al.
Published: (2025)

Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
by: Tahernejad, Sahar, et al.
Published: (2025)

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