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 181 – 210 of
27672 total matches.

◀ [1] … [4] [5] [6] [7] [8] [9] [10] … [923] ▶

Search Limiters

Dates

- 2015 – 2019 (8799)
- 2010 – 2014 (10393)
- 2005 – 2009 (5361)
- 2000 – 2004 (1774)
- 1995 – 1999 (876)
- 1990 – 1994 (618)
- 1985 – 1989 (558)
- 1980 – 1984 (418)
- 1975 – 1979 (275)
- 1970 – 1974 (278)

Universities

- Brno University of Technology (1140)
- University of Florida (784)
- ETH Zürich (587)
- University of São Paulo (586)
- Virginia Tech (485)
- Georgia Tech (470)
- National University of Singapore (426)
- NSYSU (420)
- University of Waterloo (392)
- Texas A&M University (384)
- Pontifical Catholic University of Rio de Janeiro (369)
- University of Illinois – Urbana-Champaign (353)
- Indian Institute of Science (303)
- Delft University of Technology (257)
- The Ohio State University (242)

Department

- Computer Science (812)
- Informatique (459)
- Electrical and Computer Engineering (440)
- Mathematics (411)
- Electrical Engineering (409)
- Industrial and Systems Engineering (330)
- Mechanical Engineering (249)
- Computer Science and Engineering (205)
- Statistics (182)
- Mathématiques (158)
- Industrial Engineering (147)
- Physics (137)
- Applied Mathematics (136)
- Civil Engineering (127)
- Department of Computer Science (111)

Degrees

- PhD (5963)
- MS (2066)
- Docteur es (1851)
- Master (572)
- Mestrado (331)
- MA (142)
- MS(M.S.) (60)
- M. Phil. (52)
- MSc (50)
- MSin Computer Science (48)
- MSin Engineering (42)
- M.S (39)
- EdD (35)
- M. Eng. (29)
- MASc (19)

Levels

- doctoral (10120)
- masters (4264)
- thesis (393)
- doctor of philosophy ph.d. (60)
- project (39)
- doctor of philosophy (ph.d.) (37)
- dissertation (13)

Languages

Country

- US (9640)
- Canada (2109)
- Brazil (2002)
- France (1851)
- UK (1427)
- Czech Republic (1147)
- Sweden (1125)
- Australia (1000)
- Netherlands (767)
- Greece (749)
- Switzerland (736)
- India (648)
- Singapore (440)
- South Africa (424)
- Taiwan (420)

▼ Search Limiters

Georgia Tech

181.
Angulo Olivares, Gustavo, I.
Integer *programming* approaches for semicontinuous and *stochastic* optimization.

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

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

► This thesis concerns the application of mixed-integer *programming* techniques to solve special classes of network flow problems and *stochastic* integer programs. We draw tools from…
(more)

Subjects/Keywords: Integer programming; Stochastic programming; Forbidden vertices; Mathematical optimization; Dynamic programming; Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Angulo Olivares, Gustavo, I. (2014). Integer programming approaches for semicontinuous and stochastic optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51862

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

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/51862.

MLA Handbook (7^{th} Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 14 Dec 2019.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/51862.

Council of Science Editors:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51862

University of Waterloo

182. Au, Yu Hin. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.

Degree: 2014, University of Waterloo

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

► In both mathematical research and real-life, we often encounter problems that can be framed as finding the best solution among a collection of discrete choices.…
(more)

Subjects/Keywords: combinatorial optimization; lift-and-project methods; integer programming; semidefinite programming; convex relaxations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Au, Y. H. (2014). A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8662

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

Au, Yu Hin. “A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.” 2014. Thesis, University of Waterloo. Accessed December 14, 2019. http://hdl.handle.net/10012/8662.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Au, Yu Hin. “A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.” 2014. Web. 14 Dec 2019.

Vancouver:

Au YH. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10012/8662.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Au YH. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8662

Not specified: Masters Thesis or Doctoral Dissertation

University of Colorado

183.
Gronski, Jessica.
Non-*Convex* Optimization and Applications to Bilinear *Programming* and Super-Resolution Imaging.

Degree: PhD, 2019, University of Colorado

URL: https://scholar.colorado.edu/appm_gradetds/154

► Bilinear programs and Phase Retrieval are two instances of *nonconvex* problems that arise in engineering and physical applications, and both occur with their fundamental…
(more)

Subjects/Keywords: bilinear programming; non-convex optimization; quadratic programming; super-resolution imaging; Applied Mathematics; Computer Sciences; Optics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gronski, J. (2019). Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/154

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

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Doctoral Dissertation, University of Colorado. Accessed December 14, 2019. https://scholar.colorado.edu/appm_gradetds/154.

MLA Handbook (7^{th} Edition):

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Web. 14 Dec 2019.

Vancouver:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2019 Dec 14]. Available from: https://scholar.colorado.edu/appm_gradetds/154.

Council of Science Editors:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/154

University of California – Berkeley

184. Hoburg, Warren Woodrow. Aircraft Design Optimization as a Geometric Program.

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

URL: http://www.escholarship.org/uc/item/0928939m

► Recent advances in *convex* optimization make it possible to solve certain classes of constrained optimization problems reliably and efficiently.These techniques offer significant advantages over general…
(more)

Subjects/Keywords: Aerospace engineering; Operations research; Mathematics; aircraft design; convex optimization; geometric programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hoburg, W. W. (2013). Aircraft Design Optimization as a Geometric Program. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0928939m

Not specified: Masters Thesis or Doctoral Dissertation

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

Hoburg, Warren Woodrow. “Aircraft Design Optimization as a Geometric Program.” 2013. Thesis, University of California – Berkeley. Accessed December 14, 2019. http://www.escholarship.org/uc/item/0928939m.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hoburg, Warren Woodrow. “Aircraft Design Optimization as a Geometric Program.” 2013. Web. 14 Dec 2019.

Vancouver:

Hoburg WW. Aircraft Design Optimization as a Geometric Program. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Dec 14]. Available from: http://www.escholarship.org/uc/item/0928939m.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hoburg WW. Aircraft Design Optimization as a Geometric Program. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/0928939m

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

185. Voroninski, Vladislav. PhaseLift: A Novel Methodology for Phase Retrieval.

Degree: Mathematics, 2013, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/5wq5c4bp

► In many physical settings, it is difficult or impossible to measure the phase of a signal. The problem is then to recover a signal from…
(more)

Subjects/Keywords: Mathematics; Applied mathematics; convex programming; matrix completion; phase retrieval; random matrices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Voroninski, V. (2013). PhaseLift: A Novel Methodology for Phase Retrieval. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5wq5c4bp

Not specified: Masters Thesis or Doctoral Dissertation

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

Voroninski, Vladislav. “PhaseLift: A Novel Methodology for Phase Retrieval.” 2013. Thesis, University of California – Berkeley. Accessed December 14, 2019. http://www.escholarship.org/uc/item/5wq5c4bp.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Voroninski, Vladislav. “PhaseLift: A Novel Methodology for Phase Retrieval.” 2013. Web. 14 Dec 2019.

Vancouver:

Voroninski V. PhaseLift: A Novel Methodology for Phase Retrieval. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Dec 14]. Available from: http://www.escholarship.org/uc/item/5wq5c4bp.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Voroninski V. PhaseLift: A Novel Methodology for Phase Retrieval. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/5wq5c4bp

Not specified: Masters Thesis or Doctoral Dissertation

Lehigh University

186.
Kuang, Xiaolong.
Conic *Programming* Approaches for Polynomial Optimization: Theory and Applications.

Degree: PhD, Industrial Engineering, 2017, Lehigh University

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

► Historically, polynomials are among the most popular class of functions used for empirical modeling in science and engineering. Polynomials are easy to evaluate, appear naturally…
(more)

Subjects/Keywords: Conic Programming; Convex Optimization; Polynomial Optimization; Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kuang, X. (2017). Conic Programming Approaches for Polynomial Optimization: Theory and Applications. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2952

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

Kuang, Xiaolong. “Conic Programming Approaches for Polynomial Optimization: Theory and Applications.” 2017. Doctoral Dissertation, Lehigh University. Accessed December 14, 2019. https://preserve.lehigh.edu/etd/2952.

MLA Handbook (7^{th} Edition):

Kuang, Xiaolong. “Conic Programming Approaches for Polynomial Optimization: Theory and Applications.” 2017. Web. 14 Dec 2019.

Vancouver:

Kuang X. Conic Programming Approaches for Polynomial Optimization: Theory and Applications. [Internet] [Doctoral dissertation]. Lehigh University; 2017. [cited 2019 Dec 14]. Available from: https://preserve.lehigh.edu/etd/2952.

Council of Science Editors:

Kuang X. Conic Programming Approaches for Polynomial Optimization: Theory and Applications. [Doctoral Dissertation]. Lehigh University; 2017. Available from: https://preserve.lehigh.edu/etd/2952

University of Illinois – Urbana-Champaign

187.
Essick V, Raymond B.
Receding-horizon switched linear system design: a semidefinite *programming* approach with distributed computation.

Degree: PhD, Mechanical Engineering, 2018, University of Illinois – Urbana-Champaign

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

► This dissertation presents a framework for analysis and controller synthesis problems for switched linear systems. These are multi-modal systems whose parameters vary within a finite…
(more)

Subjects/Keywords: Switched linear systems; convex control; distributed semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Essick V, R. B. (2018). Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102412

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

Essick V, Raymond B. “Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 14, 2019. http://hdl.handle.net/2142/102412.

MLA Handbook (7^{th} Edition):

Essick V, Raymond B. “Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation.” 2018. Web. 14 Dec 2019.

Vancouver:

Essick V RB. Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2142/102412.

Council of Science Editors:

Essick V RB. Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102412

King Abdullah University of Science and Technology

188.
Espinoza, Francisco.
A New Interpolation Approach for Linearly Constrained *Convex* Optimization.

Degree: 2012, King Abdullah University of Science and Technology

URL: http://hdl.handle.net/10754/244891

► In this thesis we propose a new class of Linearly Constrained *Convex* Optimization methods based on the use of a generalization of Shepard's interpolation formula.…
(more)

Subjects/Keywords: Optimization; Convex; Interpolation; Shepard's method; Linear constraints; Quadratic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Espinoza, F. (2012). A New Interpolation Approach for Linearly Constrained Convex Optimization. (Thesis). King Abdullah University of Science and Technology. Retrieved from http://hdl.handle.net/10754/244891

Not specified: Masters Thesis or Doctoral Dissertation

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

Espinoza, Francisco. “A New Interpolation Approach for Linearly Constrained Convex Optimization.” 2012. Thesis, King Abdullah University of Science and Technology. Accessed December 14, 2019. http://hdl.handle.net/10754/244891.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Espinoza, Francisco. “A New Interpolation Approach for Linearly Constrained Convex Optimization.” 2012. Web. 14 Dec 2019.

Vancouver:

Espinoza F. A New Interpolation Approach for Linearly Constrained Convex Optimization. [Internet] [Thesis]. King Abdullah University of Science and Technology; 2012. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10754/244891.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Espinoza F. A New Interpolation Approach for Linearly Constrained Convex Optimization. [Thesis]. King Abdullah University of Science and Technology; 2012. Available from: http://hdl.handle.net/10754/244891

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

189. Morgan, Daniel James. Guidance and control of swarms of spacecraft.

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

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

► There has been considerable interest in formation flying spacecraft due to their potential to perform certain tasks at a cheaper cost than monolithic spacecraft. Formation…
(more)

Subjects/Keywords: swarms of spacecraft; sequential convex programming; model predictive control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Morgan, D. J. (2015). Guidance and control of swarms of spacecraft. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78367

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

Morgan, Daniel James. “Guidance and control of swarms of spacecraft.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 14, 2019. http://hdl.handle.net/2142/78367.

MLA Handbook (7^{th} Edition):

Morgan, Daniel James. “Guidance and control of swarms of spacecraft.” 2015. Web. 14 Dec 2019.

Vancouver:

Morgan DJ. Guidance and control of swarms of spacecraft. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2142/78367.

Council of Science Editors:

Morgan DJ. Guidance and control of swarms of spacecraft. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78367

University of Iowa

190.
Dong, Hongbo.
Copositive *programming*: separation and relaxations.

Degree: PhD, Applied Mathematical and Computational Sciences, 2011, University of Iowa

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

► A large portion of research in science and engineering, as well as in business, concerns one similar problem: how to make things "better”? Once…
(more)

Subjects/Keywords: Completely Positive Cone; Convex Relaxation; Copositive Programming; Separation; Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dong, H. (2011). Copositive programming: separation and relaxations. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/2692

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

Dong, Hongbo. “Copositive programming: separation and relaxations.” 2011. Doctoral Dissertation, University of Iowa. Accessed December 14, 2019. https://ir.uiowa.edu/etd/2692.

MLA Handbook (7^{th} Edition):

Dong, Hongbo. “Copositive programming: separation and relaxations.” 2011. Web. 14 Dec 2019.

Vancouver:

Dong H. Copositive programming: separation and relaxations. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2019 Dec 14]. Available from: https://ir.uiowa.edu/etd/2692.

Council of Science Editors:

Dong H. Copositive programming: separation and relaxations. [Doctoral Dissertation]. University of Iowa; 2011. Available from: https://ir.uiowa.edu/etd/2692

Princeton University

191. Pang, Haotian. The Application of Optimization Techniques in Machine Learning .

Degree: PhD, 2017, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01fb494c071

► The past decades have witnessed significantly progress in machine learning, and solving these problems requires the advancing in optimization techniques. High dimensional sparse learning has…
(more)

Subjects/Keywords: Convex Optimization; Linear Programming; Machine Learning; Online Learning; Parametric Simplex Method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pang, H. (2017). The Application of Optimization Techniques in Machine Learning . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01fb494c071

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

Pang, Haotian. “The Application of Optimization Techniques in Machine Learning .” 2017. Doctoral Dissertation, Princeton University. Accessed December 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01fb494c071.

MLA Handbook (7^{th} Edition):

Pang, Haotian. “The Application of Optimization Techniques in Machine Learning .” 2017. Web. 14 Dec 2019.

Vancouver:

Pang H. The Application of Optimization Techniques in Machine Learning . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Dec 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01fb494c071.

Council of Science Editors:

Pang H. The Application of Optimization Techniques in Machine Learning . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp01fb494c071

Princeton University

192.
Hall, Georgina.
Optimization over Nonnegative and *Convex* Polynomials with and without Semidefinite * Programming*
.

Degree: PhD, 2018, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp014m90dz20p

► The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning,…
(more)

Subjects/Keywords: Convex polynomials; Nonnegative polynomials; Semidefinite programming; Sum of squares optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hall, G. (2018). Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp014m90dz20p

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

Hall, Georgina. “Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming .” 2018. Doctoral Dissertation, Princeton University. Accessed December 14, 2019. http://arks.princeton.edu/ark:/88435/dsp014m90dz20p.

MLA Handbook (7^{th} Edition):

Hall, Georgina. “Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming .” 2018. Web. 14 Dec 2019.

Vancouver:

Hall G. Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Dec 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp014m90dz20p.

Council of Science Editors:

Hall G. Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp014m90dz20p

Loughborough University

193.
Yevik, Andrei.
Numerical approximations to the stationary solutions of *stochastic* differential equations.

Degree: 2011, Loughborough University

URL: https://dspace.lboro.ac.uk/2134/7777 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551266

► This thesis investigates the possibility of approximating stationary solutions of *stochastic* differential equations using numerical methods. We consider a particular class of *stochastic* differential equations,…
(more)

Subjects/Keywords: 511.4; Random dynamical system : Stochastic differential equation : Stochastic stationery solution : Numerical approximation : Euler’s method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yevik, A. (2011). Numerical approximations to the stationary solutions of stochastic differential equations. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/7777 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551266

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

Yevik, Andrei. “Numerical approximations to the stationary solutions of stochastic differential equations.” 2011. Doctoral Dissertation, Loughborough University. Accessed December 14, 2019. https://dspace.lboro.ac.uk/2134/7777 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551266.

MLA Handbook (7^{th} Edition):

Yevik, Andrei. “Numerical approximations to the stationary solutions of stochastic differential equations.” 2011. Web. 14 Dec 2019.

Vancouver:

Yevik A. Numerical approximations to the stationary solutions of stochastic differential equations. [Internet] [Doctoral dissertation]. Loughborough University; 2011. [cited 2019 Dec 14]. Available from: https://dspace.lboro.ac.uk/2134/7777 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551266.

Council of Science Editors:

Yevik A. Numerical approximations to the stationary solutions of stochastic differential equations. [Doctoral Dissertation]. Loughborough University; 2011. Available from: https://dspace.lboro.ac.uk/2134/7777 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551266

Loughborough University

194.
Yevik, Andrei.
Numerical approximations to the stationary solutions of *stochastic* differential equations.

Degree: PhD, 2011, Loughborough University

URL: http://hdl.handle.net/2134/7777

► This thesis investigates the possibility of approximating stationary solutions of *stochastic* differential equations using numerical methods. We consider a particular class of *stochastic* differential equations,…
(more)

Subjects/Keywords: 511.4; Random dynamical system; Stochastic differential equation; Stochastic stationery solution; Numerical approximation; Euler’s method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yevik, A. (2011). Numerical approximations to the stationary solutions of stochastic differential equations. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/7777

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

Yevik, Andrei. “Numerical approximations to the stationary solutions of stochastic differential equations.” 2011. Doctoral Dissertation, Loughborough University. Accessed December 14, 2019. http://hdl.handle.net/2134/7777.

MLA Handbook (7^{th} Edition):

Yevik, Andrei. “Numerical approximations to the stationary solutions of stochastic differential equations.” 2011. Web. 14 Dec 2019.

Vancouver:

Yevik A. Numerical approximations to the stationary solutions of stochastic differential equations. [Internet] [Doctoral dissertation]. Loughborough University; 2011. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2134/7777.

Council of Science Editors:

Yevik A. Numerical approximations to the stationary solutions of stochastic differential equations. [Doctoral Dissertation]. Loughborough University; 2011. Available from: http://hdl.handle.net/2134/7777

Texas A&M University

195.
Zhang, Liqing.
* Stochastic* Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.

Degree: 2011, Texas A&M University

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

► Recent supply chain literature and practice recognize that significant cost savings can be achieved by coordinating inventory and transportation decisions. Although the existing literature on…
(more)

Subjects/Keywords: Stochastic dynamic programming; Shipment consolidation; Inventory/production

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, L. (2011). Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150943

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Thesis, Texas A&M University. Accessed December 14, 2019. http://hdl.handle.net/1969.1/150943.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Web. 14 Dec 2019.

Vancouver:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1969.1/150943.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/150943

Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

196.
Schulze, Tim.
*Stochastic**programming* for hydro-thermal unit commitment.

Degree: PhD, 2015, University of Edinburgh

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

► In recent years the deregulation of energy markets and expansion of volatile renewable energy supplies has triggered an increased interest in *stochastic* optimization models for…
(more)

Subjects/Keywords: 519.6; stochastic programming; optimization; unit commitment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schulze, T. (2015). Stochastic programming for hydro-thermal unit commitment. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15775

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

Schulze, Tim. “Stochastic programming for hydro-thermal unit commitment.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed December 14, 2019. http://hdl.handle.net/1842/15775.

MLA Handbook (7^{th} Edition):

Schulze, Tim. “Stochastic programming for hydro-thermal unit commitment.” 2015. Web. 14 Dec 2019.

Vancouver:

Schulze T. Stochastic programming for hydro-thermal unit commitment. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1842/15775.

Council of Science Editors:

Schulze T. Stochastic programming for hydro-thermal unit commitment. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/15775

University of Edinburgh

197. Yang, Xinan. Top-percentile traffic routing problem.

Degree: 2012, University of Edinburgh

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

► Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via multiple networks. This connectivity enhances the network reliability and…
(more)

Subjects/Keywords: 621.382; top-percentile; stochastic; approximate dynamic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, X. (2012). Top-percentile traffic routing problem. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5883

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

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Doctoral Dissertation, University of Edinburgh. Accessed December 14, 2019. http://hdl.handle.net/1842/5883.

MLA Handbook (7^{th} Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Web. 14 Dec 2019.

Vancouver:

Yang X. Top-percentile traffic routing problem. [Internet] [Doctoral dissertation]. University of Edinburgh; 2012. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1842/5883.

Council of Science Editors:

Yang X. Top-percentile traffic routing problem. [Doctoral Dissertation]. University of Edinburgh; 2012. Available from: http://hdl.handle.net/1842/5883

Georgia Tech

198.
Ye, Fan.
Information relaxation in *stochastic* optimal control.

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

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

► Dynamic *programming* is a principal method for analyzing *stochastic* optimal control problems. However, the exact computation of dynamic *programming* can be intractable in large-scale problems…
(more)

Subjects/Keywords: Dynamic programming; Stochastic control; Information relaxation; Duality

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ye, F. (2015). Information relaxation in stochastic optimal control. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55511

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

Ye, Fan. “Information relaxation in stochastic optimal control.” 2015. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/55511.

MLA Handbook (7^{th} Edition):

Ye, Fan. “Information relaxation in stochastic optimal control.” 2015. Web. 14 Dec 2019.

Vancouver:

Ye F. Information relaxation in stochastic optimal control. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/55511.

Council of Science Editors:

Ye F. Information relaxation in stochastic optimal control. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/55511

199. Lamontagne, Jonathan. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .

Degree: 2015, Cornell University

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

► This thesis focuses on optimization techniques for multi-reservoir hydropower systems operation, with a particular concern with the representation and impact of uncertainty. The thesis reports…
(more)

Subjects/Keywords: Dynamic Programming; Stochastic Optimization; Uncertainty Analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lamontagne, J. (2015). Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/39482

Not specified: Masters Thesis or Doctoral Dissertation

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

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .” 2015. Thesis, Cornell University. Accessed December 14, 2019. http://hdl.handle.net/1813/39482.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .” 2015. Web. 14 Dec 2019.

Vancouver:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . [Internet] [Thesis]. Cornell University; 2015. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1813/39482.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/39482

Not specified: Masters Thesis or Doctoral Dissertation

University of Cambridge

200.
Hult, Edward Eric.
* Stochastic* hub and spoke networks.

Degree: PhD, 2011, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/240611 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926

► Transportation systems such as mail, freight, passenger and even telecommunication systems most often employ a hub and spoke network structure since correctly designed they give…
(more)

Subjects/Keywords: 658; Stochastic programming; Hub and spoke networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hult, E. E. (2011). Stochastic hub and spoke networks. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/240611 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926

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

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Doctoral Dissertation, University of Cambridge. Accessed December 14, 2019. https://www.repository.cam.ac.uk/handle/1810/240611 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926.

MLA Handbook (7^{th} Edition):

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Web. 14 Dec 2019.

Vancouver:

Hult EE. Stochastic hub and spoke networks. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2019 Dec 14]. Available from: https://www.repository.cam.ac.uk/handle/1810/240611 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926.

Council of Science Editors:

Hult EE. Stochastic hub and spoke networks. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: https://www.repository.cam.ac.uk/handle/1810/240611 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926

Kansas State University

201.
Newell, Sarah.
Optimizing
daily fantasy sports contests through *stochastic* integer
* programming*.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2017, Kansas State University

URL: http://hdl.handle.net/2097/35393

► The possibility of becoming a millionaire attracts over 200,000 daily fantasy sports (DFS) contest entries each Sunday of the NFL season. Millions of people play…
(more)

Subjects/Keywords: Optimization; Stochastic integer programming; Fantasy sports

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Newell, S. (2017). Optimizing daily fantasy sports contests through stochastic integer programming. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/35393

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

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Masters Thesis, Kansas State University. Accessed December 14, 2019. http://hdl.handle.net/2097/35393.

MLA Handbook (7^{th} Edition):

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Web. 14 Dec 2019.

Vancouver:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Internet] [Masters thesis]. Kansas State University; 2017. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2097/35393.

Council of Science Editors:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Masters Thesis]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/35393

Rutgers University

202.
Collado, Ricardo, 1975-.
Scenario decomposition of risk-averse *stochastic* optimization problems.

Degree: PhD, Operations Research, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

►

In the last decade the theory of coherent risk measures established itself as an alternative to expected utility models of risk averse preferences in *stochastic*…
(more)

Subjects/Keywords: Stochastic programming; Decomposition (Mathematics); Risk-return relationships

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Collado, Ricardo, 1. (2010). Scenario decomposition of risk-averse stochastic optimization problems. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

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

Collado, Ricardo, 1975-. “Scenario decomposition of risk-averse stochastic optimization problems.” 2010. Doctoral Dissertation, Rutgers University. Accessed December 14, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283.

MLA Handbook (7^{th} Edition):

Collado, Ricardo, 1975-. “Scenario decomposition of risk-averse stochastic optimization problems.” 2010. Web. 14 Dec 2019.

Vancouver:

Collado, Ricardo 1. Scenario decomposition of risk-averse stochastic optimization problems. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Dec 14]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283.

Council of Science Editors:

Collado, Ricardo 1. Scenario decomposition of risk-averse stochastic optimization problems. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

203. LONG YIN. Operational model for empty container repositioning.

Degree: 2012, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/34778

Subjects/Keywords: Empty Container Repositioning; Stochastic Programming; Sample Average Approximation; Scenario Decomposition; Progressive Hedging; Supersaturated Desig

Record Details Similar Records

❌

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

APA (6^{th} Edition):

YIN, L. (2012). Operational model for empty container repositioning. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/34778

Not specified: Masters Thesis or Doctoral Dissertation

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

YIN, LONG. “Operational model for empty container repositioning.” 2012. Thesis, National University of Singapore. Accessed December 14, 2019. http://scholarbank.nus.edu.sg/handle/10635/34778.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

YIN, LONG. “Operational model for empty container repositioning.” 2012. Web. 14 Dec 2019.

Vancouver:

YIN L. Operational model for empty container repositioning. [Internet] [Thesis]. National University of Singapore; 2012. [cited 2019 Dec 14]. Available from: http://scholarbank.nus.edu.sg/handle/10635/34778.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YIN L. Operational model for empty container repositioning. [Thesis]. National University of Singapore; 2012. Available from: http://scholarbank.nus.edu.sg/handle/10635/34778

Not specified: Masters Thesis or Doctoral Dissertation

University of Central Florida

204.
Graham, Don.
A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear *Programming* Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express.

Degree: 2013, University of Central Florida

URL: https://stars.library.ucf.edu/etd/2749

► As urban population across the globe increases, the demand for adequate transportation grows. Several strategies have been suggested as a solution to the congestion which…
(more)

Subjects/Keywords: Dynamic pricing; congestion pricing; hot lanes; non linear programming; network; stochastic approximation; algorithms; fdsa; ga; sa; spsa; i 95 express; anova; demand forecast; vector auto regression; system optimal; Civil Engineering; Engineering; Dissertations, Academic – Engineering and Computer Science, Engineering and Computer Science – Dissertations, Academic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Graham, D. (2013). A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/2749

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

Graham, Don. “A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express.” 2013. Doctoral Dissertation, University of Central Florida. Accessed December 14, 2019. https://stars.library.ucf.edu/etd/2749.

MLA Handbook (7^{th} Edition):

Graham, Don. “A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express.” 2013. Web. 14 Dec 2019.

Vancouver:

Graham D. A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express. [Internet] [Doctoral dissertation]. University of Central Florida; 2013. [cited 2019 Dec 14]. Available from: https://stars.library.ucf.edu/etd/2749.

Council of Science Editors:

Graham D. A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express. [Doctoral Dissertation]. University of Central Florida; 2013. Available from: https://stars.library.ucf.edu/etd/2749

205.
Pierre-Louis, Péguy.
Algorithmic Developments in Monte Carlo Sampling-Based Methods for *Stochastic* * Programming*
.

Degree: 2012, University of Arizona

URL: http://hdl.handle.net/10150/228433

► Monte Carlo sampling-based methods are frequently used in *stochastic* *programming* when exact solution is not possible. In this dissertation, we develop two sets of Monte…
(more)

Subjects/Keywords: Confidence Intervals; Monte Carlo; Stochastic Programming; Stopping Rules; Variance Reduction; Systems & Industrial Engineering; Approximation Methods

…sampling-based methods are frequently used in *stochastic* *programming*
when exact solution is not… …are many approaches to account for uncertainty in decision making.
*Stochastic* *programming*… …variables. Within the *stochastic* *programming*
framework, in this dissertation, we consider models… …deterministically-valid bounding algorithms for *stochastic* *programming* and we review
these in the… …been well studied in statistics and simulation, in *stochastic* *programming*, either a fixed…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pierre-Louis, P. (2012). Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/228433

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

Pierre-Louis, Péguy. “Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming .” 2012. Doctoral Dissertation, University of Arizona. Accessed December 14, 2019. http://hdl.handle.net/10150/228433.

MLA Handbook (7^{th} Edition):

Pierre-Louis, Péguy. “Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming .” 2012. Web. 14 Dec 2019.

Vancouver:

Pierre-Louis P. Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming . [Internet] [Doctoral dissertation]. University of Arizona; 2012. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10150/228433.

Council of Science Editors:

Pierre-Louis P. Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming . [Doctoral Dissertation]. University of Arizona; 2012. Available from: http://hdl.handle.net/10150/228433

Université Catholique de Louvain

206.
Devolder, Olivier.
Exactness, inexactness and stochasticity in first-order methods for large-scale *convex* optimization.

Degree: 2013, Université Catholique de Louvain

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

►

The goal of this thesis is to extend the analysis and the scope of first-order methods of smooth *convex* optimization. We consider three challenging difficulties:…
(more)

Subjects/Keywords: Convex optimization; First-order methods; Complexity analysis; Inexact first-order information; Gradient methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Devolder, O. (2013). Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/128257

Not specified: Masters Thesis or Doctoral Dissertation

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

Devolder, Olivier. “Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization.” 2013. Thesis, Université Catholique de Louvain. Accessed December 14, 2019. http://hdl.handle.net/2078.1/128257.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Devolder, Olivier. “Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization.” 2013. Web. 14 Dec 2019.

Vancouver:

Devolder O. Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. [Internet] [Thesis]. Université Catholique de Louvain; 2013. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2078.1/128257.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Devolder O. Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. [Thesis]. Université Catholique de Louvain; 2013. Available from: http://hdl.handle.net/2078.1/128257

Not specified: Masters Thesis or Doctoral Dissertation

Boston University

207. Aksoylar, Cem. Discovery of low-dimensional structure in high-dimensional inference problems.

Degree: PhD, Electrical & Computer Engineering, 2017, Boston University

URL: http://hdl.handle.net/2144/20836

► Many learning and inference problems involve high-dimensional data such as images, video or genomic data, which cannot be processed efficiently using conventional methods due to…
(more)

Subjects/Keywords: Electrical engineering; Convex optimization; Learning on networks; Sparse recovery; Statistical complexity; Statistical signal processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aksoylar, C. (2017). Discovery of low-dimensional structure in high-dimensional inference problems. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/20836

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

Aksoylar, Cem. “Discovery of low-dimensional structure in high-dimensional inference problems.” 2017. Doctoral Dissertation, Boston University. Accessed December 14, 2019. http://hdl.handle.net/2144/20836.

MLA Handbook (7^{th} Edition):

Aksoylar, Cem. “Discovery of low-dimensional structure in high-dimensional inference problems.” 2017. Web. 14 Dec 2019.

Vancouver:

Aksoylar C. Discovery of low-dimensional structure in high-dimensional inference problems. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2144/20836.

Council of Science Editors:

Aksoylar C. Discovery of low-dimensional structure in high-dimensional inference problems. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/20836

ETH Zürich

208. Schurr, Ingo A. Unique sink orientations of cubes.

Degree: 2004, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/72738

Subjects/Keywords: CONVEX POLYGONS + CONVEX POLYTOPES (GEOMETRY); KONVEXE POLYGONE + KONVEXE POLYTOPE (GEOMETRIE); DIRECTED GRAPHS (GRAPH THEORY); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); LINEARE OPTIMIERUNG (OPERATIONS RESEARCH); ALGORITHMIC COMPLEXITY (MATHEMATICS); LINEAR PROGRAMMING (OPERATIONS RESEARCH); GERICHTETE GRAPHEN (GRAPHENTHEORIE); info:eu-repo/classification/ddc/510; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schurr, I. A. (2004). Unique sink orientations of cubes. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72738

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

Schurr, Ingo A. “Unique sink orientations of cubes.” 2004. Doctoral Dissertation, ETH Zürich. Accessed December 14, 2019. http://hdl.handle.net/20.500.11850/72738.

MLA Handbook (7^{th} Edition):

Schurr, Ingo A. “Unique sink orientations of cubes.” 2004. Web. 14 Dec 2019.

Vancouver:

Schurr IA. Unique sink orientations of cubes. [Internet] [Doctoral dissertation]. ETH Zürich; 2004. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/20.500.11850/72738.

Council of Science Editors:

Schurr IA. Unique sink orientations of cubes. [Doctoral Dissertation]. ETH Zürich; 2004. Available from: http://hdl.handle.net/20.500.11850/72738

University of South Africa

209. Ondo, Guy-Roger Abessolo. Mathematical methods for portfolio management .

Degree: 2009, University of South Africa

URL: http://hdl.handle.net/10500/784

► Portfolio Management is the process of allocating an investor's wealth to in vestment opportunities over a given planning period. Not only should Portfolio Management be…
(more)

Subjects/Keywords: Approximation schemes; Extreme value theory; Importance sampling; Nested decomposition; Portfolio management; Postoptimality analysis; Progressive hedging; Scenario aggregation; Stochastic programming; Stochastic Quasi-gradient; Value-at-risk

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ondo, G. A. (2009). Mathematical methods for portfolio management . (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/784

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

Ondo, Guy-Roger Abessolo. “Mathematical methods for portfolio management .” 2009. Masters Thesis, University of South Africa. Accessed December 14, 2019. http://hdl.handle.net/10500/784.

MLA Handbook (7^{th} Edition):

Ondo, Guy-Roger Abessolo. “Mathematical methods for portfolio management .” 2009. Web. 14 Dec 2019.

Vancouver:

Ondo GA. Mathematical methods for portfolio management . [Internet] [Masters thesis]. University of South Africa; 2009. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10500/784.

Council of Science Editors:

Ondo GA. Mathematical methods for portfolio management . [Masters Thesis]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/784

210.
Ortiz Diaz, Camilo.
Block-decomposition and accelerated gradient methods for large-scale *convex* optimization.

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

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

► In this thesis, we develop block-decomposition (BD) methods and variants of accelerated *9gradient methods for large-scale conic *programming* and *convex* optimization, respectively. The BD methods,…
(more)

Subjects/Keywords: Semidefinite programing; Large-scale; Conjugate gradient; Accelerated gradient methods; Convex optimization; Quadratic programming; Complexity; Proximal; Extragradient; Block-decomposition; Conic optimization

…accelerated framework
for a special class of *convex* *programming* problems whose objective function φ… …an exact BD method for composite *convex* optimization with applications to conic *programming*… …iteration of *Algorithm* 3.1 . . . . . . . . . . . . . . .
99
∗ and ξ =ξ ∗ vs θ =ξ =1 vs θ =ξ =1… …*convex*
functions. Every year, multiple applications are found which require specialized methods… …that solve large non-linear *convex* optimization problems. These include applications in…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ortiz Diaz, C. (2014). Block-decomposition and accelerated gradient methods for large-scale convex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53438

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

Ortiz Diaz, Camilo. “Block-decomposition and accelerated gradient methods for large-scale convex optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/53438.

MLA Handbook (7^{th} Edition):

Ortiz Diaz, Camilo. “Block-decomposition and accelerated gradient methods for large-scale convex optimization.” 2014. Web. 14 Dec 2019.

Vancouver:

Ortiz Diaz C. Block-decomposition and accelerated gradient methods for large-scale convex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/53438.

Council of Science Editors:

Ortiz Diaz C. Block-decomposition and accelerated gradient methods for large-scale convex optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53438