Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Nonlinear optimization Quasi Newton stochastic optimization )`

.
Showing records 1 – 30 of
26926 total matches.

◁ [1] [2] [3] [4] [5] … [898] ▶

Search Limiters

Dates

- 2015 – 2019 (9618)
- 2010 – 2014 (10953)
- 2005 – 2009 (4977)
- 2000 – 2004 (1413)
- 1995 – 1999 (548)
- 1990 – 1994 (278)
- 1985 – 1989 (249)
- 1980 – 1984 (151)
- 1975 – 1979 (151)
- 1970 – 1974 (118)

Universities

- Brno University of Technology (1082)
- Georgia Tech (789)
- Virginia Tech (696)
- University of São Paulo (600)
- National University of Singapore (510)
- Texas A&M University (484)
- University of Waterloo (457)
- Delft University of Technology (433)
- University of Florida (411)
- University of Illinois – Urbana-Champaign (396)
- University of Texas – Austin (362)
- Penn State University (348)
- Pontifical Catholic University of Rio de Janeiro (336)
- ETH Zürich (298)
- University of Michigan (293)

Department

- Mechanical Engineering (760)
- Electrical and Computer Engineering (601)
- Electrical Engineering (491)
- Mathematics (404)
- Aerospace Engineering (371)
- Computer Science (347)
- Industrial and Systems Engineering (340)
- Informatique (339)
- Physics (248)
- Civil Engineering (243)
- Civil and Environmental Engineering (203)
- Industrial Engineering (177)
- Chemical Engineering (162)
- Computation for Design and Optimization Program (159)
- Mathématiques (154)

Degrees

- PhD (6086)
- Docteur es (2613)
- MS (2120)
- Master (417)
- Mestrado (345)
- MA (90)
- MS(M.S.) (76)
- MASc (42)
- M. Phil. (40)
- MSc (31)
- 博士(工学) (31)
- Dissertation (26)
- M. Eng. (26)
- MSin Engineering (20)
- MEng (16)

Levels

- doctoral (10845)
- masters (4023)
- thesis (388)
- doctor of philosophy ph.d. (53)
- doctor of philosophy (ph.d.) (41)
- dissertation (16)
- article (10)

Languages

Country

- US (10499)
- France (2613)
- Canada (1935)
- Brazil (1754)
- Czech Republic (1092)
- Sweden (889)
- Greece (819)
- Australia (757)
- UK (737)
- Netherlands (703)
- India (670)
- Singapore (514)
- Switzerland (481)
- South Africa (363)
- Portugal (339)

▼ Search Limiters

1. Ovcin Zoran. Kvazi Njutnovi postupci za probleme stohastičkog programiranja.

Degree: 2016, University of Novi Sad

URL: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146426898759239.pdf?controlNumber=(BISIS)101079&fileName=146426898759239.pdf&id=5830&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101079&source=OATD&language=en

►

Posmatra se problem minimizacije bez ograničenja. U determinističkom slučaju ti problemi se uspešno rešavaju iterativnim Kvazi Njutnovim postupcima. Ovde se istražuje stohastički slučaj, kada su poznate… (more)

Subjects/Keywords: Nelinearna optimizacija, Kvazi Njutnove metode, stohastička optimizacija.; Nonlinear optimization, Quasi-Newton, stochastic optimization.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zoran, O. (2016). Kvazi Njutnovi postupci za probleme stohastičkog programiranja. (Thesis). University of Novi Sad. Retrieved from https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146426898759239.pdf?controlNumber=(BISIS)101079&fileName=146426898759239.pdf&id=5830&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101079&source=OATD&language=en

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zoran, Ovcin. “Kvazi Njutnovi postupci za probleme stohastičkog programiranja.” 2016. Thesis, University of Novi Sad. Accessed August 18, 2019. https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146426898759239.pdf?controlNumber=(BISIS)101079&fileName=146426898759239.pdf&id=5830&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101079&source=OATD&language=en.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zoran, Ovcin. “Kvazi Njutnovi postupci za probleme stohastičkog programiranja.” 2016. Web. 18 Aug 2019.

Vancouver:

Zoran O. Kvazi Njutnovi postupci za probleme stohastičkog programiranja. [Internet] [Thesis]. University of Novi Sad; 2016. [cited 2019 Aug 18]. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146426898759239.pdf?controlNumber=(BISIS)101079&fileName=146426898759239.pdf&id=5830&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101079&source=OATD&language=en.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zoran O. Kvazi Njutnovi postupci za probleme stohastičkog programiranja. [Thesis]. University of Novi Sad; 2016. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146426898759239.pdf?controlNumber=(BISIS)101079&fileName=146426898759239.pdf&id=5830&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101079&source=OATD&language=en

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

2.
Boutet, Nicolas.
Developing a symmetrical version of the *quasi*-*newton* least square algorithm.

Degree: 2017, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/thesis:10644

►

The class of Least Change Secant Update *Quasi*-*Newton* (LCSU QN) methods is often used for root finding or for * optimization* problems. The particularity of these…
(more)

Subjects/Keywords: Optimization; Quasi-Newton; Least square

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boutet, N. (2017). Developing a symmetrical version of the quasi-newton least square algorithm. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:10644

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Boutet, Nicolas. “Developing a symmetrical version of the quasi-newton least square algorithm.” 2017. Thesis, Université Catholique de Louvain. Accessed August 18, 2019. http://hdl.handle.net/2078.1/thesis:10644.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Boutet, Nicolas. “Developing a symmetrical version of the quasi-newton least square algorithm.” 2017. Web. 18 Aug 2019.

Vancouver:

Boutet N. Developing a symmetrical version of the quasi-newton least square algorithm. [Internet] [Thesis]. Université Catholique de Louvain; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2078.1/thesis:10644.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Boutet N. Developing a symmetrical version of the quasi-newton least square algorithm. [Thesis]. Université Catholique de Louvain; 2017. Available from: http://hdl.handle.net/2078.1/thesis:10644

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

3.
Lakshmanan, K.
Online Learning and Simulation Based Algorithms for *Stochastic* *Optimization*.

Degree: 2012, Indian Institute of Science

URL: http://hdl.handle.net/2005/3245

► In many *optimization* problems, the relationship between the objective and parameters is not known. The objective function itself may be *stochastic* such as a long-run…
(more)

Subjects/Keywords: Stochastic Approximation Algorithms; Stochastic Optimization; Markov Decision Process; Reinforcement Learning Algorithm; Queueing Networks; Queuing Theory; Quasi-Newton Stochastic Approximation Algorithm; Online Q-Learning Algorithm; Online Actor-Critic Algorithm; Markov Decision Processes; Q-learning Algorithm; Linear Function Approximation; Quasi-Newton Smoothed Functional Algorithms; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lakshmanan, K. (2012). Online Learning and Simulation Based Algorithms for Stochastic Optimization. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3245

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Thesis, Indian Institute of Science. Accessed August 18, 2019. http://hdl.handle.net/2005/3245.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Web. 18 Aug 2019.

Vancouver:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2005/3245.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/3245

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

4.
Guo, Jiayi.
SMOOTH *QUASI*-*NEWTON* METHODS FOR NONSMOOTH *OPTIMIZATION*
.

Degree: 2018, Cornell University

URL: http://hdl.handle.net/1813/59358

► The success of Newton’s method for smooth *optimization*, when Hessians are available, motivated the idea of *quasi*-*Newton* methods, which approximate Hessians in response to changes…
(more)

Subjects/Keywords: Operations research; Optimization; BFGS; Convex; Nonsmooth; Quasi-Newton

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Guo, J. (2018). SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/59358

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Guo, Jiayi. “SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION .” 2018. Thesis, Cornell University. Accessed August 18, 2019. http://hdl.handle.net/1813/59358.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Guo, Jiayi. “SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION .” 2018. Web. 18 Aug 2019.

Vancouver:

Guo J. SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION . [Internet] [Thesis]. Cornell University; 2018. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1813/59358.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Guo J. SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION . [Thesis]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59358

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

5.
Lee, Hyokyeong.
Parameter estimation to infer injector-producer
relationships in oil fields: from hybrid constrained *nonlinear*
* optimization* to inference in probabilistic graphical model.

Degree: PhD, Computer Science, 2010, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912

► In petroleum community, the oil field *optimization*, i.e., minimizing the operational cost and maximizing the oil recovery, is a challenging problem. One of the popular…
(more)

Subjects/Keywords: hybrid optimization; constrained nonlinear optimization; constrained linear least squares; dimensionality reduction; sequential quadratic programming; quasi-Newton method; line search; injector-producer relationship; capacitance-resistive model; structure learning of factor graphs; locality principle; belief discrepancies; large-scale constrained nonlinear optimization; factor graph and the sum-product algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lee, H. (2010). Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912

Chicago Manual of Style (16^{th} Edition):

Lee, Hyokyeong. “Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model.” 2010. Doctoral Dissertation, University of Southern California. Accessed August 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912.

MLA Handbook (7^{th} Edition):

Lee, Hyokyeong. “Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model.” 2010. Web. 18 Aug 2019.

Vancouver:

Lee H. Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2019 Aug 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912.

Council of Science Editors:

Lee H. Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912

6.
Chau, Chun Dong.
A *stochastic* *quasi* *Newton* method for molecular simulations.

Degree: 2010, Soft Matter Chemistry Group, Faculty of Science, Leiden University

URL: http://hdl.handle.net/1887/16104

► In this thesis the Langevin equation with a space-dependent alternative mobility matrix has been considered. Simulations of a complex molecular system with many different length…
(more)

Subjects/Keywords: Fokker Planck Equation; Langevin dynamics; Limited memory method; Quasi Newton; Stochastic optimization; Fokker Planck Equation; Langevin dynamics; Limited memory method; Quasi Newton; Stochastic optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chau, C. D. (2010). A stochastic quasi Newton method for molecular simulations. (Doctoral Dissertation). Soft Matter Chemistry Group, Faculty of Science, Leiden University. Retrieved from http://hdl.handle.net/1887/16104

Chicago Manual of Style (16^{th} Edition):

Chau, Chun Dong. “A stochastic quasi Newton method for molecular simulations.” 2010. Doctoral Dissertation, Soft Matter Chemistry Group, Faculty of Science, Leiden University. Accessed August 18, 2019. http://hdl.handle.net/1887/16104.

MLA Handbook (7^{th} Edition):

Chau, Chun Dong. “A stochastic quasi Newton method for molecular simulations.” 2010. Web. 18 Aug 2019.

Vancouver:

Chau CD. A stochastic quasi Newton method for molecular simulations. [Internet] [Doctoral dissertation]. Soft Matter Chemistry Group, Faculty of Science, Leiden University; 2010. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1887/16104.

Council of Science Editors:

Chau CD. A stochastic quasi Newton method for molecular simulations. [Doctoral Dissertation]. Soft Matter Chemistry Group, Faculty of Science, Leiden University; 2010. Available from: http://hdl.handle.net/1887/16104

INP Toulouse

7. Guemri, Mouloud. Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles.

Degree: Docteur es, Systèmes embarqués, 2013, INP Toulouse

URL: http://www.theses.fr/2013INPT0141

►

Le système étudié durant cette thèse est un véhicule électrique hybride avec deux sources d’énergies (Pile à combustible et Super-capacité). L’objectif fixé est de minimiser… (more)

Subjects/Keywords: Optimisation globale; Programmation dynamique; Quasi-Newton; Heuristiques; Optimisation Robuste; Problème Minimax; Programmation Bi-niveau; Global optimization; Dynamic programming; Quasi-Newton; Heuristics; Robust optimization; Minimax Problem; Bi-level programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Guemri, M. (2013). Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2013INPT0141

Chicago Manual of Style (16^{th} Edition):

Guemri, Mouloud. “Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles.” 2013. Doctoral Dissertation, INP Toulouse. Accessed August 18, 2019. http://www.theses.fr/2013INPT0141.

MLA Handbook (7^{th} Edition):

Guemri, Mouloud. “Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles.” 2013. Web. 18 Aug 2019.

Vancouver:

Guemri M. Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles. [Internet] [Doctoral dissertation]. INP Toulouse; 2013. [cited 2019 Aug 18]. Available from: http://www.theses.fr/2013INPT0141.

Council of Science Editors:

Guemri M. Heuristiques optimisées et robustes de résolution du problème de gestion d'énergie pour les véhicules électriques et hybrides : Optimized and robust heuristics for solving the problem of energy management for hybrid electric vehicles. [Doctoral Dissertation]. INP Toulouse; 2013. Available from: http://www.theses.fr/2013INPT0141

University of California – Merced

8.
Brust, Johannes Joachim.
Large-Scale *Quasi*-*Newton* Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions.

Degree: Applied Mathematics, 2018, University of California – Merced

URL: http://www.escholarship.org/uc/item/2bv922qk

This dissertation describes optimization methods and matrix factorizations for large-scale quasi-Newton trust-region methods. The proposed methods are applicable to convex and non-convex optimization problems, and are described in algorithms for software implementations.

Subjects/Keywords: Applied mathematics; Eigendecomposition; Large-Scale; Optimization; Projection Matrix; Quasi-Newton; Trust-Region Method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brust, J. J. (2018). Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions. (Thesis). University of California – Merced. Retrieved from http://www.escholarship.org/uc/item/2bv922qk

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Brust, Johannes Joachim. “Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions.” 2018. Thesis, University of California – Merced. Accessed August 18, 2019. http://www.escholarship.org/uc/item/2bv922qk.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Brust, Johannes Joachim. “Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions.” 2018. Web. 18 Aug 2019.

Vancouver:

Brust JJ. Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions. [Internet] [Thesis]. University of California – Merced; 2018. [cited 2019 Aug 18]. Available from: http://www.escholarship.org/uc/item/2bv922qk.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brust JJ. Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions. [Thesis]. University of California – Merced; 2018. Available from: http://www.escholarship.org/uc/item/2bv922qk

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

9.
Godwin, Mark Franklin.
* Quasi*-

Degree: Mechanical Engineering, 2011, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/7fw187gd

► The growing prevalence of networked systems with local sensing and computational capability will result in an increasing array of online and large scale *optimization* problems.…
(more)

Subjects/Keywords: Electrical engineering; Mechanical engineering; Computer science; online convex optimization; quasi-Newton; strongly convex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Godwin, M. F. (2011). Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7fw187gd

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Godwin, Mark Franklin. “Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization.” 2011. Thesis, University of California – Berkeley. Accessed August 18, 2019. http://www.escholarship.org/uc/item/7fw187gd.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Godwin, Mark Franklin. “Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization.” 2011. Web. 18 Aug 2019.

Vancouver:

Godwin MF. Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2019 Aug 18]. Available from: http://www.escholarship.org/uc/item/7fw187gd.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Godwin MF. Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/7fw187gd

Not specified: Masters Thesis or Doctoral Dissertation

Lehigh University

10.
Menickelly, Matthew Joseph.
Random Models in *Nonlinear* *Optimization*.

Degree: PhD, Industrial Engineering, 2017, Lehigh University

URL: https://preserve.lehigh.edu/etd/2957

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Menickelly, Matthew Joseph. “Random Models in Nonlinear Optimization.” 2017. Web. 18 Aug 2019.

Vancouver:

Menickelly MJ. Random Models in Nonlinear Optimization. [Internet] [Doctoral dissertation]. Lehigh University; 2017. [cited 2019 Aug 18]. 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

University of California – Merced

11. Rafati Heravi, Jacob. Learning Representations in Reinforcement Learning.

Degree: Electrical Engineering and Computer Science, 2019, University of California – Merced

URL: http://www.escholarship.org/uc/item/3dx2f8kq

► Reinforcement Learning (RL) algorithms allow artificial agents to improve their action selection policy to increase rewarding experiences in their environments. Temporal Difference (TD) learning algorithm,…
(more)

Subjects/Keywords: Artificial intelligence; Computer science; Applied mathematics; Hierarchical Representations; Machine Learning; Quasi-Newton Optimization; Reinforcement Learning; Sparse Representations; Trust-Region Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rafati Heravi, J. (2019). Learning Representations in Reinforcement Learning. (Thesis). University of California – Merced. Retrieved from http://www.escholarship.org/uc/item/3dx2f8kq

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rafati Heravi, Jacob. “Learning Representations in Reinforcement Learning.” 2019. Thesis, University of California – Merced. Accessed August 18, 2019. http://www.escholarship.org/uc/item/3dx2f8kq.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rafati Heravi, Jacob. “Learning Representations in Reinforcement Learning.” 2019. Web. 18 Aug 2019.

Vancouver:

Rafati Heravi J. Learning Representations in Reinforcement Learning. [Internet] [Thesis]. University of California – Merced; 2019. [cited 2019 Aug 18]. Available from: http://www.escholarship.org/uc/item/3dx2f8kq.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rafati Heravi J. Learning Representations in Reinforcement Learning. [Thesis]. University of California – Merced; 2019. Available from: http://www.escholarship.org/uc/item/3dx2f8kq

Not specified: Masters Thesis or Doctoral Dissertation

12.
Mercier, Luc H.
Amsaa: An Anticipatory Algorithm for Online *Stochastic*
Combinatorial *Optimization*.

Degree: PhD, Computer Science, 2009, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:95/

► Online *stochastic* combinatorial *optimization* problems are problems in which a decision maker is trying to minimize or maximize an objective by making a sequence of…
(more)

Subjects/Keywords: stochastic optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mercier, L. H. (2009). Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:95/

Chicago Manual of Style (16^{th} Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Doctoral Dissertation, Brown University. Accessed August 18, 2019. https://repository.library.brown.edu/studio/item/bdr:95/.

MLA Handbook (7^{th} Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Web. 18 Aug 2019.

Vancouver:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2019 Aug 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:95/.

Council of Science Editors:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Doctoral Dissertation]. Brown University; 2009. Available from: https://repository.library.brown.edu/studio/item/bdr:95/

University of Waterloo

13.
Howse, Alexander James Maxwell.
* Nonlinear* Preconditioning Methods for

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12559

► This thesis consists of two main parts, part one addressing problems from *nonlinear* *optimization* and part two based on solving systems of time dependent differential…
(more)

Subjects/Keywords: Nonlinear Preconditioning; Nonlinear Optimization; Quasi-Newton Methods; Tensor Decomposition; CP Tensor; Tucker Tensor; Parallel-in-Time Integration; Multigrid Reduction-in-Time; MGRIT; Hyperbolic Partial Differential Equations; Variable Coefficient Linear Advection; Burgers' Equation; Multigrid; Adaptive Grid Coarsening; Waveform Relaxation Multigrid; Semi-Algebraic Mode Analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howse, A. J. M. (2017). Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12559

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Howse, Alexander James Maxwell. “Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations.” 2017. Thesis, University of Waterloo. Accessed August 18, 2019. http://hdl.handle.net/10012/12559.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howse, Alexander James Maxwell. “Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations.” 2017. Web. 18 Aug 2019.

Vancouver:

Howse AJM. Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10012/12559.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howse AJM. Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12559

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

14.
Cho, Taewon.
Numerical Methods for Separable *Nonlinear* Inverse Problems with Constraint and Low Rank.

Degree: MS, Mathematics, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/82929

► In various research areas, there are many required measurements which can't be observed due to physical and economical reasons. Instead, these unknown measurements can be…
(more)

Subjects/Keywords: Nonlinear Inverse Problem; Image Deblurring; Gauss-Newton method; Variable Projection; Alternating Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cho, T. (2017). Numerical Methods for Separable Nonlinear Inverse Problems with Constraint and Low Rank. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/82929

Chicago Manual of Style (16^{th} Edition):

Cho, Taewon. “Numerical Methods for Separable Nonlinear Inverse Problems with Constraint and Low Rank.” 2017. Masters Thesis, Virginia Tech. Accessed August 18, 2019. http://hdl.handle.net/10919/82929.

MLA Handbook (7^{th} Edition):

Cho, Taewon. “Numerical Methods for Separable Nonlinear Inverse Problems with Constraint and Low Rank.” 2017. Web. 18 Aug 2019.

Vancouver:

Cho T. Numerical Methods for Separable Nonlinear Inverse Problems with Constraint and Low Rank. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10919/82929.

Council of Science Editors:

Cho T. Numerical Methods for Separable Nonlinear Inverse Problems with Constraint and Low Rank. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/82929

Texas A&M University

15.
Word, Daniel Paul.
* Nonlinear* Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151166

► The development of infectious disease models remains important to provide scientists with tools to better understand disease dynamics and develop more effective control strategies. In…
(more)

Subjects/Keywords: Nonlinear programming; parameter estimation; stochastic programming; measles; parallel dynamic optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Word, D. P. (2013). Nonlinear Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151166

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Word, Daniel Paul. “Nonlinear Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology.” 2013. Thesis, Texas A&M University. Accessed August 18, 2019. http://hdl.handle.net/1969.1/151166.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Word, Daniel Paul. “Nonlinear Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology.” 2013. Web. 18 Aug 2019.

Vancouver:

Word DP. Nonlinear Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1969.1/151166.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Word DP. Nonlinear Programming Approaches for Efficient Large-Scale Parameter Estimation with Applications in Epidemiology. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151166

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

16. Ahuja, Kapil. Probability-One Homotopy Maps for Mixed Complementarity Problems.

Degree: MS, Computer Science, 2007, Virginia Tech

URL: http://hdl.handle.net/10919/31539

► Probability-one homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive…
(more)

Subjects/Keywords: optimization; complementarity; nonlinear embedding; Newton homotopy; globally convergent

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ahuja, K. (2007). Probability-One Homotopy Maps for Mixed Complementarity Problems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31539

Chicago Manual of Style (16^{th} Edition):

Ahuja, Kapil. “Probability-One Homotopy Maps for Mixed Complementarity Problems.” 2007. Masters Thesis, Virginia Tech. Accessed August 18, 2019. http://hdl.handle.net/10919/31539.

MLA Handbook (7^{th} Edition):

Ahuja, Kapil. “Probability-One Homotopy Maps for Mixed Complementarity Problems.” 2007. Web. 18 Aug 2019.

Vancouver:

Ahuja K. Probability-One Homotopy Maps for Mixed Complementarity Problems. [Internet] [Masters thesis]. Virginia Tech; 2007. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10919/31539.

Council of Science Editors:

Ahuja K. Probability-One Homotopy Maps for Mixed Complementarity Problems. [Masters Thesis]. Virginia Tech; 2007. Available from: http://hdl.handle.net/10919/31539

University of Southern California

17.
Keshavarzzadeh, Vahid.
Design * optimization* under uncertainty for rotor blades of
horizontal axis wind turbines.

Degree: PhD, Civil Engineering (Structural Engineering), 2016, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/422612/rec/1869

► This dissertation is motivated by challenges involved in the design *optimization* under uncertainty for the structures undergoing fluid structure interaction phenomena. In particular, this study…
(more)

Subjects/Keywords: aerodynamic optimization; blade element method; reliability based design optimization; polynomial chaos expansion; convergence acceleration; stochastic differential equation; nonlinear sequence transformation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Keshavarzzadeh, V. (2016). Design optimization under uncertainty for rotor blades of horizontal axis wind turbines. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/422612/rec/1869

Chicago Manual of Style (16^{th} Edition):

Keshavarzzadeh, Vahid. “Design optimization under uncertainty for rotor blades of horizontal axis wind turbines.” 2016. Doctoral Dissertation, University of Southern California. Accessed August 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/422612/rec/1869.

MLA Handbook (7^{th} Edition):

Keshavarzzadeh, Vahid. “Design optimization under uncertainty for rotor blades of horizontal axis wind turbines.” 2016. Web. 18 Aug 2019.

Vancouver:

Keshavarzzadeh V. Design optimization under uncertainty for rotor blades of horizontal axis wind turbines. [Internet] [Doctoral dissertation]. University of Southern California; 2016. [cited 2019 Aug 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/422612/rec/1869.

Council of Science Editors:

Keshavarzzadeh V. Design optimization under uncertainty for rotor blades of horizontal axis wind turbines. [Doctoral Dissertation]. University of Southern California; 2016. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/422612/rec/1869

University of Iowa

18.
Vinel, Alexander.
Mathematical programming techniques for solving *stochastic* * optimization* problems with certainty equivalent measures of risk.

Degree: PhD, Industrial Engineering, 2015, University of Iowa

URL: https://ir.uiowa.edu/etd/1786

► The problem of risk-averse decision making under uncertainties is studied from both modeling and computational perspectives. First, we consider a framework for constructing coherent…
(more)

Subjects/Keywords: publicabstract; mathematical programming; mixed-integer optimization; nonlinear optimization; risk analysis; stochastic programming; uncertainty quantification; Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vinel, A. (2015). Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/1786

Chicago Manual of Style (16^{th} Edition):

Vinel, Alexander. “Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk.” 2015. Doctoral Dissertation, University of Iowa. Accessed August 18, 2019. https://ir.uiowa.edu/etd/1786.

MLA Handbook (7^{th} Edition):

Vinel, Alexander. “Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk.” 2015. Web. 18 Aug 2019.

Vancouver:

Vinel A. Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk. [Internet] [Doctoral dissertation]. University of Iowa; 2015. [cited 2019 Aug 18]. Available from: https://ir.uiowa.edu/etd/1786.

Council of Science Editors:

Vinel A. Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk. [Doctoral Dissertation]. University of Iowa; 2015. Available from: https://ir.uiowa.edu/etd/1786

University of Alberta

19. Kumar, Siddhartha. Design of Experiments for Large Scale Catalytic Systems.

Degree: MS, Department of Chemical and Materials Engineering, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/sq87bt66t

► Parameter estimation for mathematical models is performed based on the data collected by experiments using system identification techniques. However, since performing experiments can be time…
(more)

Subjects/Keywords: Design of experiments, hierarchical clustering, nonlinear stochastic optimization, computational singular perturbation, ammonia decomposition, preferential oxidation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kumar, S. (2011). Design of Experiments for Large Scale Catalytic Systems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/sq87bt66t

Chicago Manual of Style (16^{th} Edition):

Kumar, Siddhartha. “Design of Experiments for Large Scale Catalytic Systems.” 2011. Masters Thesis, University of Alberta. Accessed August 18, 2019. https://era.library.ualberta.ca/files/sq87bt66t.

MLA Handbook (7^{th} Edition):

Kumar, Siddhartha. “Design of Experiments for Large Scale Catalytic Systems.” 2011. Web. 18 Aug 2019.

Vancouver:

Kumar S. Design of Experiments for Large Scale Catalytic Systems. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2019 Aug 18]. Available from: https://era.library.ualberta.ca/files/sq87bt66t.

Council of Science Editors:

Kumar S. Design of Experiments for Large Scale Catalytic Systems. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/sq87bt66t

University of Edinburgh

20.
Fountoulakis, Kimon.
Higher-order methods for large-scale *optimization*.

Degree: PhD, 2015, University of Edinburgh

URL: http://hdl.handle.net/1842/15797

► There has been an increased interest in *optimization* for the analysis of large-scale data sets which require gigabytes or terabytes of data to be stored.…
(more)

Subjects/Keywords: large-scale optimization; Newton-type methods; preconditioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fountoulakis, K. (2015). Higher-order methods for large-scale optimization. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15797

Chicago Manual of Style (16^{th} Edition):

Fountoulakis, Kimon. “Higher-order methods for large-scale optimization.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed August 18, 2019. http://hdl.handle.net/1842/15797.

MLA Handbook (7^{th} Edition):

Fountoulakis, Kimon. “Higher-order methods for large-scale optimization.” 2015. Web. 18 Aug 2019.

Vancouver:

Fountoulakis K. Higher-order methods for large-scale optimization. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1842/15797.

Council of Science Editors:

Fountoulakis K. Higher-order methods for large-scale optimization. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/15797

21. Αποστολοπούλου, Μαριάννα. Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας.

Degree: 2011, University of Patras

URL: http://hdl.handle.net/10889/5699

►

Στην παρούσα διατριβή μελετάμε το πρόβλημα της βελτιστοποίησης μη γραμμικών συναρτήσεων πολλών μεταβλητών, όπου η αντικειμενική συνάρτηση είναι συνεχώς διαφορίσιμη σε ένα ανοιχτό υποσύνολο του… (more)

Subjects/Keywords: Προβλήματα μεγάλης κλίμακας; Υποπρόβλημα περιοχής εμπιστοσύνης; Μέθοδος σχεδόν ακριβούς λύσης; Καμπυλόγραμμη αναζήτηση; Μέθοδοι Quasi-Newton; Μέθοδος L-BFGS; Κατεύθυνση αρνητικής καμπυλότητας; Ιδιοτιμές-ιδιοδιανύσματα; 515.64; Large scale optimization; Trust region subproblem; Nearly exact method; Curvilinear search; Quasi-Newton method; L-BFGS method; Negative curvature direction; Eigenvalues-eigenvectors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Αποστολοπούλου, . (2011). Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας. (Doctoral Dissertation). University of Patras. Retrieved from http://hdl.handle.net/10889/5699

Chicago Manual of Style (16^{th} Edition):

Αποστολοπούλου, Μαριάννα. “Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας.” 2011. Doctoral Dissertation, University of Patras. Accessed August 18, 2019. http://hdl.handle.net/10889/5699.

MLA Handbook (7^{th} Edition):

Αποστολοπούλου, Μαριάννα. “Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας.” 2011. Web. 18 Aug 2019.

Vancouver:

Αποστολοπούλου . Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας. [Internet] [Doctoral dissertation]. University of Patras; 2011. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10889/5699.

Council of Science Editors:

Αποστολοπούλου . Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας. [Doctoral Dissertation]. University of Patras; 2011. Available from: http://hdl.handle.net/10889/5699

University of Illinois – Chicago

22.
Dige, Nishant S.
Efficient Sampling Algorithm for * Optimization* Under Uncertainty.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/20833

► Uncertainty is a part of a real world *optimization* problem. Computational speed is critical in optimizing large scale *stochastic* problems. The major bottleneck in solving…
(more)

Subjects/Keywords: Sampling; Quasi Sequence Sampling; Sobol Sampling; Optimization under uncertainty; LHS-Sobol sampling; stochastic supply chain network problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dige, N. S. (2016). Efficient Sampling Algorithm for Optimization Under Uncertainty. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20833

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Dige, Nishant S. “Efficient Sampling Algorithm for Optimization Under Uncertainty.” 2016. Thesis, University of Illinois – Chicago. Accessed August 18, 2019. http://hdl.handle.net/10027/20833.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dige, Nishant S. “Efficient Sampling Algorithm for Optimization Under Uncertainty.” 2016. Web. 18 Aug 2019.

Vancouver:

Dige NS. Efficient Sampling Algorithm for Optimization Under Uncertainty. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10027/20833.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dige NS. Efficient Sampling Algorithm for Optimization Under Uncertainty. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20833

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

23.
Kaw, Neal.
Inverse linear * optimization* for the recovery of constraint parameters in robust and non-robust problems.

Degree: 2017, University of Toronto

URL: http://hdl.handle.net/1807/79311

►

Most inverse * optimization* models impute unspecified parameters of an objective function to make an observed solution optimal for a given

Subjects/Keywords: Inverse optimization; Nonlinear programming; Robust optimization; 0796

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaw, N. (2017). Inverse linear optimization for the recovery of constraint parameters in robust and non-robust problems. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/79311

Chicago Manual of Style (16^{th} Edition):

Kaw, Neal. “Inverse linear optimization for the recovery of constraint parameters in robust and non-robust problems.” 2017. Masters Thesis, University of Toronto. Accessed August 18, 2019. http://hdl.handle.net/1807/79311.

MLA Handbook (7^{th} Edition):

Kaw, Neal. “Inverse linear optimization for the recovery of constraint parameters in robust and non-robust problems.” 2017. Web. 18 Aug 2019.

Vancouver:

Kaw N. Inverse linear optimization for the recovery of constraint parameters in robust and non-robust problems. [Internet] [Masters thesis]. University of Toronto; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1807/79311.

Council of Science Editors:

Kaw N. Inverse linear optimization for the recovery of constraint parameters in robust and non-robust problems. [Masters Thesis]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/79311

University of Saskatchewan

24. Alijan, Mehdi. DSP compensation for distortion in RF filters.

Degree: 2010, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-04052010-164240

► There is a growing demand for the high quality TV programs such as High Definition TV (HDTV). The CATV network is often a suitable solution…
(more)

Subjects/Keywords: Amplitude distortion; Equalization; FIR; IIR; Quasi Newton Algorithm; Optimization; CATV; DSP; DOCSIS; RF filter; SRRC; BER; Modulator; QAM; Conjugate symmetry; MSE; LMS; MER; Complex distortion; Group Delay distortion

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alijan, M. (2010). DSP compensation for distortion in RF filters. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-04052010-164240

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Alijan, Mehdi. “DSP compensation for distortion in RF filters.” 2010. Thesis, University of Saskatchewan. Accessed August 18, 2019. http://hdl.handle.net/10388/etd-04052010-164240.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Alijan, Mehdi. “DSP compensation for distortion in RF filters.” 2010. Web. 18 Aug 2019.

Vancouver:

Alijan M. DSP compensation for distortion in RF filters. [Internet] [Thesis]. University of Saskatchewan; 2010. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/10388/etd-04052010-164240.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alijan M. DSP compensation for distortion in RF filters. [Thesis]. University of Saskatchewan; 2010. Available from: http://hdl.handle.net/10388/etd-04052010-164240

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

25.
Kabli, Mohannad Reda A.
* Stochastic* Programming Model for Fuel Treatment Management.

Degree: 2014, Texas A&M University

URL: http://hdl.handle.net/1969.1/152840

► Due to the increased number and intensity of wild fires, the need for solutions that minimize the impact of fire are needed. Fuel treatment is…
(more)

Subjects/Keywords: fuel treatment; optimization; stochastic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kabli, M. R. A. (2014). Stochastic Programming Model for Fuel Treatment Management. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152840

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kabli, Mohannad Reda A. “Stochastic Programming Model for Fuel Treatment Management.” 2014. Thesis, Texas A&M University. Accessed August 18, 2019. http://hdl.handle.net/1969.1/152840.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kabli, Mohannad Reda A. “Stochastic Programming Model for Fuel Treatment Management.” 2014. Web. 18 Aug 2019.

Vancouver:

Kabli MRA. Stochastic Programming Model for Fuel Treatment Management. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1969.1/152840.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kabli MRA. Stochastic Programming Model for Fuel Treatment Management. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152840

Not specified: Masters Thesis or Doctoral Dissertation

Baylor University

26.
[No author].
* Stochastic* dynamic optimal power flow under the variability of renewable energy with modern heuristic

Degree: 2017, Baylor University

URL: http://hdl.handle.net/2104/10137

► With the increasing penetration of renewable energy to power systems, such as wind power, more challenges have been brought to system operations due to the…
(more)

Subjects/Keywords: Heuristic techniques. Stochastic optimization.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2017). Stochastic dynamic optimal power flow under the variability of renewable energy with modern heuristic optimization techniques. (Thesis). Baylor University. Retrieved from http://hdl.handle.net/2104/10137

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

author], [No. “Stochastic dynamic optimal power flow under the variability of renewable energy with modern heuristic optimization techniques. ” 2017. Thesis, Baylor University. Accessed August 18, 2019. http://hdl.handle.net/2104/10137.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Stochastic dynamic optimal power flow under the variability of renewable energy with modern heuristic optimization techniques. ” 2017. Web. 18 Aug 2019.

Vancouver:

author] [. Stochastic dynamic optimal power flow under the variability of renewable energy with modern heuristic optimization techniques. [Internet] [Thesis]. Baylor University; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/2104/10137.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Stochastic dynamic optimal power flow under the variability of renewable energy with modern heuristic optimization techniques. [Thesis]. Baylor University; 2017. Available from: http://hdl.handle.net/2104/10137

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

27. Phanish, Deepa. Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks.

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

URL: http://hdl.handle.net/1853/59223

► A large number of small sensing devices connected together with wireless transceivers can be used to effectively monitor various environments. However, these devices have limited…
(more)

Subjects/Keywords: Optimization; Stochastic geometry; Variational calculus

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Phanish, D. (2017). Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59223

Chicago Manual of Style (16^{th} Edition):

Phanish, Deepa. “Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks.” 2017. Doctoral Dissertation, Georgia Tech. Accessed August 18, 2019. http://hdl.handle.net/1853/59223.

MLA Handbook (7^{th} Edition):

Phanish, Deepa. “Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks.” 2017. Web. 18 Aug 2019.

Vancouver:

Phanish D. Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/1853/59223.

Council of Science Editors:

Phanish D. Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59223

Mississippi State University

28.
Rouhi, Mohammad.
TOPOLOGY * OPTIMIZATION* OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD.

Degree: MS, Aerospace Engineering, 2009, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-063432/ ;

► In this research, a new zeroth-order (non-gradient based) topology *optimization* methodology for compliance minimization was developed. It is called the Element Exchange Method (EEM).…
(more)

Subjects/Keywords: stochastic; element exchange; topology optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rouhi, M. (2009). TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-063432/ ;

Chicago Manual of Style (16^{th} Edition):

Rouhi, Mohammad. “TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD.” 2009. Masters Thesis, Mississippi State University. Accessed August 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-063432/ ;.

MLA Handbook (7^{th} Edition):

Rouhi, Mohammad. “TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD.” 2009. Web. 18 Aug 2019.

Vancouver:

Rouhi M. TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD. [Internet] [Masters thesis]. Mississippi State University; 2009. [cited 2019 Aug 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-063432/ ;.

Council of Science Editors:

Rouhi M. TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING ELEMENT EXCHANGE METHOD. [Masters Thesis]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-063432/ ;

Oklahoma State University

29.
Wang, Yu.
Application of *Stochastic* Control Theory to Hedge Ratio * Optimization* in Risk Management.

Degree: Department of Mathematics, 2009, Oklahoma State University

URL: http://hdl.handle.net/11244/6833

► Optimal hedge ratio problem with linear hedging strategy in risk management were introduced by Froot, Scharfstein, and Stein (1993). This thesis extends the idea to…
(more)

Subjects/Keywords: hedge; optimization; stochastic control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Y. (2009). Application of Stochastic Control Theory to Hedge Ratio Optimization in Risk Management. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/6833

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Yu. “Application of Stochastic Control Theory to Hedge Ratio Optimization in Risk Management.” 2009. Thesis, Oklahoma State University. Accessed August 18, 2019. http://hdl.handle.net/11244/6833.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Yu. “Application of Stochastic Control Theory to Hedge Ratio Optimization in Risk Management.” 2009. Web. 18 Aug 2019.

Vancouver:

Wang Y. Application of Stochastic Control Theory to Hedge Ratio Optimization in Risk Management. [Internet] [Thesis]. Oklahoma State University; 2009. [cited 2019 Aug 18]. Available from: http://hdl.handle.net/11244/6833.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Y. Application of Stochastic Control Theory to Hedge Ratio Optimization in Risk Management. [Thesis]. Oklahoma State University; 2009. Available from: http://hdl.handle.net/11244/6833

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

30.
Li, Chih-ping.
*Stochastic** optimization* over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6069

► This dissertation addresses several optimal *stochastic* scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems…
(more)

Subjects/Keywords: stochastic network optimization; queueing theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, C. (2011). Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6069

Chicago Manual of Style (16^{th} Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Doctoral Dissertation, University of Southern California. Accessed August 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6069.

MLA Handbook (7^{th} Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Web. 18 Aug 2019.

Vancouver:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2019 Aug 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6069.

Council of Science Editors:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6069