default search action
Farzin Taringoo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j6]Farzin Taringoo, Peter M. Dower, Dragan Nesic, Ying Tan:
Optimization Methods on Riemannian Manifolds via Extremum Seeking Algorithms. SIAM J. Control. Optim. 56(5): 3867-3892 (2018) - 2017
- [j5]Farzin Taringoo:
Synchronization on Lie Groups: Coordination of Blind Agents. IEEE Trans. Autom. Control. 62(12): 6324-6338 (2017) - 2015
- [c14]Farzin Taringoo, Dragan Nesic
, Peter M. Dower, Ying Tan
Coordination of blind agents on Lie groups. CDC 2015: 7256-7261 - 2014
- [c13]Farzin Taringoo, Dragan Nesic
Extremum seeking control for nonlinear systems on compact Riemannian manifolds. CDC 2014: 2667-2672 - 2013
- [j4]Farzin Taringoo, Peter E. Caines:
On the Optimal Control of Impulsive Hybrid Systems on Riemannian Manifolds. SIAM J. Control. Optim. 51(4): 3127-3153 (2013) - [c12]Farzin Taringoo, Dragan Nesic
Closeness of solutions and averaging for nonlinear systems on Riemannian manifolds. AuCC 2013: 47-52 - [c11]Farzin Taringoo, Dragan Nesic
Averaging for nonlinear systems on Riemannian manifolds. CDC 2013: 654-659 - [c10]Farzin Taringoo, Peter E. Caines:
On the optimal control of hybrid systems on Lie groups and the exponential gradient HMP algorithm. CDC 2013: 2653-2658 - 2012
- [c9]Farzin Taringoo, Peter E. Caines:
The Exponential Gradient HMP Algorithm for the Optimization of Hybrid Systems On Lie Groups. ADHS 2012: 33-38 - [c8]Farzin Taringoo, Peter E. Caines:
On an extension of the Hybrid Minimum Principle to systems on Lie groups. ACC 2012: 4534-4539 - [c7]Farzin Taringoo, Peter E. Caines:
Newton-Geodesic HMP algorithms for the optimization of hybrid systems and the geometric properties of hybrid value functions. CDC 2012: 4211-4216 - 2011
- [j3]Farzin Taringoo, Peter E. Caines:
Gradient geodesic and Newton geodesic HMP algorithms for the optimization of hybrid systems. Annu. Rev. Control. 35(2): 187-198 (2011) - [c6]Farzin Taringoo, Peter E. Caines:
On the extension of the hybrid minimum principle to Riemannian manifolds. CDC/ECC 2011: 3301-3306 - 2010
- [c5]Farzin Taringoo, Peter E. Caines:
Gradient-geodesic HMP algorithms for the optimization of Hybrid systems based on the geometry of switching manifolds. CDC 2010: 1534-1539 - [c4]Farzin Taringoo, Peter E. Caines:
On the geometry of switching manifolds for autonomous hybrid systems. WODES 2010: 35-40
2000 – 2009
- 2009
- [c3]Farzin Taringoo, Peter E. Caines:
Geometrical Properties of Optimal Hybrid System Trajectories and the Optimization of Switching Manifolds. ADHS 2009: 310-315 - [c2]Farzin Taringoo, Peter E. Caines:
The Sensitivity of Hybrid Systems Optimal Cost Functions with Respect to Switching Manifold Parameters. HSCC 2009: 475-479 - 2006
- [j2]Farzin Taringoo, Javad Poshtan
Analysis of Effort Constraint Algorithm in Active Noise Control Systems. EURASIP J. Adv. Signal Process. 2006 (2006) - [j1]Farzin Taringoo, Javad Poshtan
Design of Decoupling Active Noise Control Systems. J. Circuits Syst. Comput. 15(4): 521-536 (2006) - 2003
- [c1]Javad Poshtan
Multichannel active noise control algorithm using align matrix. CCA 2003: 435-438
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: