:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Xiong, Jinxin, Yang, Linxin, Wang, Yingxiao, Huang, Yanting, Wu, Jianghua, Lei, Shunbo, Wang, Akang
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	https://arxiv.org/abs/2507.20465
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Successive Fixing for Large-Scale SCUC Using First-Order Methods
par: Xiong, Jinxin, et autres
Publié: (2025)

Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting
par: Xiong, Jinxin, et autres
Publié: (2025)

A Learning-Based Inexact ADMM for Solving Quadratic Programs
par: Gao, Xi, et autres
Publié: (2025)

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
par: Yang, Linxin, et autres
Publié: (2024)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
par: Qiu, Yeqing, et autres
Publié: (2024)

Smoothing Binary Optimization: A Primal-Dual Perspective
par: Liu, Wenbo, et autres
Publié: (2025)

IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs
par: Gao, Xi, et autres
Publié: (2024)

Promoting Fair Online Resource Allocation with Indivisible Units
par: Averbakh, Igor, et autres
Publié: (2026)

SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization
par: Chen, Qian, et autres
Publié: (2024)

Parallel Graver Basis Extraction for Nonlinear Integer Optimization
par: Liu, Wenbo, et autres
Publié: (2024)

When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
par: Chen, Qian, et autres
Publié: (2025)

Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search
par: Liu, Wenbo, et autres
Publié: (2024)

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
par: Li, Bingheng, et autres
Publié: (2024)

Accurate Linear Cutting-Plane Relaxations for ACOPF
par: Bienstock, Daniel, et autres
Publié: (2023)

Deepest Cuts for Benders Decomposition
par: Hosseini, Mojtaba, et autres
Publié: (2021)

Sample Robust Scheduling of Electricity-Gas Systems Under Wind Power Uncertainty
par: Liu, Rong-Peng, et autres
Publié: (2023)

On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
par: Wu, Chenyang, et autres
Publié: (2024)

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
par: Bienstock, Daniel, et autres
Publié: (2024)

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations
par: Bugosen, Sergio I., et autres
Publié: (2024)

A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
par: Wang, Akang, et autres
Publié: (2023)

GPU-based Split algorithm for Large-Scale CVRPSD
par: Zhao, Jingyi, et autres
Publié: (2025)

Learning to Cut: Reinforcement Learning for Benders Decomposition
par: Cai, Haochen, et autres
Publié: (2026)

Complexity Analysis of the Regular Simplicial Search Method with Reflection and Shrinking Steps for Derivative-Free Optimization
par: Cao, Liyuan, et autres
Publié: (2025)

Tricks from the Trade for Large-Scale Markdown Pricing: Heuristic Cut Generation for Lagrangian Decomposition
par: Streeck, Robert, et autres
Publié: (2024)

Screening Cut Generation for Sparse Ridge Regression
par: Tan, Haozhe, et autres
Publié: (2025)

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
par: Wang, Bofan, et autres
Publié: (2024)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
par: Luo, Fengqiao, et autres
Publié: (2021)

A Hybrid Relaxation-Heuristic Framework for Solving MIP with Binary Variables
par: Wang, Zayn
Publié: (2026)

Nonlinear Dynamical Unbalanced Optimal Transport: Relaxation and Duality
par: Wu, Dongjun, et autres
Publié: (2025)

From Maximum Cut to Maximum Independent Set
par: Wu, Chuixiong, et autres
Publié: (2024)

Temporal and Spatial Decomposition for Prospective Studies in Energy Systems under Uncertainty
par: Parra, Camila Martinez, et autres
Publié: (2025)

Regularization in Data-driven Predictive Control: A Convex Relaxation Perspective
par: Shang, Xu, et autres
Publié: (2025)

Accelerating Stochastic Energy System Optimization Models: Temporally Split Benders Decomposition
par: Sasanpour, Shima, et autres
Publié: (2025)

Safe and Stable Filter Design Using a Relaxed Compatibitlity Control Barrier -- Lyapunov Condition
par: Wang, Han, et autres
Publié: (2024)

Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices
par: Han, Qingyu, et autres
Publié: (2025)

A Dynamic Relaxation Framework for Global Solution of ACOPF
par: Tang, Yu-Yang, et autres
Publié: (2025)

MIP Relaxations in Factorable Programming
par: He, Taotao, et autres
Publié: (2023)

Relaxed Lagrangian Approach to First-Order Non-Convex Mean Field Type Control Problem
par: Mendico, Cristian, et autres
Publié: (2024)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
par: Hu, Hao, et autres
Publié: (2024)

Benders Decomposition for Passenger-Oriented Train Timetabling with Hybrid Periodicity
par: Yao, Zhiyuan, et autres
Publié: (2025)