Abstract: For the conjugate gradient method to solve the unconstrained optimization problem, given a new interval method to obtain the direction parameters, and a new conjugate gradient algorithm is ...

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 ...

This work deals with solving continuous-time nonlinear complementarity problems defined on two types of nonempty closed convex cones: a polyhedral cone (positive octant) and a second-order cone.

In a recent article published in the journal Scientific Reports, researchers demonstrated the effectiveness of hybrid solvers, including D-Wave's quantum technology, in optimizing the scheduling of ...

PRIMA is a package for solving general nonlinear optimization problems without using derivatives. It provides the reference implementation for Powell's derivative-free optimization methods, i.e., ...

Point clouds are sets of points used to visualize three-dimensional (3D) objects. Point clouds can be static or dynamic. Each point is characterized by its 3D geometry coordinates and attributes such ...

Abstract: This brief investigates the distributed unconstrained optimization problem, where its global objective function consists of the sum of $N$ local objective ...

# Routing optimization generally solves the [Vehicle Routing Problem](https://en.wikipedia.org/wiki/Vehicle_routing_problem) # (a simple example being the more widely ...