Advanced search options

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

You searched for `subject:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic)`

.
Showing records 1 – 30 of
27399 total matches.

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

Search Limiters

Dates

- 2015 – 2019 (8558)
- 2010 – 2014 (10390)
- 2005 – 2009 (5350)
- 2000 – 2004 (1767)
- 1995 – 1999 (868)
- 1990 – 1994 (617)
- 1985 – 1989 (556)
- 1980 – 1984 (417)
- 1975 – 1979 (275)
- 1970 – 1974 (278)

Universities

- Brno University of Technology (1138)
- University of Florida (784)
- University of São Paulo (586)
- ETH Zürich (584)
- Virginia Tech (482)
- Georgia Tech (470)
- NSYSU (420)
- National University of Singapore (420)
- University of Waterloo (390)
- Texas A&M University (384)
- Pontifical Catholic University of Rio de Janeiro (368)
- University of Illinois – Urbana-Champaign (341)
- Indian Institute of Science (303)
- Delft University of Technology (254)
- The Ohio State University (238)

Department

- Computer Science (808)
- Informatique (453)
- Electrical and Computer Engineering (439)
- Mathematics (407)
- Electrical Engineering (406)
- Industrial and Systems Engineering (329)
- Mechanical Engineering (246)
- Computer Science and Engineering (205)
- Statistics (180)
- Mathématiques (157)
- Industrial Engineering (145)
- Physics (137)
- Applied Mathematics (136)
- Civil Engineering (123)
- Department of Computer Science (110)

Degrees

- PhD (5894)
- MS (2050)
- Docteur es (1825)
- Master (572)
- Mestrado (331)
- MA (141)
- MS(M.S.) (60)
- M. Phil. (52)
- MSin Computer Science (48)
- MSc (47)
- M.S (39)
- MSin Engineering (39)
- EdD (35)
- M. Eng. (29)
- MASc (19)

Levels

- doctoral (10002)
- masters (4229)
- thesis (380)
- doctor of philosophy ph.d. (60)
- project (39)
- doctor of philosophy (ph.d.) (37)
- dissertation (13)

Languages

Country

- US (9551)
- Canada (2082)
- Brazil (2000)
- France (1825)
- UK (1404)
- Czech Republic (1145)
- Sweden (1104)
- Australia (990)
- Netherlands (755)
- Greece (740)
- Switzerland (733)
- India (648)
- Singapore (434)
- Taiwan (420)
- South Africa (419)

▼ Search Limiters

University of Florida

1.
Ghadimi, Saeed.
Finite-Time Convergence Properties of Methods for *Stochastic* * Programming*.

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

URL: http://ufdc.ufl.edu/UFE0047032

► In this dissertation, we mainly focus on establishing finite-time convergence of the iterative algorithms for solving both *convex* and *nonconvex* *stochastic* *programming* (SP) problems. In…
(more)

Subjects/Keywords: Algorithms; Approximation; Convexity; Data smoothing; Gradient method; Iterative solutions; Objective functions; Optimal solutions; Oracles; Probability mass distributions; algorithm – approximation – complexity – convex – nonconvex – optimazation – programming – randomized – stochastic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghadimi, S. (2014). Finite-Time Convergence Properties of Methods for Stochastic Programming. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047032

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

Ghadimi, Saeed. “Finite-Time Convergence Properties of Methods for Stochastic Programming.” 2014. Doctoral Dissertation, University of Florida. Accessed October 18, 2019. http://ufdc.ufl.edu/UFE0047032.

MLA Handbook (7^{th} Edition):

Ghadimi, Saeed. “Finite-Time Convergence Properties of Methods for Stochastic Programming.” 2014. Web. 18 Oct 2019.

Vancouver:

Ghadimi S. Finite-Time Convergence Properties of Methods for Stochastic Programming. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Oct 18]. Available from: http://ufdc.ufl.edu/UFE0047032.

Council of Science Editors:

Ghadimi S. Finite-Time Convergence Properties of Methods for Stochastic Programming. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0047032

University of Newcastle

2.
Kapoor, Reena.
Scheduling problems arising in coal export supply chains: algorithms and * complexity*.

Degree: non-terminal) node equals the total capacity of arcs leaving the node; and identical capacities on all arcs. Another factor that has a great impact on the throughput of the coal supply chain is the management of the stockyard, which is the interface between the land portion of the coal supply chain and the ocean portion of the coal supply chain, and where the cargoes get assembled. Given a number of vessels arriving at the port, stockyard management decisions include: assigning a location to each cargo (stockpile, 2015, University of Newcastle

URL: http://hdl.handle.net/1959.13/1310323

►

Research Doctorate - Doctor of Philosophy

A coal supply chain is a highly complex logistics system, comprising of several parties and components, focused on transporting… (more)

Subjects/Keywords: mixed integer programming; computational complexity; approximation algorithm; network optimization; scheduling; routing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kapoor, R. (2015). Scheduling problems arising in coal export supply chains: algorithms and complexity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310323

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

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Doctoral Dissertation, University of Newcastle. Accessed October 18, 2019. http://hdl.handle.net/1959.13/1310323.

MLA Handbook (7^{th} Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Web. 18 Oct 2019.

Vancouver:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1959.13/1310323.

Council of Science Editors:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310323

Carnegie Mellon University

3. Wu, Yi. The Approximability of Learning and Constraint Satisfaction Problems.

Degree: 2010, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/24

► An α-*approximation* *algorithm* is an *algorithm* guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing…
(more)

Subjects/Keywords: Complexity Theory; Approximation Algorithm; Computational Learning; Constraint Satisfaction Problem; Hardness of Approximation; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, Y. (2010). The Approximability of Learning and Constraint Satisfaction Problems. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

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

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Thesis, Carnegie Mellon University. Accessed October 18, 2019. http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Web. 18 Oct 2019.

Vancouver:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2019 Oct 18]. Available from: http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

4. Alvarado Ortiz, Alberth. Centralized and distributed resource allocation with applications to signal processing in communications.

Degree: PhD, 0127, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/72870

► Nowadays, wired and wireless networks are used everywhere and everyday. With the increasing popularity of multiuser communication systems, their optimal performance has become a crucial…
(more)

Subjects/Keywords: Distributed optimization; Resource allocation; Nash equilibrium; Game theory; Difference of convex programming; Nonconvex and nondifferentiable optimization; Successive convex approximation; Multiuser systems; Dynamic spectrum management; Cooperative physical layer security; Cognitive radio

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alvarado Ortiz, A. (2015). Centralized and distributed resource allocation with applications to signal processing in communications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/72870

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

Alvarado Ortiz, Alberth. “Centralized and distributed resource allocation with applications to signal processing in communications.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 18, 2019. http://hdl.handle.net/2142/72870.

MLA Handbook (7^{th} Edition):

Alvarado Ortiz, Alberth. “Centralized and distributed resource allocation with applications to signal processing in communications.” 2015. Web. 18 Oct 2019.

Vancouver:

Alvarado Ortiz A. Centralized and distributed resource allocation with applications to signal processing in communications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2142/72870.

Council of Science Editors:

Alvarado Ortiz A. Centralized and distributed resource allocation with applications to signal processing in communications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/72870

University of Michigan

5.
Shen, Xiangkun.
Linear and *Convex* *Programming* Based Algorithms for Network Design.

Degree: PhD, Industrial & Operations Engineering, 2019, University of Michigan

URL: http://hdl.handle.net/2027.42/151498

► This thesis presents linear and *convex* *programming* based algorithms for NP-hard discrete optimization problems, mainly with applications in network design. Network design problems aim to…
(more)

Subjects/Keywords: Approximation algorithm; Linear programming; Stochastic optimization; Online algorithm; Network design; Industrial and Operations Engineering; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shen, X. (2019). Linear and Convex Programming Based Algorithms for Network Design. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/151498

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

Shen, Xiangkun. “Linear and Convex Programming Based Algorithms for Network Design.” 2019. Doctoral Dissertation, University of Michigan. Accessed October 18, 2019. http://hdl.handle.net/2027.42/151498.

MLA Handbook (7^{th} Edition):

Shen, Xiangkun. “Linear and Convex Programming Based Algorithms for Network Design.” 2019. Web. 18 Oct 2019.

Vancouver:

Shen X. Linear and Convex Programming Based Algorithms for Network Design. [Internet] [Doctoral dissertation]. University of Michigan; 2019. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2027.42/151498.

Council of Science Editors:

Shen X. Linear and Convex Programming Based Algorithms for Network Design. [Doctoral Dissertation]. University of Michigan; 2019. Available from: http://hdl.handle.net/2027.42/151498

Georgia Tech

6.
Vielma Centeno, Juan Pablo.
Mixed integer *programming* approaches for nonlinear and *stochastic* * programming*.

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

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

► In this thesis we study how to solve some *nonconvex* optimization problems by using methods that capitalize on the success of Linear *Programming* (LP) based…
(more)

Subjects/Keywords: Mixed integer programming; Stochastic programming; Mathematical optimization; Nonconvex programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vielma Centeno, J. P. (2009). Mixed integer programming approaches for nonlinear and stochastic programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29624

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

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Doctoral Dissertation, Georgia Tech. Accessed October 18, 2019. http://hdl.handle.net/1853/29624.

MLA Handbook (7^{th} Edition):

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Web. 18 Oct 2019.

Vancouver:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1853/29624.

Council of Science Editors:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29624

University of California – Berkeley

7. Tulsiani, Madhur. Local Constraints in Combinatorial Optimization.

Degree: Computer Science, 2009, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/70v2r675

► Hard combinatorial optimization problems are often approximated using linear or semidefinite *programming* relaxations. In fact, most of the algorithms developed using such *convex* programs have…
(more)

Subjects/Keywords: Computer Science; Approximation; Complexity; Convex Relaxations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tulsiani, M. (2009). Local Constraints in Combinatorial Optimization. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/70v2r675

Not specified: Masters Thesis or Doctoral Dissertation

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

Tulsiani, Madhur. “Local Constraints in Combinatorial Optimization.” 2009. Thesis, University of California – Berkeley. Accessed October 18, 2019. http://www.escholarship.org/uc/item/70v2r675.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tulsiani, Madhur. “Local Constraints in Combinatorial Optimization.” 2009. Web. 18 Oct 2019.

Vancouver:

Tulsiani M. Local Constraints in Combinatorial Optimization. [Internet] [Thesis]. University of California – Berkeley; 2009. [cited 2019 Oct 18]. Available from: http://www.escholarship.org/uc/item/70v2r675.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tulsiani M. Local Constraints in Combinatorial Optimization. [Thesis]. University of California – Berkeley; 2009. Available from: http://www.escholarship.org/uc/item/70v2r675

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

8. Kannan, Aswin. Distributed Algorithms for Optimization and.

Degree: PhD, Industrial Engineering, 2014, Penn State University

URL: https://etda.libraries.psu.edu/catalog/24252

► This dissertation considers three sets of problems arising from optimization and game-theoretic problems complicated by the presence of uncertainty, limited information, and problem misspecification. Broadly…
(more)

Subjects/Keywords: Variational inequalities; distributed algorithm; stochastic approximation; pseudomonotone.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kannan, A. (2014). Distributed Algorithms for Optimization and. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/24252

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

Kannan, Aswin. “Distributed Algorithms for Optimization and.” 2014. Doctoral Dissertation, Penn State University. Accessed October 18, 2019. https://etda.libraries.psu.edu/catalog/24252.

MLA Handbook (7^{th} Edition):

Kannan, Aswin. “Distributed Algorithms for Optimization and.” 2014. Web. 18 Oct 2019.

Vancouver:

Kannan A. Distributed Algorithms for Optimization and. [Internet] [Doctoral dissertation]. Penn State University; 2014. [cited 2019 Oct 18]. Available from: https://etda.libraries.psu.edu/catalog/24252.

Council of Science Editors:

Kannan A. Distributed Algorithms for Optimization and. [Doctoral Dissertation]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/24252

9.
Pontoizeau, Thomas.
Community detection : computational *complexity* and *approximation* : Détection de communautés : complexité computationnelle et * approximation*.

Degree: Docteur es, Informatique, 2018, Paris Sciences et Lettres

URL: http://www.theses.fr/2018PSLED007

►

Cette thèse étudie la détection de communautés dans le contexte des réseaux sociaux. Un réseau social peut être modélisé par un graphe dans lequel les… (more)

Subjects/Keywords: Complexité; Algorithme; Graphes; Approximation; Complexity; Algorithm; Graphs; Approximation; 003

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pontoizeau, T. (2018). Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2018PSLED007

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

Pontoizeau, Thomas. “Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation.” 2018. Doctoral Dissertation, Paris Sciences et Lettres. Accessed October 18, 2019. http://www.theses.fr/2018PSLED007.

MLA Handbook (7^{th} Edition):

Pontoizeau, Thomas. “Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation.” 2018. Web. 18 Oct 2019.

Vancouver:

Pontoizeau T. Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2018. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2018PSLED007.

Council of Science Editors:

Pontoizeau T. Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. [Doctoral Dissertation]. Paris Sciences et Lettres; 2018. Available from: http://www.theses.fr/2018PSLED007

Queens University

10.
Saldi, Naci.
Optimal Quantization and *Approximation* in Source Coding and *Stochastic* Control
.

Degree: Mathematics and Statistics, 2015, Queens University

URL: http://hdl.handle.net/1974/13147

► This thesis deals with non-standard optimal quantization and *approximation* problems in source coding and *stochastic* control. The first part of the thesis considers *randomized* quantization.…
(more)

Subjects/Keywords: Quantization; randomized quantization; Markov decision processes; approximation in stochastic control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saldi, N. (2015). Optimal Quantization and Approximation in Source Coding and Stochastic Control . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/13147

Not specified: Masters Thesis or Doctoral Dissertation

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

Saldi, Naci. “Optimal Quantization and Approximation in Source Coding and Stochastic Control .” 2015. Thesis, Queens University. Accessed October 18, 2019. http://hdl.handle.net/1974/13147.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Saldi, Naci. “Optimal Quantization and Approximation in Source Coding and Stochastic Control .” 2015. Web. 18 Oct 2019.

Vancouver:

Saldi N. Optimal Quantization and Approximation in Source Coding and Stochastic Control . [Internet] [Thesis]. Queens University; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1974/13147.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Saldi N. Optimal Quantization and Approximation in Source Coding and Stochastic Control . [Thesis]. Queens University; 2015. Available from: http://hdl.handle.net/1974/13147

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

11.
Linhares Rodrigues, Andre.
* Approximation* Algorithms for Distributionally Robust

Degree: 2019, University of Waterloo

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

► Two-stage *stochastic* optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios,…
(more)

Subjects/Keywords: approximation algorithms; stochastic optimization; discrete optimization; convex optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Linhares Rodrigues, A. (2019). Approximation Algorithms for Distributionally Robust Stochastic Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14639

Not specified: Masters Thesis or Doctoral Dissertation

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

Linhares Rodrigues, Andre. “Approximation Algorithms for Distributionally Robust Stochastic Optimization.” 2019. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/14639.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Linhares Rodrigues, Andre. “Approximation Algorithms for Distributionally Robust Stochastic Optimization.” 2019. Web. 18 Oct 2019.

Vancouver:

Linhares Rodrigues A. Approximation Algorithms for Distributionally Robust Stochastic Optimization. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/14639.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Linhares Rodrigues A. Approximation Algorithms for Distributionally Robust Stochastic Optimization. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14639

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

12.
Hungerford, James T.
The Vertex Separator Problem and Edge-Concave Quadratic * Programming*.

Degree: PhD, Mathematics, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045834

► The vertex separator problem on a graph G is to find the smallest set of vertices whose removal breaks the graph into two disconnected subsets…
(more)

Subjects/Keywords: Algorithms; Integers; Linear programming; Mathematics; Necessary conditions for optimality; Objective functions; Polyhedrons; Polynomials; Separators; Vertices; algorithm – complexity – continuous – convex – discrete – multilevel – optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hungerford, J. T. (2013). The Vertex Separator Problem and Edge-Concave Quadratic Programming. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045834

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

Hungerford, James T. “The Vertex Separator Problem and Edge-Concave Quadratic Programming.” 2013. Doctoral Dissertation, University of Florida. Accessed October 18, 2019. http://ufdc.ufl.edu/UFE0045834.

MLA Handbook (7^{th} Edition):

Hungerford, James T. “The Vertex Separator Problem and Edge-Concave Quadratic Programming.” 2013. Web. 18 Oct 2019.

Vancouver:

Hungerford JT. The Vertex Separator Problem and Edge-Concave Quadratic Programming. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 18]. Available from: http://ufdc.ufl.edu/UFE0045834.

Council of Science Editors:

Hungerford JT. The Vertex Separator Problem and Edge-Concave Quadratic Programming. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045834

Columbia University

13.
Bhat, Nikhil.
Tractable *approximation* algorithms for high dimensional sequential optimization problems.

Degree: 2016, Columbia University

URL: https://doi.org/10.7916/D8JQ10W8

► Sequential decision making problems are ubiquitous in a number of research areas such as operations research, finance, engineering and computer science. The main challenge with…
(more)

Subjects/Keywords: Dynamic programming; Stochastic approximation; Stochastic control theory; Markov processes; Operations research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhat, N. (2016). Tractable approximation algorithms for high dimensional sequential optimization problems. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8JQ10W8

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

Bhat, Nikhil. “Tractable approximation algorithms for high dimensional sequential optimization problems.” 2016. Doctoral Dissertation, Columbia University. Accessed October 18, 2019. https://doi.org/10.7916/D8JQ10W8.

MLA Handbook (7^{th} Edition):

Bhat, Nikhil. “Tractable approximation algorithms for high dimensional sequential optimization problems.” 2016. Web. 18 Oct 2019.

Vancouver:

Bhat N. Tractable approximation algorithms for high dimensional sequential optimization problems. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2019 Oct 18]. Available from: https://doi.org/10.7916/D8JQ10W8.

Council of Science Editors:

Bhat N. Tractable approximation algorithms for high dimensional sequential optimization problems. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8JQ10W8

University of Iowa

14.
Pandit, Saurav.
* Approximation* algorithms for distributed systems.

Degree: PhD, Computer Science, 2010, University of Iowa

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

► Distributed *Approximation* is a new and rapidly developing discipline that lies at the crossroads of various well-established areas of Computer Science - Distributed Computing,…
(more)

Subjects/Keywords: Approximation algorithms; Complexity; Distributed algorithms; Randomized algorithms; Wireless sensor networks; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pandit, S. (2010). Approximation algorithms for distributed systems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/870

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

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Doctoral Dissertation, University of Iowa. Accessed October 18, 2019. https://ir.uiowa.edu/etd/870.

MLA Handbook (7^{th} Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Web. 18 Oct 2019.

Vancouver:

Pandit S. Approximation algorithms for distributed systems. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 Oct 18]. Available from: https://ir.uiowa.edu/etd/870.

Council of Science Editors:

Pandit S. Approximation algorithms for distributed systems. [Doctoral Dissertation]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/870

University of Alberta

15.
Balazs, Gabor.
* Convex* Regression: Theory, Practice, and
Applications.

Degree: PhD, Department of Computing Science, 2016, University of Alberta

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

► This thesis explores theoretical, computational, and practical aspects of *convex* (shape-constrained) regression, providing new excess risk upper bounds, a comparison of *convex* regression techniques with…
(more)

Subjects/Keywords: convex regression; excess risk upper bound; max-affine estimator; empirical risk minimization; convex stochastic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balazs, G. (2016). Convex Regression: Theory, Practice, and Applications. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/c7d278t254

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

Balazs, Gabor. “Convex Regression: Theory, Practice, and Applications.” 2016. Doctoral Dissertation, University of Alberta. Accessed October 18, 2019. https://era.library.ualberta.ca/files/c7d278t254.

MLA Handbook (7^{th} Edition):

Balazs, Gabor. “Convex Regression: Theory, Practice, and Applications.” 2016. Web. 18 Oct 2019.

Vancouver:

Balazs G. Convex Regression: Theory, Practice, and Applications. [Internet] [Doctoral dissertation]. University of Alberta; 2016. [cited 2019 Oct 18]. Available from: https://era.library.ualberta.ca/files/c7d278t254.

Council of Science Editors:

Balazs G. Convex Regression: Theory, Practice, and Applications. [Doctoral Dissertation]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/c7d278t254

Georgia Tech

16.
Lan, Guanghui.
* Convex* optimization under inexact first-order information.

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

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

► In this thesis we investigate the design and *complexity* analysis of the algorithms to solve *convex* *programming* problems under inexact first-order information. In the first…
(more)

Subjects/Keywords: Convex optimization; Stochastic programming; First-order methods; Uncertainty; Mathematical optimization; Convex functions; First-order logic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lan, G. (2009). Convex optimization under inexact first-order information. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29732

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

Lan, Guanghui. “Convex optimization under inexact first-order information.” 2009. Doctoral Dissertation, Georgia Tech. Accessed October 18, 2019. http://hdl.handle.net/1853/29732.

MLA Handbook (7^{th} Edition):

Lan, Guanghui. “Convex optimization under inexact first-order information.” 2009. Web. 18 Oct 2019.

Vancouver:

Lan G. Convex optimization under inexact first-order information. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1853/29732.

Council of Science Editors:

Lan G. Convex optimization under inexact first-order information. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29732

University of Tennessee – Knoxville

17. Dexter, Nicholas Calvin. Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs.

Degree: 2018, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/5077

► This work studies sparse reconstruction techniques for approximating solutions of high-dimensional parametric PDEs. Such problems are relevant to mathematical modeling in engineering and the sciences,…
(more)

Subjects/Keywords: parameterized PDEs; high-dimensional approximation; compressed sensing; stochastic Galerkin method; uncertainty quantification; convex optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dexter, N. C. (2018). Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/5077

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

Dexter, Nicholas Calvin. “Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs.” 2018. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed October 18, 2019. https://trace.tennessee.edu/utk_graddiss/5077.

MLA Handbook (7^{th} Edition):

Dexter, Nicholas Calvin. “Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs.” 2018. Web. 18 Oct 2019.

Vancouver:

Dexter NC. Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2018. [cited 2019 Oct 18]. Available from: https://trace.tennessee.edu/utk_graddiss/5077.

Council of Science Editors:

Dexter NC. Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2018. Available from: https://trace.tennessee.edu/utk_graddiss/5077

Université Catholique de Louvain

18. Orban de Xivry, François-Xavier. Nearest stable system.

Degree: 2013, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/132586

►

Stability is a universal concept which we experience in our everyday lives. It plays a central role in the study of dynamical systems and is… (more)

Subjects/Keywords: Stability; Dynamical system; Convex optimization; Nonconvex; Nonsmooth

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Orban de Xivry, F. (2013). Nearest stable system. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/132586

Not specified: Masters Thesis or Doctoral Dissertation

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

Orban de Xivry, François-Xavier. “Nearest stable system.” 2013. Thesis, Université Catholique de Louvain. Accessed October 18, 2019. http://hdl.handle.net/2078.1/132586.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Orban de Xivry, François-Xavier. “Nearest stable system.” 2013. Web. 18 Oct 2019.

Vancouver:

Orban de Xivry F. Nearest stable system. [Internet] [Thesis]. Université Catholique de Louvain; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2078.1/132586.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Orban de Xivry F. Nearest stable system. [Thesis]. Université Catholique de Louvain; 2013. Available from: http://hdl.handle.net/2078.1/132586

Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

19.
Griscik, Michael Paul.
A New *Algorithm* for *Stochastic* * Approximation*.

Degree: MEngr, 1970, McMaster University

URL: http://hdl.handle.net/11375/17894

►

A review of *Stochastic* *Approximation* and the major contributions to the area is made. A proof of convergence for the *algorithm* is developed. An…
(more)

Subjects/Keywords: stochastic; algorithm; approximation; convergence; optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Griscik, M. P. (1970). A New Algorithm for Stochastic Approximation. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/17894

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

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Masters Thesis, McMaster University. Accessed October 18, 2019. http://hdl.handle.net/11375/17894.

MLA Handbook (7^{th} Edition):

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Web. 18 Oct 2019.

Vancouver:

Griscik MP. A New Algorithm for Stochastic Approximation. [Internet] [Masters thesis]. McMaster University; 1970. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11375/17894.

Council of Science Editors:

Griscik MP. A New Algorithm for Stochastic Approximation. [Masters Thesis]. McMaster University; 1970. Available from: http://hdl.handle.net/11375/17894

NSYSU

20.
Lai, Ruei-Chi.
A primal-dual infeasible interior point *algorithm* for linearly constrained *convex* * programming*.

Degree: Master, Applied Mathematics, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022114-091749

► *Convex* minimization has applications in a wide range of disciplines, such as automatic control systems, estimation and signal processing, communications and net- works, electronic circuit…
(more)

Subjects/Keywords: global convergence; step length; infeasible interior point algorithm; linear programming; linearly constrained convex programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lai, R. (2014). A primal-dual infeasible interior point algorithm for linearly constrained convex programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022114-091749

Not specified: Masters Thesis or Doctoral Dissertation

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

Lai, Ruei-Chi. “A primal-dual infeasible interior point algorithm for linearly constrained convex programming.” 2014. Thesis, NSYSU. Accessed October 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022114-091749.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lai, Ruei-Chi. “A primal-dual infeasible interior point algorithm for linearly constrained convex programming.” 2014. Web. 18 Oct 2019.

Vancouver:

Lai R. A primal-dual infeasible interior point algorithm for linearly constrained convex programming. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Oct 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022114-091749.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lai R. A primal-dual infeasible interior point algorithm for linearly constrained convex programming. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022114-091749

Not specified: Masters Thesis or Doctoral Dissertation

Université Paris-Sud – Paris XI

21. Le Bodic, Pierre. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2012PA112190

►

Cette thèse est composée de deux parties, chacune portant sur un sous-domaine de l'optimisation combinatoire a priori distant de l'autre. Le premier thème de recherche… (more)

Subjects/Keywords: Programmation biniveau; Programmation stochastique; Problèmes de coupe; Problèmes de couverture; Multicoupe partielle; Coupe multiterminale partielle; Ensemble dominant partiel; Complexité; Approximation; Programmation dynamique; Graphes de largeur d'arbre bornée; Bilevel programming; Stochastic programming; Cut problems; Cover problems; Partial multicut; Partial multiterminal cut; Partial dominating set; Complexity; Approximation; Dynamic programming; Bounded treewidth graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Le Bodic, P. (2012). Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112190

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

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed October 18, 2019. http://www.theses.fr/2012PA112190.

MLA Handbook (7^{th} Edition):

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Web. 18 Oct 2019.

Vancouver:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2012PA112190.

Council of Science Editors:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112190

22. Munro, Dirk Pieter. A direct approach to structural topology optimization.

Degree: PhD, Mechanical and Mechatronic Engineering, 2017, Stellenbosch University

URL: http://hdl.handle.net/10019.1/101051

► ENGLISH ABSTRACT: This dissertation addresses various topics that emerge from the unification of conventional structural optimization—based on ‘sequential approximate optimization’ (SAO)—with the alternative ‘direct’—or ‘simultaneous…
(more)

Subjects/Keywords: Structural design.; SAO (Sequential approximation optimization); Convex programming; Design services; Structural optimization; UCTD

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Munro, D. P. (2017). A direct approach to structural topology optimization. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/101051

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

Munro, Dirk Pieter. “A direct approach to structural topology optimization.” 2017. Doctoral Dissertation, Stellenbosch University. Accessed October 18, 2019. http://hdl.handle.net/10019.1/101051.

MLA Handbook (7^{th} Edition):

Munro, Dirk Pieter. “A direct approach to structural topology optimization.” 2017. Web. 18 Oct 2019.

Vancouver:

Munro DP. A direct approach to structural topology optimization. [Internet] [Doctoral dissertation]. Stellenbosch University; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10019.1/101051.

Council of Science Editors:

Munro DP. A direct approach to structural topology optimization. [Doctoral Dissertation]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/101051

Virginia Tech

23. Ojha, Abhi. Coupled Natural Gas and Electric Power Systems.

Degree: MS, Electrical and Computer Engineering, 2017, Virginia Tech

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

► Decreasing gas prices and the pressing need for fast-responding electric power generators are currently transforming natural gas networks. The intermittent operation of gas-fired plants to…
(more)

Subjects/Keywords: Successive convex approximation; semidefinite programming; feasible point pursuit; alternating direction method of multipliers

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ojha, A. (2017). Coupled Natural Gas and Electric Power Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78666

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

Ojha, Abhi. “Coupled Natural Gas and Electric Power Systems.” 2017. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/78666.

MLA Handbook (7^{th} Edition):

Ojha, Abhi. “Coupled Natural Gas and Electric Power Systems.” 2017. Web. 18 Oct 2019.

Vancouver:

Ojha A. Coupled Natural Gas and Electric Power Systems. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/78666.

Council of Science Editors:

Ojha A. Coupled Natural Gas and Electric Power Systems. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78666

24. Glorieux, Antoine. Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe.

Degree: Docteur es, Mathématiques, 2017, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2017TELE0011

►

Le déséquilibre d'un sommet dans un graphe orienté est la valeur absolue de la différence entre son degré sortant et son degré entrant. Nous étudions… (more)

Subjects/Keywords: Graphe; Orientation; Optimisation combinatoire; Complexité; NP-complet; NP-dur; Algorithme d'approximation; Coupe maximum; Programmation linéaire mixte; Optimisation semi-définie positive; Graph; Orientation; Combinatorial optimization; Complexity; NP-complete; NP-hard; Approximation algorithm; Maximum cut; Mixed integer programming; Semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Glorieux, A. (2017). Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2017TELE0011

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

Glorieux, Antoine. “Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe.” 2017. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed October 18, 2019. http://www.theses.fr/2017TELE0011.

MLA Handbook (7^{th} Edition):

Glorieux, Antoine. “Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe.” 2017. Web. 18 Oct 2019.

Vancouver:

Glorieux A. Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2017. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2017TELE0011.

Council of Science Editors:

Glorieux A. Optimizing the imbalances in a graph : Optimiser les déséquilibres dans un graphe. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2017. Available from: http://www.theses.fr/2017TELE0011

Indian Institute of Science

25.
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 October 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 Oct 2019.

Vancouver:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Oct 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

University of Georgia

26.
Zhuang, Chao.
*Stochastic**approximation* methods and applications in financial optimization problems.

Degree: PhD, Mathematics, 2008, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd

► Optimizations play an increasingly indispensable role in financial decisions and financial models. Many problems in mathematical finance, such as asset allocation, trading strategy, and derivative…
(more)

Subjects/Keywords: Stochastic Approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhuang, C. (2008). Stochastic approximation methods and applications in financial optimization problems. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd

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

Zhuang, Chao. “Stochastic approximation methods and applications in financial optimization problems.” 2008. Doctoral Dissertation, University of Georgia. Accessed October 18, 2019. http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd.

MLA Handbook (7^{th} Edition):

Zhuang, Chao. “Stochastic approximation methods and applications in financial optimization problems.” 2008. Web. 18 Oct 2019.

Vancouver:

Zhuang C. Stochastic approximation methods and applications in financial optimization problems. [Internet] [Doctoral dissertation]. University of Georgia; 2008. [cited 2019 Oct 18]. Available from: http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd.

Council of Science Editors:

Zhuang C. Stochastic approximation methods and applications in financial optimization problems. [Doctoral Dissertation]. University of Georgia; 2008. Available from: http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd

Texas A&M University

27.
Cheng, Yichen.
*Stochastic**Approximation* and Its Application in MCMC.

Degree: 2013, Texas A&M University

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

► *Stochastic* *approximation* has been widely used since first proposed by Herbert Robbins and Sutton Monro in 1951. It is an iterative *stochastic* method that attempts…
(more)

Subjects/Keywords: stochastic approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cheng, Y. (2013). Stochastic Approximation and Its Application in MCMC. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151016

Not specified: Masters Thesis or Doctoral Dissertation

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

Cheng, Yichen. “Stochastic Approximation and Its Application in MCMC.” 2013. Thesis, Texas A&M University. Accessed October 18, 2019. http://hdl.handle.net/1969.1/151016.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cheng, Yichen. “Stochastic Approximation and Its Application in MCMC.” 2013. Web. 18 Oct 2019.

Vancouver:

Cheng Y. Stochastic Approximation and Its Application in MCMC. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1969.1/151016.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheng Y. Stochastic Approximation and Its Application in MCMC. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151016

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

28. Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets.

Degree: MS, Industrial and Systems Engineering, 2011, University of Florida

URL: http://ufdc.ufl.edu/UFE0042952

► We study the polyhedral structure of an integer bilinear covering set, which appears in the formulation of various practical problems including staff scheduling. Starting from…
(more)

Subjects/Keywords: Algorithms; Integers; Linear programming; Mathematical models; Mathematical variables; Mathematics; Matrices; Objective functions; Operations research; Optimal solutions; bilinear – convex – facet – hull – integer – nonconvex – optimzatioin – polyhedral – relaxations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garg,Nitish. (2011). A Polyhedral Study of Integer Bilinear Covering Sets. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042952

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

Author name may be incomplete

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

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Masters Thesis, University of Florida. Accessed October 18, 2019. http://ufdc.ufl.edu/UFE0042952.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Web. 18 Oct 2019.

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

Author name may be incomplete

Vancouver:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Internet] [Masters thesis]. University of Florida; 2011. [cited 2019 Oct 18]. Available from: http://ufdc.ufl.edu/UFE0042952.

Author name may be incomplete

Council of Science Editors:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Masters Thesis]. University of Florida; 2011. Available from: http://ufdc.ufl.edu/UFE0042952

Author name may be incomplete

Washington State University

29.
[No author].
Interior Point Algorithms for *Stochastic* Semidefinite * Programming*
.

Degree: 2016, Washington State University

URL: http://hdl.handle.net/2376/12031

► Two-stage *stochastic* semidefinite *programming* with recourse (SSDP) has been proposed and studied during the last 10 years, as a two-stage *stochastic* counterpart of semidefinite *programming*…
(more)

Subjects/Keywords: Mathematics; Duality; Interior Point Algorithm; Stochastic Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2016). Interior Point Algorithms for Stochastic Semidefinite Programming . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/12031

Not specified: Masters Thesis or Doctoral Dissertation

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

author], [No. “Interior Point Algorithms for Stochastic Semidefinite Programming .” 2016. Thesis, Washington State University. Accessed October 18, 2019. http://hdl.handle.net/2376/12031.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “Interior Point Algorithms for Stochastic Semidefinite Programming .” 2016. Web. 18 Oct 2019.

Vancouver:

author] [. Interior Point Algorithms for Stochastic Semidefinite Programming . [Internet] [Thesis]. Washington State University; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2376/12031.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. Interior Point Algorithms for Stochastic Semidefinite Programming . [Thesis]. Washington State University; 2016. Available from: http://hdl.handle.net/2376/12031

Not specified: Masters Thesis or Doctoral Dissertation

30. Lima, Karla Roberta Pereira Sampaio. Recoloração convexa de caminhos.

Degree: PhD, Ciência da Computação, 2011, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23012012-144246/ ;

►

O foco central desta tese é o desenvolvimento de algoritmos para o problema de recoloração convexa de caminhos. Neste problema, é dado um caminho cujos… (more)

Subjects/Keywords: algoritmo de aproximação; approximation algorithm; branch-and-cut.; branchand- cut.; caminho; convex recoloring; facet; faceta; path; poliedro; polyhedron; recoloração convexa

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lima, K. R. P. S. (2011). Recoloração convexa de caminhos. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23012012-144246/ ;

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

Lima, Karla Roberta Pereira Sampaio. “Recoloração convexa de caminhos.” 2011. Doctoral Dissertation, University of São Paulo. Accessed October 18, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23012012-144246/ ;.

MLA Handbook (7^{th} Edition):

Lima, Karla Roberta Pereira Sampaio. “Recoloração convexa de caminhos.” 2011. Web. 18 Oct 2019.

Vancouver:

Lima KRPS. Recoloração convexa de caminhos. [Internet] [Doctoral dissertation]. University of São Paulo; 2011. [cited 2019 Oct 18]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23012012-144246/ ;.

Council of Science Editors:

Lima KRPS. Recoloração convexa de caminhos. [Doctoral Dissertation]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23012012-144246/ ;