ADMBB

swMATH31752MaRDI QIDQ43463

No author found.

Source code repository: https://zenodo.org/record/1344739#.XjvLX8ZKh1M

Described by source

• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation

Related Items (6)

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties

This page was built for software: ADMBB