A SAL based algorithm for convex optimization problems

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 Annual IEEE India Conference
Subtitle of host publicationGreen Energy, Computing and Communication, INDICON 2010
PublisherIEEE Press
Number of pages4
ISBN (Electronic)978-1-4244-9074-5
ISBN (Print)978-1-4244-9072-1
DOIs
Publication statusPublished - 17 Dec 2010
Externally publishedYes
Event2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010 - Kolkata, India
Duration: 17 Dec 201019 Dec 2010

Publication series

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

Conference

Conference2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010
Country/TerritoryIndia
CityKolkata
Period17 Dec 201019 Dec 2010

Keywords

  • Iterative optimization
  • Quadratic objective function

Fingerprint

Dive into the research topics of 'A SAL based algorithm for convex optimization problems'. Together they form a unique fingerprint.

Cite this