Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Juan-Enrique Martinez-Legaz / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Juan-Enrique Martinez-Legaz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077716022 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.6442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of polynomials restricted to a smooth variety using sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of polynomials using generalized critical values and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of rational functions: a semidefinite programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of non-negative polynomials having finitely many zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminants and nonnegative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying convergence of Lasserre's hierarchy via flat truncation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of rational functions and the nearest GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial optimization problems via the truncated tangency variety and sums of squares / rank
 
Normal rank

Latest revision as of 02:02, 9 July 2024

scientific article
Language Label Description Also known as
English
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
scientific article

    Statements

    Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2014
    0 references
    The problem of minimizing a rational function subject to equality and inequality polynomial constraints is reformulated, by a standard homogenization technique, as an equivalent (under suitable assumptions) polynomial optimization problem. To solve the latter problem, the authors consider the Jacobian SDP relaxation proposed by \textit{J. Nie} [Math. Program. 137, No. 1--2 (A), 225--255 (2013; Zbl 1266.65094)] and show that this relaxation is exact under an assumption weaker than the one considered by Nie. They also provide some numerical examples.
    0 references
    0 references
    minimization
    0 references
    rational functions
    0 references
    Jacobian SDP relaxation
    0 references
    homogenization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references