Numerical algebraic geometry and semidefinite programming

DOI10.1016/j.rinam.2021.100166zbMath1476.90231OpenAlexW3176324532WikidataQ115996889 ScholiaQ115996889MaRDI QIDQ1979983

Jonathan D. Hauenstein, Alan C. jun. Liddell, Sanesha McPherson, Yi Zhang

Publication date: 3 September 2021

Published in: Results in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.rinam.2021.100166

zbMATH Keywords

homotopy continuationsemidefinite programmingprojective spacenumerical algebraic geometryfacial reductioninfeasible

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items

On the complexity of analyticity in semi-definite optimization

Uses Software

• Matlab
• SDPA
• SeDuMi
• SDPT3
• Mosek
• Bertini
• Sieve-SDP
• frlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isosingular sets and deflation
• Facial reduction algorithms for conic optimization problems
• Efficient path tracking methods
• Certified predictor-corrector tracking for Newton homotopies
• Coefficient-parameter polynomial continuation
• Regularizing the abstract convex program
• A power series method for computing singular solutions to nonlinear analytic systems
• An exact duality theory for semidefinite programming and its complexity implications
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Adaptive strategies for solving parameterized systems using homotopy continuation
• Newton's method with deflation for isolated singularities of polynomial systems
• Computing singular solutions to nonlinear analytic systems
• The Exponentially Convergent Trapezoidal Rule
• Validating the Completeness of the Real Solution Set of a System of Polynomial Equations
• Approximation Algorithms and Semidefinite Programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Semidefinite optimization
• Adaptive Multiprecision Path Tracking
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Linear Matrix Inequalities in System and Control Theory
• Strong Duality for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Numerical algebraic geometry and semidefinite programming