Microsoft has built a prototype computer that uses light and analog signals instead of traditional binary computing.

Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...

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

ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.

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

Add a description, image, and links to the optimization-problem-solvng topic page so that developers can more easily learn about it.

We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to ...

The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently ...