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”

A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00316680" target="_blank" >RIV/68407700:21230/17:00316680 - isvavai.cz</a>

  • Result on the web

    <a href="http://epubs.siam.org/doi/pdf/10.1137/16M1068736" target="_blank" >http://epubs.siam.org/doi/pdf/10.1137/16M1068736</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/16M1068736" target="_blank" >10.1137/16M1068736</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems

  • Original language description

    Most path-following algorithms for tracing a solution path of a parametric nonlinear optimization problem are only certifiably convergent under strong regularity assumptions about the problem functions. In particular, linear independence of the constraint gradients at the solutions is typically assumed, which implies unique multipliers. In this paper we propose a procedure designed to solve problems satisfying a weaker set of conditions, allowing for nonunique (but bounded) multipliers. Each iteration along the path consists of three parts: (1) a Newton corrector step for the primal and dual variables, which is obtained by solving a linear system of equations, (2) a predictor step for the primal and dual variables, which is found as the solution of a quadratic programming problem, and (3) a jump step for the dual variables, which is found as the solution of a linear programming problem. We present a convergence proof and demonstrate the successful solution tracking of the algorithm numerically on a couple of illustrative examples.

  • 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

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2017

  • 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

    SIAM JOURNAL ON OPTIMIZATION

  • ISSN

    1052-6234

  • e-ISSN

    1095-7189

  • Volume of the periodical

    27

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    27

  • Pages from-to

    538-564

  • UT code for WoS article

    000404178500023

  • EID of the result in the Scopus database

    2-s2.0-85021144866