Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The nearest polynomial with a given zero, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial with a zero in a given domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial with a given zero, and similar problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a nearest polynomial with a given root / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest complex polynomial with a zero in a given complex domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to computing the nearest complex polynomial with a given zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial to multiple given polynomials with a given zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial to multiple given polynomials with a given zero in the real case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root Neighborhoods of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured singular values and stability analysis of uncertain polynomials. II: A missing link / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projections onto mixed-norm balls with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient primal dual prox method for non-smooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank

Latest revision as of 00:10, 25 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of the nearest polynomial by linearized alternating direction method
scientific article

    Statements

    Efficient computation of the nearest polynomial by linearized alternating direction method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 April 2021
    0 references
    empirical polynomial
    0 references
    nearest polynomial
    0 references
    \( \ell_{p,q}\) norm
    0 references
    real zero
    0 references
    linearized alternating direction method
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references