Cover Image

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Linxin, Li, Bingheng, Ding, Tian, Wu, Jianghua, Wang, Akang, Wang, Yuyi, Tang, Jiliang, Sun, Ruoyu, Luo, Xiaodong
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting
by: Xiong, Jinxin, et al.
Published: (2025)

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
by: Li, Bingheng, et al.
Published: (2024)

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

A Learning-Based Inexact ADMM for Solving Quadratic Programs
by: Gao, Xi, et al.
Published: (2025)

SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization
by: Chen, Qian, et al.
Published: (2024)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

Successive Fixing for Large-Scale SCUC Using First-Order Methods
by: Xiong, Jinxin, et al.
Published: (2025)

When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
by: Chen, Qian, et al.
Published: (2025)

Smoothing Binary Optimization: A Primal-Dual Perspective
by: Liu, Wenbo, et al.
Published: (2025)

Global and Robust Optimization for Non-Convex Quadratic Programs
by: Marousi, Asimina, et al.
Published: (2025)

Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
by: Li, Shuai, et al.
Published: (2025)

A decomposition method in the multivariate feedback particle filter via tensor product Hermite polynomials
by: Wang, Ruoyu, et al.
Published: (2025)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
by: Qiu, Yeqing, et al.
Published: (2024)

HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
by: Tran, Trinh, et al.
Published: (2026)

Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search
by: Liu, Wenbo, et al.
Published: (2024)

Parallel Graver Basis Extraction for Nonlinear Integer Optimization
by: Liu, Wenbo, et al.
Published: (2024)

Promoting Fair Online Resource Allocation with Indivisible Units
by: Averbakh, Igor, et al.
Published: (2026)

GPU-based Split algorithm for Large-Scale CVRPSD
by: Zhao, Jingyi, et al.
Published: (2025)

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
by: Li, Shaoze, et al.
Published: (2025)

A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
by: Wang, Akang, et al.
Published: (2023)

IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs
by: Gao, Xi, et al.
Published: (2024)

A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming
by: Lu, Haihao, et al.
Published: (2023)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
by: Lu, Cheng, et al.
Published: (2025)

Complexity of Minimizing Regularized Convex Quadratic Functions
by: Thomsen, Daniel Berg, et al.
Published: (2024)

State estimations and noise identifications with intermittent corrupted observations via Bayesian variational inference
by: Sun, Peng, et al.
Published: (2026)

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

Prox-PEP: A Proximal Partial Exact Penalty Algorithm for Weakly Convex Stochastic Nonlinear Programming
by: Tang, Lixin, et al.
Published: (2026)

Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound
by: Iranpour, Mohammadreza, et al.
Published: (2025)

From Sequential to Parallel: Reformulating Dynamic Programming as GPU Kernels for Large-Scale Stochastic Combinatorial Optimization
by: Zhao, Jingyi, et al.
Published: (2026)

Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices
by: Han, Qingyu, et al.
Published: (2025)

Error Estimates of the Gain Approximation by Hermite-Galerkin Method in Feedback Particle Filter
by: Wang, Ruoyu, et al.
Published: (2026)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
by: Liao, Feng-Yi, et al.
Published: (2024)

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

Solving Convex Quadratic Optimization with Indicators Over Structured Graphs
by: Bhathena, Aaresh, et al.
Published: (2026)

Efficient Nonlinear MPC by Leveraging LPV Embedding and Sequential Quadratic Programming
by: Karachalios, Dimitrios S., et al.
Published: (2024)

Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem
by: Guo, Cheng, et al.
Published: (2022)

A Log-domain Interior Point Method for Convex Quadratic Games
by: Liu, Bingqi, et al.
Published: (2024)

Stochastic Quadratic Dynamic Programming
by: Guigues, Vincent, et al.
Published: (2025)

Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition
by: Ding, Shihong, et al.
Published: (2024)