Computation of the distance to semi-algebraic sets (Q4941311): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1051/cocv:2000104 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968909669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localization of an algebraic hypersurface by the exclusion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's 17th problem and best dual bounds in quadratic minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Definite Matrix Constraints in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some tests of generalized bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual estimates in multiextremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global ellipsoidal approximations and homotopy methods for solving convex analytic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Solutions to a System of Polynomial Equations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/COCV:2000104 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:24, 30 December 2024

scientific article; zbMATH DE number 1408569
Language Label Description Also known as
English
Computation of the distance to semi-algebraic sets
scientific article; zbMATH DE number 1408569

    Statements

    Computation of the distance to semi-algebraic sets (English)
    0 references
    0 references
    29 February 2000
    0 references
    dual bond
    0 references
    optimality conditions
    0 references
    polynomial systems
    0 references
    interior point methods
    0 references
    semidefinite programming
    0 references
    location of zeros
    0 references

    Identifiers

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