A SAL based algorithm for convex optimization problems

Amit Kumar Mishra

doi:10.1109/INDCON.2010.5712598

A SAL based algorithm for convex optimization problems

Amit Kumar Mishra

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (ISBN)

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 nlog₂ N number of iterations.

Iaith wreiddiol	Saesneg
Teitl	Proceedings of the 2010 Annual IEEE India Conference
Is-deitl	Green Energy, Computing and Communication, INDICON 2010
Cyhoeddwr	Institute of Electrical and Electronics Engineers
Nifer y tudalennau	4
ISBN (Electronig)	978-1-4244-9074-5
ISBN (Argraffiad)	978-1-4244-9072-1
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1109/INDCON.2010.5712598
Statws	Cyhoeddwyd - 17 Rhag 2010
Cyhoeddwyd yn allanol	Ie
Digwyddiad	2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010 - Kolkata, India Hyd: 17 Rhag 2010 → 19 Rhag 2010

Cyfres gyhoeddiadau

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

Cynhadledd

Cynhadledd	2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010
Gwlad/Tiriogaeth	India
Dinas	Kolkata
Cyfnod	17 Rhag 2010 → 19 Rhag 2010

NDC y CU

Mae’r allbwn hwn yn cyfrannu at y Nod(au) Datblygu Cynaliadwy canlynol

NDC 7 Ynni Fforddiadwy a Glân

Mynediad at Ddogfen

10.1109/INDCON.2010.5712598

Cysylltiad parhaol

Dolen barhaus

Ffeiliau eraill a chysylltiadau

Dolen i’r cyhoeddiad yn Scopus

Dyfynnu hyn

Mishra, A. K. (2010). A SAL based algorithm for convex optimization problems. Yn Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010 erthygl 5712598 (Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/INDCON.2010.5712598

@inproceedings{2a94fc1951df4049afcb433f69eb0368,

title = "A SAL based algorithm for convex optimization problems",

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.",

keywords = "Iterative optimization, Quadratic objective function",

author = "Mishra, \{Amit Kumar\}",

year = "2010",

month = dec,

day = "17",

doi = "10.1109/INDCON.2010.5712598",

language = "English",

isbn = "978-1-4244-9072-1",

series = "Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010",

publisher = "Institute of Electrical and Electronics Engineers",

booktitle = "Proceedings of the 2010 Annual IEEE India Conference",

address = "United States of America",

note = "2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010 ; Conference date: 17-12-2010 Through 19-12-2010",

}

Mishra, AK 2010, A SAL based algorithm for convex optimization problems. yn Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010., 5712598, Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010, Institute of Electrical and Electronics Engineers, 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010, Kolkata, India, 17 Rhag 2010. https://doi.org/10.1109/INDCON.2010.5712598

A SAL based algorithm for convex optimization problems. / Mishra, Amit Kumar.
Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010. Institute of Electrical and Electronics Engineers, 2010. 5712598 (Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010).

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (ISBN)

TY - GEN

T1 - A SAL based algorithm for convex optimization problems

AU - Mishra, Amit Kumar

PY - 2010/12/17

Y1 - 2010/12/17

N2 - 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.

AB - 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.

KW - Iterative optimization

KW - Quadratic objective function

UR - https://www.scopus.com/pages/publications/79952473615

U2 - 10.1109/INDCON.2010.5712598

DO - 10.1109/INDCON.2010.5712598

M3 - Conference Proceeding (ISBN)

AN - SCOPUS:79952473615

SN - 978-1-4244-9072-1

T3 - Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010

BT - Proceedings of the 2010 Annual IEEE India Conference

PB - Institute of Electrical and Electronics Engineers

T2 - 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010

Y2 - 17 December 2010 through 19 December 2010

ER -

Mishra AK. A SAL based algorithm for convex optimization problems. Yn Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010. Institute of Electrical and Electronics Engineers. 2010. 5712598. (Proceedings of the 2010 Annual IEEE India Conference: Green Energy, Computing and Communication, INDICON 2010). doi: 10.1109/INDCON.2010.5712598

A SAL based algorithm for convex optimization problems

Crynodeb

Cyfres gyhoeddiadau

Cynhadledd

NDC y CU

Mynediad at Ddogfen

Cysylltiad parhaol

Ffeiliau eraill a chysylltiadau

Ôl bys

Dyfynnu hyn