Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751): Difference between revisions

From MaRDI portal
Merged Item from Q5120196
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Log-Barrier Interior Point Methods Are Not Strongly Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving generic nonarchimedean semidefinite programs using stochastic game algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Semidefinite, Conic and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic complexity estimates in polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: FGb: A Library for Computing Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing rational solutions of linear matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real root finding for determinants of linear matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for semidefinite programs with degenerate feasible set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving root separation bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving rank-constrained semidefinite programs in exact arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding at least one point in each connected component of a real algebraic set defined by a single equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing sign conditions on a multivariate polynomial and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares of polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing parametric geometric resolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank

Revision as of 14:49, 24 July 2024

scientific article; zbMATH DE number 7245516
  • Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set
Language Label Description Also known as
English
Exact algorithms for semidefinite programs with degenerate feasible set
scientific article; zbMATH DE number 7245516
  • Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set

Statements

Exact algorithms for semidefinite programs with degenerate feasible set (English)
0 references
Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set (English)
0 references
0 references
0 references
0 references
18 February 2021
0 references
9 September 2020
0 references
semidefinite programming
0 references
polynomial optimization
0 references
exact computation
0 references
homotopy
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references