A SAL based algorithm for convex optimization problems

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddTrafodion Cynhadledd (Nid-Cyfnodolyn fathau)

Crynodeb

A new successive approximation logic (SAL) based iterative optimization algorithm for convex optimization problem is presented in this paper. The algorithm can be generalized for multi-variable quadratic objective function. There are two major advantages of the proposed algorithm. First of all, the proposed algorithm takes a fixed number of iterations which depends not on the objective function but on the search span and on the resolution we desire. Secondly, for an n variable objective function, if the number of data points we consider in the span is N, then the algorithm takes just nlog2 N number of iterations.

Iaith wreiddiolSaesneg
TeitlProceedings of the 2010 Annual IEEE India Conference
Is-deitlGreen Energy, Computing and Communication, INDICON 2010
CyhoeddwrIEEE Press
Nifer y tudalennau4
ISBN (Electronig)978-1-4244-9074-5
ISBN (Argraffiad)978-1-4244-9072-1
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 17 Rhag 2010
Cyhoeddwyd yn allanolIe
Digwyddiad2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010 - Kolkata, India
Hyd: 17 Rhag 201019 Rhag 2010

Cyfres gyhoeddiadau

EnwProceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010

Cynhadledd

Cynhadledd2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010
Gwlad/TiriogaethIndia
DinasKolkata
Cyfnod17 Rhag 201019 Rhag 2010

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'A SAL based algorithm for convex optimization problems'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn