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”

On the minimum-norm solution of convex quadratic programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10435557" target="_blank" >RIV/00216208:11320/21:10435557 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=HhOQoBN.wE" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=HhOQoBN.wE</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1051/ro/2021011" target="_blank" >10.1051/ro/2021011</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the minimum-norm solution of convex quadratic programming

  • Original language description

    We discuss some basic concepts and present a numerical procedure for finding the minimum-norm solution of convex quadratic programs (QPs) subject to linear equality and inequality constraints. Our approach is based on a theorem of alternatives and on a convenient characterization of the solution set of convex QPs. We show that this problem can be reduced to a simple constrained minimization problem with a once-differentiable convex objective function. We use finite termination of an appropriate Newton&apos;s method to solve this problem. Numerical results show that the proposed method is efficient.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    50201 - Economic Theory

Result continuities

  • Project

    <a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • 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

    RAIRO Recherche Operationnelle

  • ISSN

    0399-0559

  • e-ISSN

  • Volume of the periodical

    55

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    FR - FRANCE

  • Number of pages

    14

  • Pages from-to

    247-260

  • UT code for WoS article

    000628920000001

  • EID of the result in the Scopus database

    2-s2.0-85102747974