SwePub
Tyck till om SwePub Sök här!
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:DiVA.org:liu-40342"
 

Sökning: onr:"swepub:oai:DiVA.org:liu-40342" > New optimization al...

New optimization algorithms for large-scale isotonic regression in L2-norm

Burdakov, Oleg, 1953- (författare)
Linköpings universitet,Tekniska högskolan,Optimeringslära
Grimvall, Anders, 1945- (författare)
Linköpings universitet,Filosofiska fakulteten,Statistik
Sysoev, Oleg, 1981- (författare)
Linköpings universitet,Filosofiska fakulteten,Statistik
 (creator_code:org_t)
University of Hradec Kralove, Czech Republic : Guadeamus, 2007
2007
Engelska.
Ingår i: EUROPT-OMS Conference on Optimization,2007. - University of Hradec Kralove, Czech Republic : Guadeamus. ; , s. 44-44
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)
Abstract Ämnesord
Stäng  
  • Isotonic regression problem (IR) has numerous important applications in statistics, operations research, biology, image and signal processing and other areas. IR in L2-norm is a minimization problem in which the objective function is the squared Euclidean distance from a given point to a convex set defined by monotonicity constraints of the form: i-th component of the decision vector is less or equal to its j-th component. Unfortunately, the conventional optimization methods are unable to solve IR problems originating from large data sets. The existing IR algorithms, such as the minimum lower sets algorithm by Brunk, the min-max algorithm by Lee, the network flow algorithm by Maxwell & Muchstadt and the IBCR algorithm by Block et al. are able to find exact solution to IR problem for at most a few thousands of variables. The IBCR algorithm, which proved to be the most efficient of them, is not robust enough. An alternative approach is related to solving IR problem approximately. Following this approach, Burdakov et al. developed an algorithm, called GPAV, whose block refinement extension, GPAVR, is able to solve IR problems with a very high accuracy in a far shorter time than the exact algorithms. Apart from this, GPAVR is a very robust algorithm, and it allows us to solve IR problems with over hundred thousands of variables. In this talk, we introduce new exact IR algorithms, which can be viewed as active set methods. They use the approximate solution produced by the GPAVR algorithm as a starting point. We present results of our numerical experiments demonstrating the high efficiency of the new algorithms, especially for very large-scale problems, and their robustness. They are able to solve the problems which all existing exact IR algorithms fail to solve.

Ämnesord

NATURVETENSKAP  -- Matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics (hsv//eng)

Nyckelord

quadratic programming
isotonic regression
large-scale optimization
active-set methods
MATHEMATICS
MATEMATIK

Publikations- och innehållstyp

vet (ämneskategori)
kon (ämneskategori)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Burdakov, Oleg, ...
Grimvall, Anders ...
Sysoev, Oleg, 19 ...
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Matematik
Artiklar i publikationen
Av lärosätet
Linköpings universitet

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy