Displaying similar documents to “Nonmonotone strategy for minimization of quadratics with simple constraints”

Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs

Zhisong Hou, Hongwei Jiao, Lei Cai, Chunyang Bai (2017)

Open Mathematics

Similarity:

This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex. By utilizing the characteristics of quadratic function, we construct a new linearizing method, so that the quadratically constrained quadratic programs problem can be converted into a linear relaxed programs problem. Moreover, the established linear relaxed programs problem is embedded within a branch-and-bound...

An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem

Pospíšil, Lukáš

Similarity:

We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints. This active set based algorithm explores the faces by the conjugate gradients and changes the active sets and active variables by the gradient projection with the Barzilai-Borwein steplength. We show how to use the algorithm for the solution of separable and equality constraints. The power of our modification is demonstrated on the...

A new nonmonotone adaptive trust region algorithm

Ahmad Kamandi, Keyvan Amini (2022)

Applications of Mathematics

Similarity:

We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for adjusting the trust region radius that avoids undesirable directions and exploits a new strategy to prevent sudden increments of objective function values in nonmonotone trust region techniques. Global convergence of this algorithm is investigated under some mild...