Numerical algebraic geometry and semidefinite programming
Standard interior point methods in semidefinite programming can be viewed as tracking a solution path for a homotopy defined by a system of bilinear equations. By considering this in the context of numerical algebraic geometry, we employ numerical algebraic geometric techniques such as adaptive prec...
Main Authors: | Jonathan D. Hauenstein, Alan C. Liddell, Jr., Sanesha McPherson, Yi Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-08-01
|
Series: | Results in Applied Mathematics |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S259003742100025X |
Similar Items
-
Dualities in convex algebraic geometry
by: Philipp Rostalski, et al.
Published: (2010-01-01) -
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
by: Igor Klep, et al.
Published: (2012-12-01) -
Topics in computation, numerical methods and algebraic geometry
by: Eklund, David
Published: (2010) -
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
by: Walter Gómez Bofill, et al.
Published: (2014-12-01) -
Topics in Computational Algebraic Geometry and Deformation Quantization
by: Jost, Christine
Published: (2013)