Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

Language: English

You searched for subject:(Iterative optimization). Showing records 1 – 29 of 29 total matches.

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Ghana

1. Katsekpor, T. Iterative Methods for Large Scale Convex Optimization .

Degree: 2017, University of Ghana

 This thesis presents a detailed description and analysis of Bregman’s iterative method for convex programming with linear constraints. Row and block action methods for large… (more)

Subjects/Keywords: Iterative Methods; Large Scale Convex; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Katsekpor, T. (2017). Iterative Methods for Large Scale Convex Optimization . (Doctoral Dissertation). University of Ghana. Retrieved from http://ugspace.ug.edu.gh/handle/123456789/23393

Chicago Manual of Style (16th Edition):

Katsekpor, T. “Iterative Methods for Large Scale Convex Optimization .” 2017. Doctoral Dissertation, University of Ghana. Accessed June 18, 2019. http://ugspace.ug.edu.gh/handle/123456789/23393.

MLA Handbook (7th Edition):

Katsekpor, T. “Iterative Methods for Large Scale Convex Optimization .” 2017. Web. 18 Jun 2019.

Vancouver:

Katsekpor T. Iterative Methods for Large Scale Convex Optimization . [Internet] [Doctoral dissertation]. University of Ghana; 2017. [cited 2019 Jun 18]. Available from: http://ugspace.ug.edu.gh/handle/123456789/23393.

Council of Science Editors:

Katsekpor T. Iterative Methods for Large Scale Convex Optimization . [Doctoral Dissertation]. University of Ghana; 2017. Available from: http://ugspace.ug.edu.gh/handle/123456789/23393


University of Pennsylvania

2. Fazlyab, Mahyar. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.

Degree: 2018, University of Pennsylvania

 Recently, there has been a surge of interest in incorporating tools from dynamical systems and control theory to analyze and design iterative optimization algorithms. This… (more)

Subjects/Keywords: Iterative Algorithms; Numerical Optimization; Robust Control; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fazlyab, M. (2018). Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3066

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Thesis, University of Pennsylvania. Accessed June 18, 2019. https://repository.upenn.edu/edissertations/3066.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Web. 18 Jun 2019.

Vancouver:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2019 Jun 18]. Available from: https://repository.upenn.edu/edissertations/3066.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3066

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New South Wales

3. Hosseini, Mohammadreza. User guided biomedical image segmentation and usable interfaces.

Degree: Computer Science & Engineering, 2016, University of New South Wales

 The ability to measure objects boundary and dimensions in medical and biomedical images and to assure a safe interaction with these image in the experimental… (more)

Subjects/Keywords: Usability; HCI; Image Segmentation; Iterative optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hosseini, M. (2016). User guided biomedical image segmentation and usable interfaces. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/56398 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40663/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Hosseini, Mohammadreza. “User guided biomedical image segmentation and usable interfaces.” 2016. Doctoral Dissertation, University of New South Wales. Accessed June 18, 2019. http://handle.unsw.edu.au/1959.4/56398 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40663/SOURCE02?view=true.

MLA Handbook (7th Edition):

Hosseini, Mohammadreza. “User guided biomedical image segmentation and usable interfaces.” 2016. Web. 18 Jun 2019.

Vancouver:

Hosseini M. User guided biomedical image segmentation and usable interfaces. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2019 Jun 18]. Available from: http://handle.unsw.edu.au/1959.4/56398 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40663/SOURCE02?view=true.

Council of Science Editors:

Hosseini M. User guided biomedical image segmentation and usable interfaces. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/56398 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40663/SOURCE02?view=true


Texas A&M University

4. Oehler, Stephen Daniel. Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures.

Degree: 2012, Texas A&M University

 The past twenty years have seen the successful characterization and computational modeling efforts by the smart materials community to better understand the Shape Memory Alloy… (more)

Subjects/Keywords: Shape Memory Alloys; Design; Optimization; Iterative Analysis; Constitutive Model; Morphing; Aerostructure; Fluid Structure Interaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oehler, S. D. (2012). Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11440

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oehler, Stephen Daniel. “Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures.” 2012. Thesis, Texas A&M University. Accessed June 18, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11440.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oehler, Stephen Daniel. “Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures.” 2012. Web. 18 Jun 2019.

Vancouver:

Oehler SD. Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11440.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oehler SD. Developing Methods For Designing Shape Memory Alloy Actuated Morphing Aerostructures. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11440

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

5. Chen, Yen-Ling. Iterative Methods for Minimization Problems over Fixed Point Sets.

Degree: Master, Applied Mathematics, 2011, NSYSU

 In this paper we study through iterative methods the minimization problem minx∈C Î(x) (P) where the set C of constraints is the set of fixed… (more)

Subjects/Keywords: Halpern's algorithm; demiclosedness principle; hybrid method; quadratic optimization; strongly monotone; monotone mapping; projection; iterative method; fixed point; nonexpansive mapping; Minimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, Y. (2011). Iterative Methods for Minimization Problems over Fixed Point Sets. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602111-000058

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Yen-Ling. “Iterative Methods for Minimization Problems over Fixed Point Sets.” 2011. Thesis, NSYSU. Accessed June 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602111-000058.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Yen-Ling. “Iterative Methods for Minimization Problems over Fixed Point Sets.” 2011. Web. 18 Jun 2019.

Vancouver:

Chen Y. Iterative Methods for Minimization Problems over Fixed Point Sets. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Jun 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602111-000058.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen Y. Iterative Methods for Minimization Problems over Fixed Point Sets. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602111-000058

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Toth, William Justin. Structure in Stable Matching Problems.

Degree: 2016, University of Waterloo

 In this thesis we provide two contributions to the study of structure in stable matching problems. The first contribution is a short new proof for… (more)

Subjects/Keywords: Stable Matching; Iterative Rounding; Combinatorial Optimization

…results. The earliest known use of iterative rounding for exact optimization problems was given… …2 - Iterative Algorithm Let CP be a combinatorial optimization problem on ground set E… …3]. For those without a complexity background, an optimization problem being N P… …inspired by the common paradigm of iterative rounding [33], yet takes a slightly… …They will also learn about linear programming and the methods of iterative rounding, and… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Toth, W. J. (2016). Structure in Stable Matching Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11099

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Toth, William Justin. “Structure in Stable Matching Problems.” 2016. Thesis, University of Waterloo. Accessed June 18, 2019. http://hdl.handle.net/10012/11099.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Toth, William Justin. “Structure in Stable Matching Problems.” 2016. Web. 18 Jun 2019.

Vancouver:

Toth WJ. Structure in Stable Matching Problems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10012/11099.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Toth WJ. Structure in Stable Matching Problems. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/11099

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

7. Bao, Yijun. Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms.

Degree: PhD, Electrical and Computer Engineering, 2019, Georgia Tech

 The object of this thesis is to develop and generalize quantitative phase imaging (QPI) methods to enable their more widespread use and their application to… (more)

Subjects/Keywords: Phase imaging; Optical transfer function; Transfer function inversion; Deconvolution; Fiber Bragg grating; Iterative optimization; Nonparaxial; Annular illumination

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bao, Y. (2019). Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61282

Chicago Manual of Style (16th Edition):

Bao, Yijun. “Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms.” 2019. Doctoral Dissertation, Georgia Tech. Accessed June 18, 2019. http://hdl.handle.net/1853/61282.

MLA Handbook (7th Edition):

Bao, Yijun. “Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms.” 2019. Web. 18 Jun 2019.

Vancouver:

Bao Y. Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/1853/61282.

Council of Science Editors:

Bao Y. Theory, Development, and Application of Quantitative Phase Imaging Modalities on Standard Microscope Platforms. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61282

8. D'Alves, Curtis. A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value.

Degree: MSc, 2016, McMaster University

A scaled gradient descent method for competition of applications of conjugate gradient with priori estimations of the minimum value

This research proposes a novel method… (more)

Subjects/Keywords: Unconstrained Continuous Optimization; Conjugate Gradient; Gradient Descent; Iterative Optimization

…an iterative method for unconstrained optimization that takes an initial point x0 and… …Well-known non-linear, unconstrained continuous optimization methods such as QuasiNewton… …value of the minimum value of f (x). The goal of an optimization method is to locate… …without reconstructing the image. Iterative methods like conjugate gradient (CG) have… …T ri ri di+1 = ri+1 + Bi+1 di 1.4 Line Search A line search is an iterative method for… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

D'Alves, C. (2016). A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/20893

Chicago Manual of Style (16th Edition):

D'Alves, Curtis. “A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value.” 2016. Masters Thesis, McMaster University. Accessed June 18, 2019. http://hdl.handle.net/11375/20893.

MLA Handbook (7th Edition):

D'Alves, Curtis. “A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value.” 2016. Web. 18 Jun 2019.

Vancouver:

D'Alves C. A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value. [Internet] [Masters thesis]. McMaster University; 2016. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/11375/20893.

Council of Science Editors:

D'Alves C. A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value. [Masters Thesis]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/20893


University of Florida

9. Tang, Yen Thi. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Florida

 In this dissertation, we construct algorithms to solve  a class of mixed-integer bilevel min-max optimization problems, with applications to knapsack, clique, and  evacuation problems. These… (more)

Subjects/Keywords: Algorithms; Boxes; Disasters; Emergency evacuations; Integers; Iterative solutions; Linear programming; Mathematical models; Operations research; Optimal solutions; bilevel  – evacuation  – interdiction  – mixed-integer  – network  – optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tang, Y. T. (2014). A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046155

Chicago Manual of Style (16th Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Doctoral Dissertation, University of Florida. Accessed June 18, 2019. http://ufdc.ufl.edu/UFE0046155.

MLA Handbook (7th Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Web. 18 Jun 2019.

Vancouver:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Jun 18]. Available from: http://ufdc.ufl.edu/UFE0046155.

Council of Science Editors:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0046155


University of Lund

10. Ghazaei, Mahdi. On Trajectory Generation for Robots.

Degree: 2016, University of Lund

 A fundamental problem in robotics is the generation of motion for a task. How to translate a task to a set of movements is a… (more)

Subjects/Keywords: Robotteknik och automation; Reglerteknik; Haptic Interface; Fixed-Time Point-to-Point Trajectory Generation; Online Trajectory Generation; Dynamic Simulation and Optimization; Dynamics with Varying Contacts; Iterative Learning Control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghazaei, M. (2016). On Trajectory Generation for Robots. (Doctoral Dissertation). University of Lund. Retrieved from http://lup.lub.lu.se/record/a17ad6f3-1e6b-4209-ae9f-92a6d80ed994 ; http://portal.research.lu.se/ws/files/17350248/thesis_mahdi_v161115.pdf

Chicago Manual of Style (16th Edition):

Ghazaei, Mahdi. “On Trajectory Generation for Robots.” 2016. Doctoral Dissertation, University of Lund. Accessed June 18, 2019. http://lup.lub.lu.se/record/a17ad6f3-1e6b-4209-ae9f-92a6d80ed994 ; http://portal.research.lu.se/ws/files/17350248/thesis_mahdi_v161115.pdf.

MLA Handbook (7th Edition):

Ghazaei, Mahdi. “On Trajectory Generation for Robots.” 2016. Web. 18 Jun 2019.

Vancouver:

Ghazaei M. On Trajectory Generation for Robots. [Internet] [Doctoral dissertation]. University of Lund; 2016. [cited 2019 Jun 18]. Available from: http://lup.lub.lu.se/record/a17ad6f3-1e6b-4209-ae9f-92a6d80ed994 ; http://portal.research.lu.se/ws/files/17350248/thesis_mahdi_v161115.pdf.

Council of Science Editors:

Ghazaei M. On Trajectory Generation for Robots. [Doctoral Dissertation]. University of Lund; 2016. Available from: http://lup.lub.lu.se/record/a17ad6f3-1e6b-4209-ae9f-92a6d80ed994 ; http://portal.research.lu.se/ws/files/17350248/thesis_mahdi_v161115.pdf


University of KwaZulu-Natal

11. Jolaoso, Lateef Olakunle. Iterative methods for approximating solutions of certain optimization problems and fixed points problems.

Degree: 2017, University of KwaZulu-Natal

Abstract available in PDF file. Advisors/Committee Members: Mewomo, Oluwatosin Tope. (advisor).

Subjects/Keywords: Theses - Pure Mathematics.; Hilbert space.; Banach space.; Iterative methods.; Optimization problems.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jolaoso, L. O. (2017). Iterative methods for approximating solutions of certain optimization problems and fixed points problems. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15562

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jolaoso, Lateef Olakunle. “Iterative methods for approximating solutions of certain optimization problems and fixed points problems.” 2017. Thesis, University of KwaZulu-Natal. Accessed June 18, 2019. http://hdl.handle.net/10413/15562.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jolaoso, Lateef Olakunle. “Iterative methods for approximating solutions of certain optimization problems and fixed points problems.” 2017. Web. 18 Jun 2019.

Vancouver:

Jolaoso LO. Iterative methods for approximating solutions of certain optimization problems and fixed points problems. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10413/15562.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jolaoso LO. Iterative methods for approximating solutions of certain optimization problems and fixed points problems. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15562

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Liu, Taoming. A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE.

Degree: PhD, EECS - Electrical Engineering, 2017, Case Western Reserve University School of Graduate Studies

 This thesis focuses on design, modeling, and analysis of a magnetically actuated robotic intravascular catheter for performing atrial fibrillation ablation under magnetic resonance imaging guidance.… (more)

Subjects/Keywords: Robotics; Robots; Robotic Catheter; Magnetically-Actuated Catheter; Atrial Fibrillation Ablation; Real-time MRI Guidance; Robotic Intravascular Catheter; Catheter Deflection Model; Iterative Inverse Kinematics; Catheter-Surface Contact Model; Catheter Design Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, T. (2017). A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE. (Doctoral Dissertation). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1484654444253783

Chicago Manual of Style (16th Edition):

Liu, Taoming. “A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE.” 2017. Doctoral Dissertation, Case Western Reserve University School of Graduate Studies. Accessed June 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1484654444253783.

MLA Handbook (7th Edition):

Liu, Taoming. “A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE.” 2017. Web. 18 Jun 2019.

Vancouver:

Liu T. A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE. [Internet] [Doctoral dissertation]. Case Western Reserve University School of Graduate Studies; 2017. [cited 2019 Jun 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1484654444253783.

Council of Science Editors:

Liu T. A MAGNETICALLY-ACTUATED ROBOTIC CATHETER FOR ATRIAL FIBRILLATION ABLATION UNDER REAL-TIME MAGNETIC RESONANCE IMAGING GUIDANCE. [Doctoral Dissertation]. Case Western Reserve University School of Graduate Studies; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1484654444253783


Universiteit Utrecht

13. Bossum, M.A. van. Semidefinite optimization, a spectral approach.

Degree: 2002, Universiteit Utrecht

 This thesis is about mathematical optimization. Mathematical optimization involves the construction of methods to solve optimization problems, which can arise from real-life problems in applied… (more)

Subjects/Keywords: Wiskunde en Informatica; eigenvalue optimization; semidefinite programming; convex optimization; iterative methods; subspace methods; Newton methods; large-scale problems; spectral method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bossum, M. A. v. (2002). Semidefinite optimization, a spectral approach. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/867

Chicago Manual of Style (16th Edition):

Bossum, M A van. “Semidefinite optimization, a spectral approach.” 2002. Doctoral Dissertation, Universiteit Utrecht. Accessed June 18, 2019. http://dspace.library.uu.nl:8080/handle/1874/867.

MLA Handbook (7th Edition):

Bossum, M A van. “Semidefinite optimization, a spectral approach.” 2002. Web. 18 Jun 2019.

Vancouver:

Bossum MAv. Semidefinite optimization, a spectral approach. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2002. [cited 2019 Jun 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/867.

Council of Science Editors:

Bossum MAv. Semidefinite optimization, a spectral approach. [Doctoral Dissertation]. Universiteit Utrecht; 2002. Available from: http://dspace.library.uu.nl:8080/handle/1874/867

14. Fassi, Imen. XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles.

Degree: Docteur es, Informatique, 2015, Université de Strasbourg

Nous proposons une nouvelle structure de programmation appelée XFOR (Multifor), dédiée à la programmation orientée réutilisation de données. XFOR permet de gérer simultanément plusieurs boucles… (more)

Subjects/Keywords: Xfor; Structure itérative; Programmation parallèle; Modèle polyédrique; Optimization de boucles; Transformation de boucles; Localité de données; Génération de code; Xfor; Iterative structure; Parallel programming; Polyhedral model; Loop optimization; Loop transformation; Data locality; Code generation; 005.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fassi, I. (2015). XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles. (Doctoral Dissertation). Université de Strasbourg. Retrieved from http://www.theses.fr/2015STRAD043

Chicago Manual of Style (16th Edition):

Fassi, Imen. “XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles.” 2015. Doctoral Dissertation, Université de Strasbourg. Accessed June 18, 2019. http://www.theses.fr/2015STRAD043.

MLA Handbook (7th Edition):

Fassi, Imen. “XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles.” 2015. Web. 18 Jun 2019.

Vancouver:

Fassi I. XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles. [Internet] [Doctoral dissertation]. Université de Strasbourg; 2015. [cited 2019 Jun 18]. Available from: http://www.theses.fr/2015STRAD043.

Council of Science Editors:

Fassi I. XFOR (Multifor) : A new programming structure to ease the formulation of efficient loop optimizations : XFOR (Multifor) : nouvelle structure de programmation pour faciliter la formulation des optimisations efficaces de boucles. [Doctoral Dissertation]. Université de Strasbourg; 2015. Available from: http://www.theses.fr/2015STRAD043

15. Bossum, M.A. van. Semidefinite optimization, a spectral approach.

Degree: 2002, University Utrecht

 This thesis is about mathematical optimization. Mathematical optimization involves the construction of methods to solve optimization problems, which can arise from real-life problems in applied… (more)

Subjects/Keywords: eigenvalue optimization; semidefinite programming; convex optimization; iterative methods; subspace methods; Newton methods; large-scale problems; spectral method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bossum, M. A. v. (2002). Semidefinite optimization, a spectral approach. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/867 ; URN:NBN:NL:UI:10-1874-867 ; URN:NBN:NL:UI:10-1874-867 ; http://dspace.library.uu.nl/handle/1874/867

Chicago Manual of Style (16th Edition):

Bossum, M A van. “Semidefinite optimization, a spectral approach.” 2002. Doctoral Dissertation, University Utrecht. Accessed June 18, 2019. http://dspace.library.uu.nl/handle/1874/867 ; URN:NBN:NL:UI:10-1874-867 ; URN:NBN:NL:UI:10-1874-867 ; http://dspace.library.uu.nl/handle/1874/867.

MLA Handbook (7th Edition):

Bossum, M A van. “Semidefinite optimization, a spectral approach.” 2002. Web. 18 Jun 2019.

Vancouver:

Bossum MAv. Semidefinite optimization, a spectral approach. [Internet] [Doctoral dissertation]. University Utrecht; 2002. [cited 2019 Jun 18]. Available from: http://dspace.library.uu.nl/handle/1874/867 ; URN:NBN:NL:UI:10-1874-867 ; URN:NBN:NL:UI:10-1874-867 ; http://dspace.library.uu.nl/handle/1874/867.

Council of Science Editors:

Bossum MAv. Semidefinite optimization, a spectral approach. [Doctoral Dissertation]. University Utrecht; 2002. Available from: http://dspace.library.uu.nl/handle/1874/867 ; URN:NBN:NL:UI:10-1874-867 ; URN:NBN:NL:UI:10-1874-867 ; http://dspace.library.uu.nl/handle/1874/867


Georgia Tech

16. O'Neal, Jerome W. The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics.

Degree: PhD, Industrial and Systems Engineering, 2005, Georgia Tech

 Over the last 25 years, interior-point methods (IPMs) have emerged as a viable class of algorithms for solving various forms of conic optimization problems. Most… (more)

Subjects/Keywords: Maximum weight basis preconditioner; Iterative solvers; Inexact search directions; Adaptive preconditioning; Conjugate gradient; Interior-point methods; Conjugate gradient methods; Interior-point methods; Iterative methods (Mathematics); Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O'Neal, J. W. (2005). The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/11647

Chicago Manual of Style (16th Edition):

O'Neal, Jerome W. “The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics.” 2005. Doctoral Dissertation, Georgia Tech. Accessed June 18, 2019. http://hdl.handle.net/1853/11647.

MLA Handbook (7th Edition):

O'Neal, Jerome W. “The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics.” 2005. Web. 18 Jun 2019.

Vancouver:

O'Neal JW. The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/1853/11647.

Council of Science Editors:

O'Neal JW. The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/11647


Delft University of Technology

17. Markovinovic, R. System-Theoretical Model Reduction for Reservoir Simulation and optimization.

Degree: 2009, Delft University of Technology

 This thesis is concerned with low-order modelling of heterogeneous reservoir systems for the purpose of efficient simulation and optimization of flooding processes with multiple injection… (more)

Subjects/Keywords: petroleum; reservoir engineering; systems and control theory; model reduction; simulation-optimization; iterative numerical analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Markovinovic, R. (2009). System-Theoretical Model Reduction for Reservoir Simulation and optimization. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a

Chicago Manual of Style (16th Edition):

Markovinovic, R. “System-Theoretical Model Reduction for Reservoir Simulation and optimization.” 2009. Doctoral Dissertation, Delft University of Technology. Accessed June 18, 2019. http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a.

MLA Handbook (7th Edition):

Markovinovic, R. “System-Theoretical Model Reduction for Reservoir Simulation and optimization.” 2009. Web. 18 Jun 2019.

Vancouver:

Markovinovic R. System-Theoretical Model Reduction for Reservoir Simulation and optimization. [Internet] [Doctoral dissertation]. Delft University of Technology; 2009. [cited 2019 Jun 18]. Available from: http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a.

Council of Science Editors:

Markovinovic R. System-Theoretical Model Reduction for Reservoir Simulation and optimization. [Doctoral Dissertation]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; urn:NBN:nl:ui:24-uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a ; http://resolver.tudelft.nl/uuid:6879a75b-ac5c-4ebd-b4ac-d958fa03003a


Pontifical Catholic University of Rio de Janeiro

18. REGIS SANTOS THEDIN. [en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES.

Degree: 2019, Pontifical Catholic University of Rio de Janeiro

[pt] A otimização topológica tem se desenvolvido bastante e possui potencial para revolucionar diversas áreas da engenharia. Este método pode ser implementado a partir de… (more)

Subjects/Keywords: [pt] METODO DOS ELEMENTOS FINITOS; [en] FINITE ELEMENT METHOD; [pt] OTIMIZACAO TOPOLOGICA; [en] TOPOLOGY OPTIMIZATION; [pt] DIAGRAMA DE VORONOI; [en] VORONOI DIAGRAMS; [pt] MALHAS POLIEDRICAS; [en] POLYHEDRAL MESHES; [pt] METODOS DIRETOS E ITERATIVOS; [en] DIRECT AND ITERATIVE SOLVERS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

THEDIN, R. S. (2019). [en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

THEDIN, REGIS SANTOS. “[en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES.” 2019. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed June 18, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

THEDIN, REGIS SANTOS. “[en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES.” 2019. Web. 18 Jun 2019.

Vancouver:

THEDIN RS. [en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. [cited 2019 Jun 18]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

THEDIN RS. [en] TOPOLOGY OPTIMIZATION USING POLYHEDRAL MESHES. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Florida

19. Hsiao, Chao-Wei, 1965-. A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations.

Degree: PhD, Mechanical Engineering, 2001, University of Florida

Subjects/Keywords: Algorithms; Design engineering; Design optimization; Frequency ranges; Iterative solutions; Linear programming; Mass; Natural frequencies; Structural design; Trusses

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hsiao, Chao-Wei, 1. (2001). A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00039137

Chicago Manual of Style (16th Edition):

Hsiao, Chao-Wei, 1965-. “A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations.” 2001. Doctoral Dissertation, University of Florida. Accessed June 18, 2019. http://ufdc.ufl.edu/AA00039137.

MLA Handbook (7th Edition):

Hsiao, Chao-Wei, 1965-. “A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations.” 2001. Web. 18 Jun 2019.

Vancouver:

Hsiao, Chao-Wei 1. A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations. [Internet] [Doctoral dissertation]. University of Florida; 2001. [cited 2019 Jun 18]. Available from: http://ufdc.ufl.edu/AA00039137.

Council of Science Editors:

Hsiao, Chao-Wei 1. A generalized procedure for the optimum design of large-scale truss structures subjected to harmonic excitations. [Doctoral Dissertation]. University of Florida; 2001. Available from: http://ufdc.ufl.edu/AA00039137

20. Deest, Gaël. Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA.

Degree: Docteur es, Informatique, 2017, Rennes 1

L'accélération matérielle désigne l'utilisation d'architectures spécialisées pour effectuer certaines tâches plus vite ou plus efficacement que sur du matériel générique. Les accélérateurs ont traditionnellement été… (more)

Subjects/Keywords: FPGA; Accélérateurs matériels; Optimisation des largeurs; Conversion flottantvers fixe; Analyse de précision; Stencils itératifs; Synthèse de haut niveau; Modèles de performance; FPGA; Hardware Accelerators; Wordlength Optimization; Floating-Point to fixed-Point conversion; Accuracy Analysis; Iterative Stencil Computations; High-Level Synthesis; Performance Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Deest, G. (2017). Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2017REN1S102

Chicago Manual of Style (16th Edition):

Deest, Gaël. “Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA.” 2017. Doctoral Dissertation, Rennes 1. Accessed June 18, 2019. http://www.theses.fr/2017REN1S102.

MLA Handbook (7th Edition):

Deest, Gaël. “Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA.” 2017. Web. 18 Jun 2019.

Vancouver:

Deest G. Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA. [Internet] [Doctoral dissertation]. Rennes 1; 2017. [cited 2019 Jun 18]. Available from: http://www.theses.fr/2017REN1S102.

Council of Science Editors:

Deest G. Implementation trade-offs for FGPA accelerators : Compromis pour l'implémentation d'accélérateurs sur FPGA. [Doctoral Dissertation]. Rennes 1; 2017. Available from: http://www.theses.fr/2017REN1S102

21. Kim, Donghwan. Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction.

Degree: PhD, Electrical Engineering: Systems, 2014, University of Michigan

 X-ray computed tomography (CT) has been widely celebrated for its ability to visualize patient anatomy, but increasing radiation exposure to patients is a concern. Statistical… (more)

Subjects/Keywords: Computed Tomography, Statistical Image Reconstruction, Optimization Algorithms, Iterative Algorithms, Ordered Subsets, Gradient Methods; Electrical Engineering; Engineering

…xii ICD Iterative coordinate descent IOT Incremental optimization transfer NH Non… …Optimization algorithms in X-ray CT problem Many iterative algorithms have been applied and… …methods OS Ordered subsets OT Optimization transfer PCG Preconditioned conjugated gradient PEP… …ACCELERATED OPTIMIZATION ALGORITHMS FOR STATISTICAL 3D X-RAY COMPUTED TOMOGRAPHY IMAGE… …iterative algorithms for statistical reconstruction that converge within fewer iterations and that… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, D. (2014). Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/109007

Chicago Manual of Style (16th Edition):

Kim, Donghwan. “Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction.” 2014. Doctoral Dissertation, University of Michigan. Accessed June 18, 2019. http://hdl.handle.net/2027.42/109007.

MLA Handbook (7th Edition):

Kim, Donghwan. “Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction.” 2014. Web. 18 Jun 2019.

Vancouver:

Kim D. Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2027.42/109007.

Council of Science Editors:

Kim D. Accelerated Optimization Algorithms for Statistical 3D X-ray Computed Tomography Image Reconstruction. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/109007

22. MEDURI VENKATA VAMSIKRISHNA. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.

Degree: 2011, National University of Singapore

Subjects/Keywords: Databases; Complex Query optimization; Iterative Dynamic Programming; Sub query plan reuse; Cover set generation; Sub graph isomorphism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

VAMSIKRISHNA, M. V. (2011). Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/20999

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Thesis, National University of Singapore. Accessed June 18, 2019. http://scholarbank.nus.edu.sg/handle/10635/20999.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Web. 18 Jun 2019.

Vancouver:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2019 Jun 18]. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Lihv, Nathalie. Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment.

Degree: Industrial Engineering & Management, 2017, Uppsala University

  Due to increasing competitiveness, manufacturing industries are facing a great amountof pressure to optimize their production. One of the first sectors affected by thisphenomenon… (more)

Subjects/Keywords: Optimization; Return of Investment; IT-application; metal producer; manufacturing; iterative; progressing; Computer and Information Sciences; Data- och informationsvetenskap

Optimization model sending trial solutions to the simulation model that later on evaluates its… …9 Figure 4. Optimization model sending trial solutions to the simulation model that later… …simulation of optimization… …41 Figure 24. Suggestion over an ideal optimization… …idea behind the process of optimization is the improvement of the manufacturing companies… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lihv, N. (2017). Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-328444

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lihv, Nathalie. “Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment.” 2017. Thesis, Uppsala University. Accessed June 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-328444.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lihv, Nathalie. “Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment.” 2017. Web. 18 Jun 2019.

Vancouver:

Lihv N. Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment. [Internet] [Thesis]. Uppsala University; 2017. [cited 2019 Jun 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-328444.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lihv N. Optimizing the production process of a metal producer : A case study of how to develop an IT-application intended to improve the Return of Investment. [Thesis]. Uppsala University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-328444

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


EPFL

24. Bourquard, Aurélien. Compressed Optical Imaging.

Degree: 2013, EPFL

Subjects/Keywords: compressed sensing; digital holography; generalized sampling theory; image interpolation; image reconstruction; inverse problems; iterative algorithms; multigrid optimization; partial differential equations; phase retrieval; quantization; regularization; variational methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bourquard, A. (2013). Compressed Optical Imaging. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/191172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bourquard, Aurélien. “Compressed Optical Imaging.” 2013. Thesis, EPFL. Accessed June 18, 2019. http://infoscience.epfl.ch/record/191172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bourquard, Aurélien. “Compressed Optical Imaging.” 2013. Web. 18 Jun 2019.

Vancouver:

Bourquard A. Compressed Optical Imaging. [Internet] [Thesis]. EPFL; 2013. [cited 2019 Jun 18]. Available from: http://infoscience.epfl.ch/record/191172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bourquard A. Compressed Optical Imaging. [Thesis]. EPFL; 2013. Available from: http://infoscience.epfl.ch/record/191172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Netrapalli, Praneeth Kumar. Provable alternating minimization for non-convex learning problems.

Degree: Electrical and Computer Engineering, 2014, University of Texas – Austin

 Alternating minimization (AltMin) is a generic term for a widely popular approach in non-convex learning: often, it is possible to partition the variables into two… (more)

Subjects/Keywords: Alternating minimization; Alternating least squares; Matrix completion; Phase retrieval; Dictionary learning; Sparse dictionaries; Iterative methods; Non-convex optimization

…sparsity, low-rank etc. arise naturally. When posed as optimization problems, most of these… …due to the need to store and update the entire matrix, and because iterative methods for… …optimization problem: min A(U V ) − b 2 2 U ∈Rm×k ,V ∈Rn×k As mentioned earlier… …existing iterative methods for trace-norm 1 minimization all of which require at least O(… …optimization, as our result has |Ω| depend on the condition number, required accuracy (ǫ)… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Netrapalli, P. K. (2014). Provable alternating minimization for non-convex learning problems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Netrapalli, Praneeth Kumar. “Provable alternating minimization for non-convex learning problems.” 2014. Thesis, University of Texas – Austin. Accessed June 18, 2019. http://hdl.handle.net/2152/25931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Netrapalli, Praneeth Kumar. “Provable alternating minimization for non-convex learning problems.” 2014. Web. 18 Jun 2019.

Vancouver:

Netrapalli PK. Provable alternating minimization for non-convex learning problems. [Internet] [Thesis]. University of Texas – Austin; 2014. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2152/25931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Netrapalli PK. Provable alternating minimization for non-convex learning problems. [Thesis]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/25931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Nien, Hung. Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods.

Degree: PhD, Electrical Engineering: Systems, 2014, University of Michigan

 Model-based image reconstruction (MBIR) is a powerful technique for solving ill-posed inverse problems. Compared with direct methods, it can provide better estimates from noisy measurements… (more)

Subjects/Keywords: Model-based X-ray CT Image Reconstruction; Convex Optimization; Iterative Algorithm; Augmented Lagrangian; Variable Splitting; Electrical Engineering; Engineering

optimization technique called variable splitting based on the augmented Lagrangian (AL)… …field reconstruction problem using a splitting- 2 based algorithm with non-iterative… …with some advance convex optimization algorithms in this thesis. 2.2.1 Gradient-based… …convex optimization method is called the optimization transfer method, the majorization… …problems precludes optimization by conventional gradient-based methods. They become more popular… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nien, H. (2014). Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108981

Chicago Manual of Style (16th Edition):

Nien, Hung. “Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods.” 2014. Doctoral Dissertation, University of Michigan. Accessed June 18, 2019. http://hdl.handle.net/2027.42/108981.

MLA Handbook (7th Edition):

Nien, Hung. “Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods.” 2014. Web. 18 Jun 2019.

Vancouver:

Nien H. Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2027.42/108981.

Council of Science Editors:

Nien H. Model-based X-ray CT Image and Light Field Reconstruction Using Variable Splitting Methods. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108981

27. Li, Wei. Automatic Foreground Initialization for Binary Image Segmentation.

Degree: 2012, University of Western Ontario

 Foreground segmentation is a fundamental problem in computer vision. A popular approach for foreground extraction is through graph cuts in energy minimization framework. Most existing… (more)

Subjects/Keywords: image features; graph cuts; discrete optimization; object detection; automatic segmentation; iterative energy minimization; Artificial Intelligence and Robotics; Graphics and Human Computer Interfaces

…Segmentation using iterative graph cuts . . . . . . . . . . . . . . . . . . . . . . Segmentation… …foreground/background regions from the rectangular initialization and perform iterative… …works in the energy optimization framework. The task of binary image segmentation is posed as… …Figure 3.1 below shows the way to solve image segmentation problem in the energy optimization… …the optimization framework, there are two major steps, the formulation of energy function… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, W. (2012). Automatic Foreground Initialization for Binary Image Segmentation. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/1004

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Li, Wei. “Automatic Foreground Initialization for Binary Image Segmentation.” 2012. Thesis, University of Western Ontario. Accessed June 18, 2019. https://ir.lib.uwo.ca/etd/1004.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Li, Wei. “Automatic Foreground Initialization for Binary Image Segmentation.” 2012. Web. 18 Jun 2019.

Vancouver:

Li W. Automatic Foreground Initialization for Binary Image Segmentation. [Internet] [Thesis]. University of Western Ontario; 2012. [cited 2019 Jun 18]. Available from: https://ir.lib.uwo.ca/etd/1004.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li W. Automatic Foreground Initialization for Binary Image Segmentation. [Thesis]. University of Western Ontario; 2012. Available from: https://ir.lib.uwo.ca/etd/1004

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Lockett, Alan Justin. General-purpose optimization through information maximization.

Degree: Computer Sciences, 2012, University of Texas – Austin

 The primary goal of artificial intelligence research is to develop a machine capable of learning to solve disparate real-world tasks autonomously, without relying on specialized… (more)

Subjects/Keywords: Optimization; General-purpose learning; Martingale optimization; Artificial intelligence; Evolutionary computation; Genetic algorithms; Simulated annealing; Evolutionary annealing; Neuroannealing; Neural networks; Neural network controllers; Neuroevolution; Differential evolution; No Free Lunch theorems; NFL Identification Theorem; Population-based stochastic optimization; Iterative optimization; Optimal optimization; Information-maximization principle; Convex control; Algorithm selection

…all possible iterative optimization methods by analyzing the sequence of proposed optima… …2.5 Stochastic Optimization . . . . . . . . . . . 2.5.1 Simulated Annealing… …Chapter 3. Functional Analysis of Optimization 3.1 Motivation… …144 4.3.1 Particle Swarm Optimization . . . . . . . . . . . . . . . 144 4.3.2 Differential… …ix 156 156 162 163 164 167 176 178 183 184 186 188 189 Chapter 6. The Optimization… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lockett, A. J. (2012). General-purpose optimization through information maximization. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5459

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lockett, Alan Justin. “General-purpose optimization through information maximization.” 2012. Thesis, University of Texas – Austin. Accessed June 18, 2019. http://hdl.handle.net/2152/ETD-UT-2012-05-5459.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lockett, Alan Justin. “General-purpose optimization through information maximization.” 2012. Web. 18 Jun 2019.

Vancouver:

Lockett AJ. General-purpose optimization through information maximization. [Internet] [Thesis]. University of Texas – Austin; 2012. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5459.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lockett AJ. General-purpose optimization through information maximization. [Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5459

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Ismailova, Darya. Localization algorithms for passive sensor networks.

Degree: Department of Electrical and Computer Engineering, 2017, University of Victoria

 Locating a radiating source based on range or range measurements obtained from a network of passive sensors has been a subject of research over the… (more)

Subjects/Keywords: least squares;

…Development of an iterative re-weighting algorithm for range-based localization based on squared… …range-based least squares; • Development of a iterative re-weighting algorithm for range… …Iterative Re-Weighting Least-Squares Methods for Source Localization This chapter presents… …improved least squares methods that are iterative in nature. At each iteration the algorithms… …suggests several problems for future studies in the area. 9 Chapter 2 Iterative Re-Weighting… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ismailova, D. (2017). Localization algorithms for passive sensor networks. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7747

Chicago Manual of Style (16th Edition):

Ismailova, Darya. “Localization algorithms for passive sensor networks.” 2017. Masters Thesis, University of Victoria. Accessed June 18, 2019. http://hdl.handle.net/1828/7747.

MLA Handbook (7th Edition):

Ismailova, Darya. “Localization algorithms for passive sensor networks.” 2017. Web. 18 Jun 2019.

Vancouver:

Ismailova D. Localization algorithms for passive sensor networks. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/1828/7747.

Council of Science Editors:

Ismailova D. Localization algorithms for passive sensor networks. [Masters Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/7747

.