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

You searched for subject:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic). Showing records 121 – 150 of 27563 total matches.

[1] [2] [3] [4] [5] [6] [7] … [919]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


San Jose State University

121. Zhou, Siqiong. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.

Degree: MS, Industrial and Systems Engineering, 2019, San Jose State University

  Wildland-urban interface wildfires have been a significant threat in many countries. This thesis presents an integer two-stage stochastic goal programming model for comprehensive, efficient… (more)

Subjects/Keywords: Goal programming; Stochastic programming; Wildfire management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, S. (2019). A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022

Chicago Manual of Style (16th Edition):

Zhou, Siqiong. “A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.” 2019. Masters Thesis, San Jose State University. Accessed November 14, 2019. https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022.

MLA Handbook (7th Edition):

Zhou, Siqiong. “A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.” 2019. Web. 14 Nov 2019.

Vancouver:

Zhou S. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. [Internet] [Masters thesis]. San Jose State University; 2019. [cited 2019 Nov 14]. Available from: https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022.

Council of Science Editors:

Zhou S. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. [Masters Thesis]. San Jose State University; 2019. Available from: https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022


Texas A&M University

122. Sundar, Kaarthik. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.

Degree: 2012, Texas A&M University

 Small Unmanned Aerial Vehicles (UAVs) are currently used in several surveillance applications to monitor a set of targets and collect relevant data. One of the… (more)

Subjects/Keywords: Motion planning; Resource constraints; Approximation algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sundar, K. (2012). Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694

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):

Sundar, Kaarthik. “Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.” 2012. Thesis, Texas A&M University. Accessed November 14, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694.

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

MLA Handbook (7th Edition):

Sundar, Kaarthik. “Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.” 2012. Web. 14 Nov 2019.

Vancouver:

Sundar K. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694.

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

Council of Science Editors:

Sundar K. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694

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


Virginia Tech

123. Wessels, Mariette Christine. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.

Degree: MS, Mathematics, 2017, Virginia Tech

 Given a set of n points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum… (more)

Subjects/Keywords: Minimum Weight Triangulation; Approximation Algorithm; Geometric Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wessels, M. C. (2017). A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77933

Chicago Manual of Style (16th Edition):

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Masters Thesis, Virginia Tech. Accessed November 14, 2019. http://hdl.handle.net/10919/77933.

MLA Handbook (7th Edition):

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Web. 14 Nov 2019.

Vancouver:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10919/77933.

Council of Science Editors:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/77933


Cornell University

124. Tong, Chaoxu. Some Resource Allocation Problems .

Degree: 2016, Cornell University

 We include three works on resource allocation in this thesis. Proper pricing helps the system to allocate resource efficiently. However, the computational efforts to obtain… (more)

Subjects/Keywords: Revenue Management; Approximation Algorithm; Resource Sharing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tong, C. (2016). Some Resource Allocation Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/43582

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):

Tong, Chaoxu. “Some Resource Allocation Problems .” 2016. Thesis, Cornell University. Accessed November 14, 2019. http://hdl.handle.net/1813/43582.

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

MLA Handbook (7th Edition):

Tong, Chaoxu. “Some Resource Allocation Problems .” 2016. Web. 14 Nov 2019.

Vancouver:

Tong C. Some Resource Allocation Problems . [Internet] [Thesis]. Cornell University; 2016. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1813/43582.

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

Council of Science Editors:

Tong C. Some Resource Allocation Problems . [Thesis]. Cornell University; 2016. Available from: http://hdl.handle.net/1813/43582

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


University of Illinois – Urbana-Champaign

125. Gupta, Shalmoli. Approximation algorithms for clustering and facility location problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

 In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P… (more)

Subjects/Keywords: Approximation Algorithm; Clustering; Facility Location; Submodular function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, S. (2018). Approximation algorithms for clustering and facility location problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102419

Chicago Manual of Style (16th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed November 14, 2019. http://hdl.handle.net/2142/102419.

MLA Handbook (7th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 14 Nov 2019.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/2142/102419.

Council of Science Editors:

Gupta S. Approximation algorithms for clustering and facility location problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102419


University of Waterloo

126. Koh, Zhuan Khye. Stabilizing Weighted Graphs.

Degree: 2017, University of Waterloo

 An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable… (more)

Subjects/Keywords: Matching; Game Theory; Network Bargaining; Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koh, Z. K. (2017). Stabilizing Weighted Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12246

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):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Thesis, University of Waterloo. Accessed November 14, 2019. http://hdl.handle.net/10012/12246.

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

MLA Handbook (7th Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Web. 14 Nov 2019.

Vancouver:

Koh ZK. Stabilizing Weighted Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10012/12246.

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

Council of Science Editors:

Koh ZK. Stabilizing Weighted Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12246

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


Michigan State University

127. Ruppert, David, 1948-. A new dynamic stochastic approximation procedure.

Degree: PhD, 1977, Michigan State University

Subjects/Keywords: Stochastic approximation; Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruppert, David, 1. (1977). A new dynamic stochastic approximation procedure. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:43624

Chicago Manual of Style (16th Edition):

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Doctoral Dissertation, Michigan State University. Accessed November 14, 2019. http://etd.lib.msu.edu/islandora/object/etd:43624.

MLA Handbook (7th Edition):

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Web. 14 Nov 2019.

Vancouver:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Internet] [Doctoral dissertation]. Michigan State University; 1977. [cited 2019 Nov 14]. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624.

Council of Science Editors:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Doctoral Dissertation]. Michigan State University; 1977. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624


University of Florida

128. Dang, Cong Dinh. Randomized First Order Methods for Convex and Nonconvex Optimization.

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

In this dissertation, we propose some first order methods for solving various problems of convex Advisors/Committee Members: LAN,GUANGHUI (committee chair), LAWPHONGPANICH,SIRIPHONG (committee member), XIA,YE (committee member).

Subjects/Keywords: Algorithms; Approximation; Convexity; Coordinate systems; Datasets; Machine learning; Mathematical programming; Random variables; Saddle points; Systems engineering; first  – methods  – order  – randomized

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dang, C. D. (2015). Randomized First Order Methods for Convex and Nonconvex Optimization. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046978

Chicago Manual of Style (16th Edition):

Dang, Cong Dinh. “Randomized First Order Methods for Convex and Nonconvex Optimization.” 2015. Doctoral Dissertation, University of Florida. Accessed November 14, 2019. http://ufdc.ufl.edu/UFE0046978.

MLA Handbook (7th Edition):

Dang, Cong Dinh. “Randomized First Order Methods for Convex and Nonconvex Optimization.” 2015. Web. 14 Nov 2019.

Vancouver:

Dang CD. Randomized First Order Methods for Convex and Nonconvex Optimization. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Nov 14]. Available from: http://ufdc.ufl.edu/UFE0046978.

Council of Science Editors:

Dang CD. Randomized First Order Methods for Convex and Nonconvex Optimization. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0046978


University of Edinburgh

129. Creed, Patrick John. Counting and sampling problems on Eulerian graphs.

Degree: PhD, 2010, University of Edinburgh

 In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eulerian orientations and Euler tours. We are interested in… (more)

Subjects/Keywords: 518; randomized algorithms; random graphs; computational complexity; combinatorics; Eulerian graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Creed, P. J. (2010). Counting and sampling problems on Eulerian graphs. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4759

Chicago Manual of Style (16th Edition):

Creed, Patrick John. “Counting and sampling problems on Eulerian graphs.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed November 14, 2019. http://hdl.handle.net/1842/4759.

MLA Handbook (7th Edition):

Creed, Patrick John. “Counting and sampling problems on Eulerian graphs.” 2010. Web. 14 Nov 2019.

Vancouver:

Creed PJ. Counting and sampling problems on Eulerian graphs. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1842/4759.

Council of Science Editors:

Creed PJ. Counting and sampling problems on Eulerian graphs. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/4759

130. He, Qie. Topics in discrete optimization: models, complexity and algorithms.

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

 In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split… (more)

Subjects/Keywords: Integer programming; Combinatorial optimization; Stochastic programming; Network flow; Production planning; Computational complexity; Mathematical optimization; Integer programming

…A max{1/2, k/n}-approximation algorithm is presented for the scenario-based SHP… …in the second stage is constant. A max{1/2, k/n}-approximation algorithm is… …understanding of each problem’s intrinsic complexity as well as the power and limits of the developed… …optimization problems through the perspectives of modeling, complexity and algorithms. Cutting planes… …the linear programming (LP) relaxation than a type 1 triangle cut viii for an… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, Q. (2013). Topics in discrete optimization: models, complexity and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50237

Chicago Manual of Style (16th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 14, 2019. http://hdl.handle.net/1853/50237.

MLA Handbook (7th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Web. 14 Nov 2019.

Vancouver:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1853/50237.

Council of Science Editors:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/50237


NSYSU

131. Lai, Pei-lin. Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces.

Degree: Master, Applied Mathematics, 2011, NSYSU

 The aim of this work is to propose viscosity-like methods for finding a specific common fixed point of a finite family T={ Ti }i=1N of… (more)

Subjects/Keywords: Nonexpansive mapping; Convex optimization; Contraction; Fixed point; Viscosity approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, P. (2011). Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0516111-182003

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):

Lai, Pei-lin. “Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces.” 2011. Thesis, NSYSU. Accessed November 14, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0516111-182003.

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

MLA Handbook (7th Edition):

Lai, Pei-lin. “Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces.” 2011. Web. 14 Nov 2019.

Vancouver:

Lai P. Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Nov 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0516111-182003.

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

Council of Science Editors:

Lai P. Iterative Methods for Common Fixed Points of Nonexpansive Mappings in Hilbert spaces. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0516111-182003

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


Tartu University

132. Lissitsin, Aleksei. Convex approximation properties of Banach spaces .

Degree: 2011, Tartu University

 Aproksimatsiooniprobleemiks nimetati üht kuulsaimat probleemi funktsionaalanalüüsi valdkonnas: kas igat kompaktset operaatorit Banachi ruumide vahel saab lähendada lõplikumõõtmeliste operaatoritega? Aastal 1955 näitas Grothendieck, et samaväärselt võib… (more)

Subjects/Keywords: Banachi ruumid; lähendamine; kumerad hulgad; dissertatsioonid; Banach spaces; approximation; convex sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lissitsin, A. (2011). Convex approximation properties of Banach spaces . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/17449

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):

Lissitsin, Aleksei. “Convex approximation properties of Banach spaces .” 2011. Thesis, Tartu University. Accessed November 14, 2019. http://hdl.handle.net/10062/17449.

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

MLA Handbook (7th Edition):

Lissitsin, Aleksei. “Convex approximation properties of Banach spaces .” 2011. Web. 14 Nov 2019.

Vancouver:

Lissitsin A. Convex approximation properties of Banach spaces . [Internet] [Thesis]. Tartu University; 2011. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10062/17449.

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

Council of Science Editors:

Lissitsin A. Convex approximation properties of Banach spaces . [Thesis]. Tartu University; 2011. Available from: http://hdl.handle.net/10062/17449

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


Virginia Tech

133. Wang, Hongjie. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.

Degree: MS, Industrial and Systems Engineering, 1998, Virginia Tech

 The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to… (more)

Subjects/Keywords: nonconvex programming; global optimization; nonlinear programming; RLT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (1998). Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36823

Chicago Manual of Style (16th Edition):

Wang, Hongjie. “Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.” 1998. Masters Thesis, Virginia Tech. Accessed November 14, 2019. http://hdl.handle.net/10919/36823.

MLA Handbook (7th Edition):

Wang, Hongjie. “Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.” 1998. Web. 14 Nov 2019.

Vancouver:

Wang H. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. [Internet] [Masters thesis]. Virginia Tech; 1998. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10919/36823.

Council of Science Editors:

Wang H. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. [Masters Thesis]. Virginia Tech; 1998. Available from: http://hdl.handle.net/10919/36823


Princeton University

134. Simoes Bravo Ferreira, Jose Frederico. Convex Optimization Approaches for NMR Assignment .

Degree: PhD, 2018, Princeton University

 Nuclear Magnetic Resonance Spectroscopy (NMR) is the primary tool for structural determination of proteins in solution. It distinguishes itself from other such tools by uncovering… (more)

Subjects/Keywords: Convex optimization; Linear programming; NMR spectroscopy; Semidefinite programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simoes Bravo Ferreira, J. F. (2018). Convex Optimization Approaches for NMR Assignment . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01xk81jp15z

Chicago Manual of Style (16th Edition):

Simoes Bravo Ferreira, Jose Frederico. “Convex Optimization Approaches for NMR Assignment .” 2018. Doctoral Dissertation, Princeton University. Accessed November 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01xk81jp15z.

MLA Handbook (7th Edition):

Simoes Bravo Ferreira, Jose Frederico. “Convex Optimization Approaches for NMR Assignment .” 2018. Web. 14 Nov 2019.

Vancouver:

Simoes Bravo Ferreira JF. Convex Optimization Approaches for NMR Assignment . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Nov 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01xk81jp15z.

Council of Science Editors:

Simoes Bravo Ferreira JF. Convex Optimization Approaches for NMR Assignment . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01xk81jp15z


University of Iowa

135. Chen, Jieqiu. Convex relaxations in nonconvex and applied optimization.

Degree: PhD, Business Administration, 2010, University of Iowa

  Traditionally, linear programming (LP) has been used to construct convex relaxations in the context of branch and bound for determining global optimal solutions to… (more)

Subjects/Keywords: Convex Optimization; Convex Relaxation; Global Optimization; Quadratic Programming; Second-order Cone Programming; Semidefinite Programming; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2010). Convex relaxations in nonconvex and applied optimization. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/654

Chicago Manual of Style (16th Edition):

Chen, Jieqiu. “Convex relaxations in nonconvex and applied optimization.” 2010. Doctoral Dissertation, University of Iowa. Accessed November 14, 2019. https://ir.uiowa.edu/etd/654.

MLA Handbook (7th Edition):

Chen, Jieqiu. “Convex relaxations in nonconvex and applied optimization.” 2010. Web. 14 Nov 2019.

Vancouver:

Chen J. Convex relaxations in nonconvex and applied optimization. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 Nov 14]. Available from: https://ir.uiowa.edu/etd/654.

Council of Science Editors:

Chen J. Convex relaxations in nonconvex and applied optimization. [Doctoral Dissertation]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/654


Georgia Tech

136. Cheon, Myun-Seok. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.

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

 Monotonic optimization consists of minimizing or maximizing a monotonic objective function over a set of constraints defined by monotonic functions. Many optimization problems in economics… (more)

Subjects/Keywords: Monotonic programs; Global optimization; Polyblock algorithm; Branch and bound algorithm; Polynomial programming; Stochastic programming; Probabilistically constrained linear program

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheon, M. (2005). Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/6938

Chicago Manual of Style (16th Edition):

Cheon, Myun-Seok. “Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.” 2005. Doctoral Dissertation, Georgia Tech. Accessed November 14, 2019. http://hdl.handle.net/1853/6938.

MLA Handbook (7th Edition):

Cheon, Myun-Seok. “Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.” 2005. Web. 14 Nov 2019.

Vancouver:

Cheon M. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1853/6938.

Council of Science Editors:

Cheon M. Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/6938


University of Oulu

137. Tervo, O. (Oskari). Transceiver optimization for energy-efficient multiantenna cellular networks.

Degree: 2018, University of Oulu

 Abstract This thesis focuses on the timely problem of energy-efficient transmission for wireless multiantenna cellular systems. The emphasis is on transmit beamforming (BF) and active… (more)

Subjects/Keywords: ICT; antenna selection; circuit power; coordinated beamforming; energy efficiency; fractional programming; information and communications technology; multicasting; processing power; signal processing; successive convex approximation; wireless communications; antenninvalinta; energiatehokkuus; langaton tietoliikennetekniikka; osamääräfunktion optimointi; peräkkäinen konveksi approksimaatio; piirin teho; prosessointiteho; ryhmälähetys; signaalinkäsittely; tieto- ja viestintätekniikka; yhteistoiminnallinen keilanmuodostus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tervo, O. (. (2018). Transceiver optimization for energy-efficient multiantenna cellular networks. (Doctoral Dissertation). University of Oulu. Retrieved from http://urn.fi/urn:isbn:9789526219356

Chicago Manual of Style (16th Edition):

Tervo, O (Oskari). “Transceiver optimization for energy-efficient multiantenna cellular networks.” 2018. Doctoral Dissertation, University of Oulu. Accessed November 14, 2019. http://urn.fi/urn:isbn:9789526219356.

MLA Handbook (7th Edition):

Tervo, O (Oskari). “Transceiver optimization for energy-efficient multiantenna cellular networks.” 2018. Web. 14 Nov 2019.

Vancouver:

Tervo O(. Transceiver optimization for energy-efficient multiantenna cellular networks. [Internet] [Doctoral dissertation]. University of Oulu; 2018. [cited 2019 Nov 14]. Available from: http://urn.fi/urn:isbn:9789526219356.

Council of Science Editors:

Tervo O(. Transceiver optimization for energy-efficient multiantenna cellular networks. [Doctoral Dissertation]. University of Oulu; 2018. Available from: http://urn.fi/urn:isbn:9789526219356

138. Deklerck, M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.

Degree: 2016, Delft University of Technology

 Structural optimization, first introduced by Schmidt in 1960, is a rapid growing factor in the development of new aerospace structures. This growth is established by… (more)

Subjects/Keywords: structural optimization; stiffened panel; interior point method; conservative approximation; sequential convex programming

…ConLin [6] is a convex linearisation algorithm developed by C.Fleury in 1989 and was… …Sequential Convex Programming (SCP) and is further discussed in the next section. (… …programming Sequential Convex Programming (SCP) also finds its origin in the CONLIN… …programming problem as specified by Schittkowski [40], where B k is the approximation of… …4.2.2 Approximation of the primal problem . . . . . . . . . . . . . . . . . . . 41 4.2.3… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deklerck, M. (2016). Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1

Chicago Manual of Style (16th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Masters Thesis, Delft University of Technology. Accessed November 14, 2019. http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

MLA Handbook (7th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Web. 14 Nov 2019.

Vancouver:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2019 Nov 14]. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

Council of Science Editors:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1


University of California – Berkeley

139. Pilanci, Mert. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.

Degree: Electrical Engineering & Computer Sciences, 2016, University of California – Berkeley

 With the advent of massive datasets, statistical learning and information processing techniques are expected to enable exceptional possibilities for engineering, data intensive sciences and better… (more)

Subjects/Keywords: Electrical engineering; Computer science; Statistics; big data; convex optimization; estimation; machine learning; randomized algorithms; statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pilanci, M. (2016). Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5hq130q6

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):

Pilanci, Mert. “Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.” 2016. Thesis, University of California – Berkeley. Accessed November 14, 2019. http://www.escholarship.org/uc/item/5hq130q6.

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

MLA Handbook (7th Edition):

Pilanci, Mert. “Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.” 2016. Web. 14 Nov 2019.

Vancouver:

Pilanci M. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. [Internet] [Thesis]. University of California – Berkeley; 2016. [cited 2019 Nov 14]. Available from: http://www.escholarship.org/uc/item/5hq130q6.

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

Council of Science Editors:

Pilanci M. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. [Thesis]. University of California – Berkeley; 2016. Available from: http://www.escholarship.org/uc/item/5hq130q6

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


University of Waterloo

140. Tilak, Hrushikesh. Computing sparse multiples of polynomials.

Degree: 2010, University of Waterloo

 We consider the problem of finding a sparse multiple of a polynomial. Given a polynomial f ∈ F[x] of degree d over a field F,… (more)

Subjects/Keywords: complexity; polynomial; sparse; multiple; algorithm; lowerbound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tilak, H. (2010). Computing sparse multiples of polynomials. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5455

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):

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Thesis, University of Waterloo. Accessed November 14, 2019. http://hdl.handle.net/10012/5455.

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

MLA Handbook (7th Edition):

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Web. 14 Nov 2019.

Vancouver:

Tilak H. Computing sparse multiples of polynomials. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10012/5455.

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

Council of Science Editors:

Tilak H. Computing sparse multiples of polynomials. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5455

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


Brno University of Technology

141. Klimeš, Lubomír. Algoritmy stochastického programování .

Degree: 2010, Brno University of Technology

 Stochastické programování a optimalizace jsou mocnými nástroji pro řešení široké škály inženýrských problémů zahrnujících neurčitost. Algoritmus progressive hedging je efektivní dekompoziční metoda určená pro řešení… (more)

Subjects/Keywords: optimalizace; stochastické programovaní; scénářové úlohy; progressive hedging algoritmus; paralelizace; plynulé odlévání oceli; optimization; stochastic programming; scenario-based programmes; progressive hedging algorithm; parallelization; continuous casting process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klimeš, L. (2010). Algoritmy stochastického programování . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/16483

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):

Klimeš, Lubomír. “Algoritmy stochastického programování .” 2010. Thesis, Brno University of Technology. Accessed November 14, 2019. http://hdl.handle.net/11012/16483.

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

MLA Handbook (7th Edition):

Klimeš, Lubomír. “Algoritmy stochastického programování .” 2010. Web. 14 Nov 2019.

Vancouver:

Klimeš L. Algoritmy stochastického programování . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/11012/16483.

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

Council of Science Editors:

Klimeš L. Algoritmy stochastického programování . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/16483

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


Brno University of Technology

142. Málek, Martin. Stochastická optimalizace toků v sítích .

Degree: 2017, Brno University of Technology

 Magisterská práce se zabývá stochastickou optimalizací síťových úloh. Teoretická část pokrývá tři témata - teorii grafů, optimalizaci a progressive hedging algoritmus. V rámci optimalizace je… (more)

Subjects/Keywords: Teorie grafů; toky v sítích; stochastické programování; dvoustupňová optimalizace; progressive hedging algoritmus; Graph theory; network flows; stochastic programming; two-stage optimization; progressive hedging algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Málek, M. (2017). Stochastická optimalizace toků v sítích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/65983

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):

Málek, Martin. “Stochastická optimalizace toků v sítích .” 2017. Thesis, Brno University of Technology. Accessed November 14, 2019. http://hdl.handle.net/11012/65983.

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

MLA Handbook (7th Edition):

Málek, Martin. “Stochastická optimalizace toků v sítích .” 2017. Web. 14 Nov 2019.

Vancouver:

Málek M. Stochastická optimalizace toků v sítích . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/11012/65983.

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

Council of Science Editors:

Málek M. Stochastická optimalizace toků v sítích . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/65983

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

143. Thomasse, Rémy. Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls.

Degree: Docteur es, Informatique, 2015, Nice

Dans cette thèse, nous donnons de nouveaux résultats sur la taille moyenne d’enveloppes convexes de points choisis dans un convexe. Cette taille est connue lorsque… (more)

Subjects/Keywords: Enveloppe convexe; Analyse lissée; Complexité; Convex hull; Smoothed analysis; Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thomasse, R. (2015). Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls. (Doctoral Dissertation). Nice. Retrieved from http://www.theses.fr/2015NICE4116

Chicago Manual of Style (16th Edition):

Thomasse, Rémy. “Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls.” 2015. Doctoral Dissertation, Nice. Accessed November 14, 2019. http://www.theses.fr/2015NICE4116.

MLA Handbook (7th Edition):

Thomasse, Rémy. “Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls.” 2015. Web. 14 Nov 2019.

Vancouver:

Thomasse R. Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls. [Internet] [Doctoral dissertation]. Nice; 2015. [cited 2019 Nov 14]. Available from: http://www.theses.fr/2015NICE4116.

Council of Science Editors:

Thomasse R. Analyse de complexité d'enveloppes convexes aléatoires : Complexity analysis of random convex hulls. [Doctoral Dissertation]. Nice; 2015. Available from: http://www.theses.fr/2015NICE4116


Texas A&M University

144. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

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):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed November 14, 2019. http://hdl.handle.net/1969.1/155568.

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

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 14 Nov 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/1969.1/155568.

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

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

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


Indian Institute of Science

145. Reddy, Danda Sai Koti. Stochastic Newton Methods With Enhanced Hessian Estimation.

Degree: 2017, Indian Institute of Science

 Optimization problems involving uncertainties are common in a variety of engineering disciplines such as transportation systems, manufacturing, communication networks, healthcare and finance. The large number… (more)

Subjects/Keywords: Stochastic Newton Methods; Hessian Estimation; Simultaneous Perturbation Stochastic Approximation (SPSA); Random Directions Stochastic Approximation (RDSA); Finite-difference Stochastic Approximation (FDSA); Hessian Estimation Scheme; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reddy, D. S. K. (2017). Stochastic Newton Methods With Enhanced Hessian Estimation. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf

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):

Reddy, Danda Sai Koti. “Stochastic Newton Methods With Enhanced Hessian Estimation.” 2017. Thesis, Indian Institute of Science. Accessed November 14, 2019. http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf.

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

MLA Handbook (7th Edition):

Reddy, Danda Sai Koti. “Stochastic Newton Methods With Enhanced Hessian Estimation.” 2017. Web. 14 Nov 2019.

Vancouver:

Reddy DSK. Stochastic Newton Methods With Enhanced Hessian Estimation. [Internet] [Thesis]. Indian Institute of Science; 2017. [cited 2019 Nov 14]. Available from: http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf.

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

Council of Science Editors:

Reddy DSK. Stochastic Newton Methods With Enhanced Hessian Estimation. [Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf

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

146. Ahmadian, Sara. Approximation Algorithms for Clustering and Facility Location Problems.

Degree: 2017, University of Waterloo

 Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and… (more)

Subjects/Keywords: Approximation algorithms; Facility location problems; Clustering; Mobile facility location problem; Min-load k-facility location; Lower-bounded clustering with outliers; Lower-bounded clustering; Clustering with outliers; Local search algorithm; Primal-dual algorithm; Linear-programming rounding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmadian, S. (2017). Approximation Algorithms for Clustering and Facility Location Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11640

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):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Thesis, University of Waterloo. Accessed November 14, 2019. http://hdl.handle.net/10012/11640.

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

MLA Handbook (7th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Web. 14 Nov 2019.

Vancouver:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/10012/11640.

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

Council of Science Editors:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11640

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


Brno University of Technology

147. Mrázková, Eva. Approximations in Stochastic Optimization and Their Applications .

Degree: 2010, Brno University of Technology

 Mnoho inženýrských úloh vede na optimalizační modely s~omezeními ve tvaru obyčejných (ODR) nebo parciálních (PDR) diferenciálních rovnic, přičemž jsou v praxi často některé parametry neurčité.… (more)

Subjects/Keywords: optimální inženýrský návrh; ODR a PDR omezení; stochastické programování; optimalizace s pravděpodobnostními omezeními; vícekriteriální optimalizace; metoda Monte Carlo; PHA algoritmus; optimum engineering design; ODE and PDE constraints; stochastic programming; chance constrained programming; multi-objective programming; Monte Carlo method; progressive hedging algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mrázková, E. (2010). Approximations in Stochastic Optimization and Their Applications . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/1571

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):

Mrázková, Eva. “Approximations in Stochastic Optimization and Their Applications .” 2010. Thesis, Brno University of Technology. Accessed November 14, 2019. http://hdl.handle.net/11012/1571.

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

MLA Handbook (7th Edition):

Mrázková, Eva. “Approximations in Stochastic Optimization and Their Applications .” 2010. Web. 14 Nov 2019.

Vancouver:

Mrázková E. Approximations in Stochastic Optimization and Their Applications . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/11012/1571.

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

Council of Science Editors:

Mrázková E. Approximations in Stochastic Optimization and Their Applications . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/1571

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

148. SIM MONG SOON. A revenue management model for sea cargo.

Degree: 2005, National University of Singapore

Subjects/Keywords: Revenue Management; Sea Cargo; Liner Industry; Stochastic Dynamic Programming; Sampled Average Approximation; Mixed integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SOON, S. M. (2005). A revenue management model for sea cargo. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14967

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):

SOON, SIM MONG. “A revenue management model for sea cargo.” 2005. Thesis, National University of Singapore. Accessed November 14, 2019. http://scholarbank.nus.edu.sg/handle/10635/14967.

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

MLA Handbook (7th Edition):

SOON, SIM MONG. “A revenue management model for sea cargo.” 2005. Web. 14 Nov 2019.

Vancouver:

SOON SM. A revenue management model for sea cargo. [Internet] [Thesis]. National University of Singapore; 2005. [cited 2019 Nov 14]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14967.

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

Council of Science Editors:

SOON SM. A revenue management model for sea cargo. [Thesis]. National University of Singapore; 2005. Available from: http://scholarbank.nus.edu.sg/handle/10635/14967

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


Université Catholique de Louvain

149. Taylor, Adrien. Convex interpolation and performance estimation of first-order methods for convex optimization.

Degree: 2017, Université Catholique de Louvain

The goal of this thesis is to show how to derive in a completely automated way exact and global worst-case guarantees for first-order methods in… (more)

Subjects/Keywords: Convex optimization; Convex analysis; First-order methods; Worst-case analysis; Semidefinite programming; Performance Estimation; Steepest descent; Convex interpolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Taylor, A. (2017). Convex interpolation and performance estimation of first-order methods for convex optimization. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/182881

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):

Taylor, Adrien. “Convex interpolation and performance estimation of first-order methods for convex optimization.” 2017. Thesis, Université Catholique de Louvain. Accessed November 14, 2019. http://hdl.handle.net/2078.1/182881.

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

MLA Handbook (7th Edition):

Taylor, Adrien. “Convex interpolation and performance estimation of first-order methods for convex optimization.” 2017. Web. 14 Nov 2019.

Vancouver:

Taylor A. Convex interpolation and performance estimation of first-order methods for convex optimization. [Internet] [Thesis]. Université Catholique de Louvain; 2017. [cited 2019 Nov 14]. Available from: http://hdl.handle.net/2078.1/182881.

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

Council of Science Editors:

Taylor A. Convex interpolation and performance estimation of first-order methods for convex optimization. [Thesis]. Université Catholique de Louvain; 2017. Available from: http://hdl.handle.net/2078.1/182881

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


Lehigh University

150. Menickelly, Matthew Joseph. Random Models in Nonlinear Optimization.

Degree: PhD, Industrial Engineering, 2017, Lehigh University

 In recent years, there has been a tremendous increase in the interest of applying techniques of deterministic optimization to stochastic settings, largely motivated by problems… (more)

Subjects/Keywords: derivative-free optimization; nonconvex optimization; nonlinear optimization; optimization; stochastic optimization; Operations Research, Systems Engineering and Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Menickelly, M. J. (2017). Random Models in Nonlinear Optimization. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2957

Chicago Manual of Style (16th Edition):

Menickelly, Matthew Joseph. “Random Models in Nonlinear Optimization.” 2017. Doctoral Dissertation, Lehigh University. Accessed November 14, 2019. https://preserve.lehigh.edu/etd/2957.

MLA Handbook (7th Edition):

Menickelly, Matthew Joseph. “Random Models in Nonlinear Optimization.” 2017. Web. 14 Nov 2019.

Vancouver:

Menickelly MJ. Random Models in Nonlinear Optimization. [Internet] [Doctoral dissertation]. Lehigh University; 2017. [cited 2019 Nov 14]. Available from: https://preserve.lehigh.edu/etd/2957.

Council of Science Editors:

Menickelly MJ. Random Models in Nonlinear Optimization. [Doctoral Dissertation]. Lehigh University; 2017. Available from: https://preserve.lehigh.edu/etd/2957

[1] [2] [3] [4] [5] [6] [7] … [919]

.