All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00160979" target="_blank" >RIV/68407700:21230/11:00160979 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.informaworld.com" target="_blank" >http://www.informaworld.com</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1080/10556780903191165" target="_blank" >10.1080/10556780903191165</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions

  • Original language description

    This paper presents a projection-based approach for solving conic feasibility problems. To find a point at the intersection of a cone and an affine subspace, we simply project a point onto this intersection. This projection is computed by dual algorithmsoperating a sequence of projections onto the cone and generalizing the alternating projection method. We release an easy-to-use Matlab package implementing an elementary dual-projection algorithm. Numerical experiments show that, for solving some semidefinite feasibility problems, the package is competitive with sophisticated conic programming software.We also provide a particular treatment for semidefinite feasibility problems modelling polynomial sum-of-squares decomposition problems.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA102%2F08%2F0186" target="_blank" >GA102/08/0186: Algorithms for Complex Systems Analysis and Control Design</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Optimization Methods and Software

  • ISSN

    1055-6788

  • e-ISSN

  • Volume of the periodical

    26

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    24

  • Pages from-to

    23-46

  • UT code for WoS article

    000282171700002

  • EID of the result in the Scopus database