Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain

DOI10.1007/BF02367749zbMath0835.65073OpenAlexW2093519838MaRDI QIDQ1905198

Naum Z. Shor, O. A. Berezovskyi

Publication date: 8 January 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02367749

zbMATH Keywords

quadratic programmingsystems of polynomial equationscomplex zeroscomplex domaindual quadratic solutions

Mathematics Subject Classification ID

Related Items (3)

Exactness criteria for SDP-relaxations of quadratic extremum problems ⋮ Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems ⋮ Exact dual bounds for some nonconvex minimax quadratic optimization problems

Cites Work

• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain