Imagen de Portada

Real-time solution of quadratic optimization problems with banded matrices and indicator variables

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gomez, Andres, Han, Shaoning, Lozano, Leonardo
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C26, 90C27
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
por: Mexi, Gioni, et al.
Publicado: (2025)

Beyond binarity: Semidefinite programming for ternary quadratic problems
por: de Meijer, Frank, et al.
Publicado: (2026)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
por: Zeng, Renying
Publicado: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

An open-source solver for finding global solutions to constrained derivative-free optimization problems
por: Chandramouli, Gannavarapu, et al.
Publicado: (2024)

On the convexity for the range set of two quadratic functions
por: Nguyen, Huu-Quang, et al.
Publicado: (2025)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
por: Jung, Woosuk L., et al.
Publicado: (2023)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
por: Shao, Sihong, et al.
Publicado: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
por: Arima, Naohiko, et al.
Publicado: (2024)

Error Bounds for Rank-one Double Nonnegative Reformulations of QAP and Exact Penalties
por: Qian, Yitian, et al.
Publicado: (2024)

A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization
por: Josz, Cedric, et al.
Publicado: (2018)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
por: Del Pia, Alberto
Publicado: (2023)

Depth-first directional search for nonconvex optimization
por: Zhang, Yuxuan, et al.
Publicado: (2024)

Relaxations for binary polynomial optimization via signed certificates
por: Xu, Liding, et al.
Publicado: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
por: Salloum, Hadi, et al.
Publicado: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2024)

A new envelope function for nonsmooth DC optimization
por: Themelis, Andreas, et al.
Publicado: (2020)

On exactness of SDP relaxation for the maximum cut problem
por: Bhardwaj, Avinash, et al.
Publicado: (2025)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
por: Slot, Lucas
Publicado: (2021)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
por: Marumo, Hiroki, et al.
Publicado: (2024)

Closing the duality gap of the generalized trace ratio problem
por: Yang, Meijia, et al.
Publicado: (2024)

An extension of an RLT-based solver to MINLP polynomial problems
por: González-Díaz, Julio, et al.
Publicado: (2024)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
por: Franke, Paula, et al.
Publicado: (2025)

A heavy-ball type curve search method for smooth convexly constrained optimization
por: Donnini, Federica, et al.
Publicado: (2026)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
por: Slot, Lucas, et al.
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
por: Ghaffari-Hadigheh, Alireza, et al.
Publicado: (2022)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
por: Vodeb, Jaka, et al.
Publicado: (2024)

Exploiting cone approximations in an augmented Lagrangian method for conic optimization
por: Fukuda, Mituhiro, et al.
Publicado: (2024)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
por: Nolasco, Eduardo, et al.
Publicado: (2025)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
por: Guigues, Vincent, et al.
Publicado: (2017)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
por: Deng, Kangkang, et al.
Publicado: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
por: Han, Deren, et al.
Publicado: (2025)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
por: Borgwardt, Steffen, et al.
Publicado: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
por: González-Díaz, Julio, et al.
Publicado: (2025)

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)

A solution procedure for minimizing total completion time in a parallel-batching environment
por: Alfieri, Arianna, et al.
Publicado: (2020)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
por: Dolgopolik, M. V.
Publicado: (2021)