Quadratic functions with exponential number of local maxima

DOI10.1016/0167-6377(86)90100-8zbMath0597.90067OpenAlexW2001988454MaRDI QIDQ1079496

Bahman Kalantari

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90100-8

zbMATH Keywords

quadratic functionglobal maximizationexponential worst case time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (5)

On the number of local maxima in quadratic 0-1 programs ⋮ On computational capabilities of Ising machines based on nonlinear oscillators ⋮ Template-Based Minor Embedding for Adiabatic Quantum Optimization ⋮ Pseudo-Boolean optimization ⋮ A new technique for generating quadratic programming test problems

Cites Work

• Optimization by Simulated Annealing
• Some simplified NP-complete graph problems
• Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Minimum cuts and related problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Quadratic functions with exponential number of local maxima