Copertina

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Shaoze, Wu, Junhao, Lu, Cheng, Deng, Zhibin, Fang, Shu-Cherng
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Variable Aggregation-based Perspective Reformulation for Mixed-Integer Convex Optimization with Symmetry
di: Wu, Junhao, et al.
Pubblicazione: (2026)

Variable aggregation-based formulations for pumped storage hydro model in the day-ahead unit commitment problem
di: Li, Shaoze, et al.
Pubblicazione: (2025)

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

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

A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees
di: Bhathena, Aaresh, et al.
Pubblicazione: (2024)

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

Sequential Quadratic Optimization for Solving Expectation Equality Constrained Stochastic Optimization Problems
di: Shen, Haoming, et al.
Pubblicazione: (2025)

Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
di: Hendrych, Deborah, et al.
Pubblicazione: (2023)

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

Solving Linear-Quadratic Stochastic Control Problems with Signatures
di: Aqsha, Alif, et al.
Pubblicazione: (2026)

Solving the Convex Flow Problem
di: Diamandis, Theo, et al.
Pubblicazione: (2024)

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

Revisit First-order Methods for Geodesically Convex Optimization
di: Shu, Yunlu, et al.
Pubblicazione: (2025)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
di: Boontawee, Sudkobfa, et al.
Pubblicazione: (2026)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
di: Ren, Yijin, et al.
Pubblicazione: (2025)

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

Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
di: Fong, Robert Simon, et al.
Pubblicazione: (2024)

Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
di: Pankoon, Ontima, et al.
Pubblicazione: (2026)

General Distribution Steering: A Sub-Optimal Solution by Convex Optimization
di: Wu, Guangyu, et al.
Pubblicazione: (2023)

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

Exploiting GPU/SIMD Architectures for Solving Linear-Quadratic MPC Problems
di: Cole, David, et al.
Pubblicazione: (2022)

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

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
di: Vyguzov, Alexander, et al.
Pubblicazione: (2024)

Universal Gradient Methods for Stochastic Convex Optimization
di: Rodomanov, Anton, et al.
Pubblicazione: (2024)

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
di: Yang, Linxin, et al.
Pubblicazione: (2024)

Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers
di: Mazumder, Arul, et al.
Pubblicazione: (2024)

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

Solving Quadratic Programs with Slack Variables via ADMM without Increasing the Problem Size
di: Lew, Thomas, et al.
Pubblicazione: (2025)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
di: Zhang, Zhe, et al.
Pubblicazione: (2022)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
di: Deng, Qi, et al.
Pubblicazione: (2024)

An Efficient Quadratic Penalty Method for a Class of Graph Clustering Problems
di: Teng, Wenshun, et al.
Pubblicazione: (2025)

Robust Optimization Approach for Solving Uncertain Multiobjective Optimization Problems Using the Projected Gradient Method
di: Kumar, Shubham, et al.
Pubblicazione: (2025)

Polyak Minorant Method for Convex Optimization
di: Devanathan, Nikhil, et al.
Pubblicazione: (2023)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
di: Moon, Sang Bin, et al.
Pubblicazione: (2024)

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

S-D-RSM: Stochastic Distributed Regularized Splitting Method for Large-Scale Convex Optimization Problems
di: Wang, Maoran, et al.
Pubblicazione: (2025)

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

The Generalized Multiplicative Gradient Method for A Class of Convex Optimization Problems Over Symmetric Cones
di: Zhao, Renbo
Pubblicazione: (2022)

A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
di: Zhang, Yule, et al.
Pubblicazione: (2026)

Policy Optimization in the Linear Quadratic Gaussian Problem: A Frequency Domain Perspective
di: Li, Haoran, et al.
Pubblicazione: (2025)