:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Strahl, William R., Raghunathan, Arvind U., Sahinidis, Nikolaos V., Gounaris, Chrysanthos E.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2408.13058
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)

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

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

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

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
by: Bayramoğlu, Selin, et al.
Published: (2026)

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

Hierarchical Contact-Rich Trajectory Optimization for Multi-Modal Manipulation using Tight Convex Relaxations
by: Shirai, Yuki, et al.
Published: (2025)

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

Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations
by: Okumusoglu, Bahar Cennet, et al.
Published: (2025)

Constrained Optimization From a Control Perspective via Feedback Linearization
by: Zhang, Runyu, et al.
Published: (2025)

Coach Reservation for Groups Requests
by: Cardonha, Carlos H., et al.
Published: (2024)

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

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)

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

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

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

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
by: Basu, Amitabh, et al.
Published: (2025)

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

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
by: Zhou, Jinling, et al.
Published: (2025)

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

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

Why Study the Spherical Convexity of Non-Homogeneous Quadratic Functions, and What Makes It Surprising?
by: Bolton, R., et al.
Published: (2024)

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

Exactness of the DNN Relaxation for Random Standard Quadratic Programs
by: Chen, Xin
Published: (2026)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
by: Chen, Junyu, et al.
Published: (2024)

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

Model Construction for Convex-Constrained Derivative-Free Optimization
by: Roberts, Lindon
Published: (2024)

Tight Rates for Bandit Control Beyond Quadratics
by: Sun, Y. Jennifer, et al.
Published: (2024)

Broximal Alignment for Global Non-Convex Optimization
by: Gruntkowska, Kaja, et al.
Published: (2026)

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
by: Armacki, Aleksandar, et al.
Published: (2026)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)

A Convex Optimization Approach to Compute Trapping Regions for Lossless Quadratic Systems
by: Liao, Shih-Chi, et al.
Published: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
by: Chayti, El Mahdi, et al.
Published: (2025)

A Partition-Based Implementation of the Relaxed ADMM for Distributed Convex Optimization over Lossy Networks
by: Bastianello, Nicola, et al.
Published: (2018)

A Globally Convergent Algorithm for Neural Network Parameter Optimization Based on Difference-of-Convex Functions
by: Tschernutter, Daniel, et al.
Published: (2024)

On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2024)

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
by: Wang, Bofan, et al.
Published: (2024)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

Optimal Decentralized Composite Optimization for Convex Functions
by: Ye, Haishan, et al.
Published: (2023)