This Google Spinout Thinks AI Can Fix America’s EV Battery Problem

SandboxAQ has an AI platform to help speed the development of safer, higher-powered, solid-state batteries for autos, the ...
INSPIRE

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems

Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental study of ...
The Harvard Crimson

Harvard Has an Optimization Epidemic

Heidi S. Enger ’27, an Associate Editorial Editor, is a Social Studies Concentrator in Eliot House. She’s enrolled in Ec10b this semester (don’t ask). Harvard students have to stop treating life like ...
news.ucsb.edu

Innovative hardware for rapidly solving optimization problems

The rise of AI, graphic processing, combinatorial optimization and other data-intensive applications has resulted in data-processing bottlenecks, as ever greater amounts of data must be shuttled back ...
INSPIRE

A hybrid classical-quantum approach to highly constrained Unit Commitment problems

The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve.
SciELO

Solving Weighted Orthogonal Procrustes Problems via a Projected Gradient Method

This paper proposes a family of line-search methods to deal with weighted orthogonal procrustes problems. In particular, the proposed family uses a search direction based on a convex combination ...
IEEE

Fixed-Point Grover Adaptive Search for Quadratic Binary Optimization Problems

Abstract: In this article, we study a Grover-type method for quadratic unconstrained binary optimization (QUBO) problems. For an $n$-dimensional QUBO problem with $m ...