By Topic

A SAL based algorithm for convex optimization problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Amit Kumar Mishra ; Department of Electronics and Communication Engineering, Indian Institute of Technology Guwahati, India

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 n log2 N number of iterations.

Published in:

2010 Annual IEEE India Conference (INDICON)

Date of Conference:

17-19 Dec. 2010