scientific article; zbMATH DE number 1488016

From MaRDI portal

Publication:4495147

Jump to:navigation, search

zbMath0982.90039MaRDI QIDQ4495147

Publication date: 10 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

continuous location nonconvex quadratic programming distance geometry semi-definite programming branch and bound algorithm d.c. optimization normal branching tight bounding variables decoupling SDP relaxations

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (5)

The directional subdifferential of the difference of two convex functions ⋮ A sample-path approach to optimal position liquidation ⋮ On solving nonconvex optimization problems by reducing the duality gap ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ New global optimality conditions for nonsmooth DC optimization problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4495147&oldid=18582738"