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 61 – 90 of
27672 total matches.

◀ [1] [2] [3] [4] [5] … [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

McGill University

61. Turner, Bella Tobie. Solving discrete minimax problems with constraints.

Degree: MS, Department of Mathematics, 1976, McGill University

URL: http://digitool.library.mcgill.ca/thesisfile52023.pdf

Subjects/Keywords: Convex programming.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Turner, B. T. (1976). Solving discrete minimax problems with constraints. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile52023.pdf

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

Turner, Bella Tobie. “Solving discrete minimax problems with constraints.” 1976. Masters Thesis, McGill University. Accessed December 14, 2019. http://digitool.library.mcgill.ca/thesisfile52023.pdf.

MLA Handbook (7^{th} Edition):

Turner, Bella Tobie. “Solving discrete minimax problems with constraints.” 1976. Web. 14 Dec 2019.

Vancouver:

Turner BT. Solving discrete minimax problems with constraints. [Internet] [Masters thesis]. McGill University; 1976. [cited 2019 Dec 14]. Available from: http://digitool.library.mcgill.ca/thesisfile52023.pdf.

Council of Science Editors:

Turner BT. Solving discrete minimax problems with constraints. [Masters Thesis]. McGill University; 1976. Available from: http://digitool.library.mcgill.ca/thesisfile52023.pdf

University of British Columbia

62.
Seidel, Raimund.
A *convex* hull *algorithm* optimal for point sets in even dimensions
.

Degree: 1981, University of British Columbia

URL: http://hdl.handle.net/2429/22652

► Finding the *convex* hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of…
(more)

Subjects/Keywords: Convex programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Seidel, R. (1981). A convex hull algorithm optimal for point sets in even dimensions . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22652

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

Seidel, Raimund. “A convex hull algorithm optimal for point sets in even dimensions .” 1981. Thesis, University of British Columbia. Accessed December 14, 2019. http://hdl.handle.net/2429/22652.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Seidel, Raimund. “A convex hull algorithm optimal for point sets in even dimensions .” 1981. Web. 14 Dec 2019.

Vancouver:

Seidel R. A convex hull algorithm optimal for point sets in even dimensions . [Internet] [Thesis]. University of British Columbia; 1981. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2429/22652.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seidel R. A convex hull algorithm optimal for point sets in even dimensions . [Thesis]. University of British Columbia; 1981. Available from: http://hdl.handle.net/2429/22652

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

63. Kazemzadeh, Narges. Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty.

Degree: 2016, Iowa State University

URL: https://lib.dr.iastate.edu/etd/15944

► Unit commitment (UC) seeks the most cost effective generator commitment schedule for an electric power system to meet net load while satisfying the operational constraints…
(more)

Subjects/Keywords: Conditional Value at Risk; Renewal Reward Approximation; Robust Optimization; Stochastic Programming; Unit Commitment; Industrial Engineering; Operational Research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kazemzadeh, N. (2016). Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15944

Not specified: Masters Thesis or Doctoral Dissertation

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

Kazemzadeh, Narges. “Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty.” 2016. Thesis, Iowa State University. Accessed December 14, 2019. https://lib.dr.iastate.edu/etd/15944.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kazemzadeh, Narges. “Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty.” 2016. Web. 14 Dec 2019.

Vancouver:

Kazemzadeh N. Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty. [Internet] [Thesis]. Iowa State University; 2016. [cited 2019 Dec 14]. Available from: https://lib.dr.iastate.edu/etd/15944.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kazemzadeh N. Risk Consideration in Electricity Generation Unit Commitment under Supply and Demand Uncertainty. [Thesis]. Iowa State University; 2016. Available from: https://lib.dr.iastate.edu/etd/15944

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

64.
Kunnumkal, Sumit.
Approximate Dynamic *Programming* and *Stochastic* *Approximation* Methods for Inventory Control and Revenue Management
.

Degree: 2007, Cornell University

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

► In this thesis, we develop approximate dynamic *programming* and *stochastic* *approximation* methods for problems in inventory control and revenue management. A unifying feature of the…
(more)

Subjects/Keywords: Approximate dynamic programming; Stochastic approximation; Revenue management; Inventory control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kunnumkal, S. (2007). Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/7615

Not specified: Masters Thesis or Doctoral Dissertation

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

Kunnumkal, Sumit. “Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management .” 2007. Thesis, Cornell University. Accessed December 14, 2019. http://hdl.handle.net/1813/7615.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kunnumkal, Sumit. “Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management .” 2007. Web. 14 Dec 2019.

Vancouver:

Kunnumkal S. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . [Internet] [Thesis]. Cornell University; 2007. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1813/7615.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kunnumkal S. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . [Thesis]. Cornell University; 2007. Available from: http://hdl.handle.net/1813/7615

Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

65.
Hoskins, Aaron Bradley.
Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A *stochastic* *programming* approach to satellite system design.

Degree: PhD, Industrial and Systems Engineering, 2017, Mississippi State University

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

► Forest fires cause a significant amount of damage and destruction each year. Optimally dispatching resources reduces the amount of damage a forest fire can…
(more)

Subjects/Keywords: Initial Satellite Orbits; Satellite Maneuvers; Satellite Ground Stations; Stochastic Programming; L-shaped Method; Sample Average Approximation; Forest Fires; Disaster Response

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hoskins, A. B. (2017). Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A stochastic programming approach to satellite system design. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03182017-150019/ ;

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

Hoskins, Aaron Bradley. “Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A stochastic programming approach to satellite system design.” 2017. Doctoral Dissertation, Mississippi State University. Accessed December 14, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03182017-150019/ ;.

MLA Handbook (7^{th} Edition):

Hoskins, Aaron Bradley. “Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A stochastic programming approach to satellite system design.” 2017. Web. 14 Dec 2019.

Vancouver:

Hoskins AB. Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A stochastic programming approach to satellite system design. [Internet] [Doctoral dissertation]. Mississippi State University; 2017. [cited 2019 Dec 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03182017-150019/ ;.

Council of Science Editors:

Hoskins AB. Best longitudinal adjustment of satellite trajectories for the observation of forest fires (BLASTOFF): A stochastic programming approach to satellite system design. [Doctoral Dissertation]. Mississippi State University; 2017. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03182017-150019/ ;

University of Florida

66. Harris, Trevor. Finding the Optimal Stopping time of an American Option under the Heston Model.

Degree: 2014, University of Florida

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

► This paper addresses the problem of finding the optimal time to exercise an American option under a *stochastic* volatility model. The asset and its volatility…
(more)

Subjects/Keywords: American option; Approximation; Assets; Cost efficiency; Cost functions; Dynamic programming; Markov chains; Stochastic models; Stock prices; Stopping distances; Markov processes; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harris, T. (2014). Finding the Optimal Stopping time of an American Option under the Heston Model. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00057433

Not specified: Masters Thesis or Doctoral Dissertation

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

Harris, Trevor. “Finding the Optimal Stopping time of an American Option under the Heston Model.” 2014. Thesis, University of Florida. Accessed December 14, 2019. http://ufdc.ufl.edu/AA00057433.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Harris, Trevor. “Finding the Optimal Stopping time of an American Option under the Heston Model.” 2014. Web. 14 Dec 2019.

Vancouver:

Harris T. Finding the Optimal Stopping time of an American Option under the Heston Model. [Internet] [Thesis]. University of Florida; 2014. [cited 2019 Dec 14]. Available from: http://ufdc.ufl.edu/AA00057433.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harris T. Finding the Optimal Stopping time of an American Option under the Heston Model. [Thesis]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/AA00057433

Not specified: Masters Thesis or Doctoral Dissertation

EPFL

67. Rujeerapaiboon, Napat. Dimensionality Reduction in Dynamic Optimization under Uncertainty.

Degree: 2016, EPFL

URL: http://infoscience.epfl.ch/record/223055

► Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability…
(more)

Subjects/Keywords: convex optimization; conic programming; distributionally robust optimization; stochastic programming; linear decision rules; portfolio optimization; growth-optimal portfolio; value-at-risk; Chebyshev inequality; electricity market

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rujeerapaiboon, N. (2016). Dimensionality Reduction in Dynamic Optimization under Uncertainty. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/223055

Not specified: Masters Thesis or Doctoral Dissertation

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

Rujeerapaiboon, Napat. “Dimensionality Reduction in Dynamic Optimization under Uncertainty.” 2016. Thesis, EPFL. Accessed December 14, 2019. http://infoscience.epfl.ch/record/223055.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rujeerapaiboon, Napat. “Dimensionality Reduction in Dynamic Optimization under Uncertainty.” 2016. Web. 14 Dec 2019.

Vancouver:

Rujeerapaiboon N. Dimensionality Reduction in Dynamic Optimization under Uncertainty. [Internet] [Thesis]. EPFL; 2016. [cited 2019 Dec 14]. Available from: http://infoscience.epfl.ch/record/223055.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rujeerapaiboon N. Dimensionality Reduction in Dynamic Optimization under Uncertainty. [Thesis]. EPFL; 2016. Available from: http://infoscience.epfl.ch/record/223055

Not specified: Masters Thesis or Doctoral Dissertation

68.
Flammarion, Nicolas.
*Stochastic**approximation* and least-squares regression, with applications to machine learning : *Approximation* stochastique et régression par moindres carrés : applications en apprentissage automatique.

Degree: Docteur es, Mathématiques appliquées, 2017, Paris Sciences et Lettres

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

►

De multiples problèmes en apprentissage automatique consistent à minimiser une fonction lisse sur un espace euclidien. Pour l’apprentissage supervisé, cela inclut les régressions par moindres… (more)

Subjects/Keywords: Optimisation convexe; Accélération; Moyennage; Gradient stochastique; Régression par moindres carrés; Approximation stochastique; Algorithme dual moyenné; Descente miroire; Partionnement discriminatif; Relaxation convexe; Parcimonie; Sériation statistique; Apprentissage de permutation; Estimation minimax; Contraintes de forme; Convex optimization; Acceleration; Averaging; Stochastic gradient; Least-squares regression; Stochastic approximation; Dual averaging; Mirror descent; Discriminative clustering; Convex relaxation; Sparsity; Statistical seriation; Permutation learning; Minimax estimation; Shape constraints; 519

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Flammarion, N. (2017). Stochastic approximation and least-squares regression, with applications to machine learning : Approximation stochastique et régression par moindres carrés : applications en apprentissage automatique. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2017PSLEE056

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

Flammarion, Nicolas. “Stochastic approximation and least-squares regression, with applications to machine learning : Approximation stochastique et régression par moindres carrés : applications en apprentissage automatique.” 2017. Doctoral Dissertation, Paris Sciences et Lettres. Accessed December 14, 2019. http://www.theses.fr/2017PSLEE056.

MLA Handbook (7^{th} Edition):

Flammarion, Nicolas. “Stochastic approximation and least-squares regression, with applications to machine learning : Approximation stochastique et régression par moindres carrés : applications en apprentissage automatique.” 2017. Web. 14 Dec 2019.

Vancouver:

Flammarion N. Stochastic approximation and least-squares regression, with applications to machine learning : Approximation stochastique et régression par moindres carrés : applications en apprentissage automatique. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2017. [cited 2019 Dec 14]. Available from: http://www.theses.fr/2017PSLEE056.

Council of Science Editors:

Flammarion N. Stochastic approximation and least-squares regression, with applications to machine learning : Approximation stochastique et régression par moindres carrés : applications en apprentissage automatique. [Doctoral Dissertation]. Paris Sciences et Lettres; 2017. Available from: http://www.theses.fr/2017PSLEE056

69.
Xie, Weijun.
Relaxations and approximations of chance constrained *stochastic* programs.

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

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

► A chance constrained *stochastic* *programming* (CCSP) problem involves constraints with random parameters that are required to be satisfied with a prespecified probability threshold. Such constraints…
(more)

Subjects/Keywords: chance constraint; approximation algorithm; Lagrangian relaxation; distributionally robust; convex program

…A chance constrained *stochastic* *programming* (CCSP) problem involves constraints… …application of
quantile closure operations recovers the *convex* hull of the *nonconvex* chance… …provide a constant factor *approximation* *algorithm*.
In the second part of the thesis we consider… …uncertainty
stemming from renewable power generation. In particular, we develop a *convex* *programming*… …*approximation* is NP-hard, there are various sufficient
conditions under which it is *convex* and…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xie, W. (2017). Relaxations and approximations of chance constrained stochastic programs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58678

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

Xie, Weijun. “Relaxations and approximations of chance constrained stochastic programs.” 2017. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/58678.

MLA Handbook (7^{th} Edition):

Xie, Weijun. “Relaxations and approximations of chance constrained stochastic programs.” 2017. Web. 14 Dec 2019.

Vancouver:

Xie W. Relaxations and approximations of chance constrained stochastic programs. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/58678.

Council of Science Editors:

Xie W. Relaxations and approximations of chance constrained stochastic programs. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58678

EPFL

70. Trummer, Immanuel. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.

Degree: 2016, EPFL

URL: http://infoscience.epfl.ch/record/218998

► The goal of query optimization is to map a declarative query (describing data to generate) to a query plan (describing how to generate the data)…
(more)

Subjects/Keywords: Query optimization; multi-objective query optimization; parametric query optimization; multiple query optimization; approximation algorithms; randomized algorithms; incremental algorithms; parallelization; integer programming; quantum computing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Trummer, I. (2016). From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/218998

Not specified: Masters Thesis or Doctoral Dissertation

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

Trummer, Immanuel. “From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.” 2016. Thesis, EPFL. Accessed December 14, 2019. http://infoscience.epfl.ch/record/218998.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Trummer, Immanuel. “From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.” 2016. Web. 14 Dec 2019.

Vancouver:

Trummer I. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. [Internet] [Thesis]. EPFL; 2016. [cited 2019 Dec 14]. Available from: http://infoscience.epfl.ch/record/218998.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Trummer I. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. [Thesis]. EPFL; 2016. Available from: http://infoscience.epfl.ch/record/218998

Not specified: Masters Thesis or Doctoral Dissertation

Colorado School of Mines

71.
Li, Qiuwei.
* Convex* and

Degree: PhD, Electrical Engineering, 2019, Colorado School of Mines

URL: http://hdl.handle.net/11124/173275

► Many machine learning and signal processing problems are fundamentally *nonconvex*. One way to solve them is to transform them into *convex* optimization problems (a.k.a. *convex*…
(more)

Subjects/Keywords: Convex optimization; Nonconvex optimization; Tensor decomposition; Landscape analysis; Atomic norm; Strict saddles

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Q. (2019). Convex and nonconvex optimization geometries. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/173275

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

Li, Qiuwei. “Convex and nonconvex optimization geometries.” 2019. Doctoral Dissertation, Colorado School of Mines. Accessed December 14, 2019. http://hdl.handle.net/11124/173275.

MLA Handbook (7^{th} Edition):

Li, Qiuwei. “Convex and nonconvex optimization geometries.” 2019. Web. 14 Dec 2019.

Vancouver:

Li Q. Convex and nonconvex optimization geometries. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2019. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/11124/173275.

Council of Science Editors:

Li Q. Convex and nonconvex optimization geometries. [Doctoral Dissertation]. Colorado School of Mines; 2019. Available from: http://hdl.handle.net/11124/173275

University of Vienna

72.
Sedlmayer, Michael.
Analysis and *stochastic* *programming* in economics of wind energy.

Degree: 2018, University of Vienna

URL: http://othes.univie.ac.at/54324/

►

Bei der Stromproduktion für den täglichen Spotmarkt mittels Windkraftanlagen muss man täglich einen Produktionsfahrplan für den folgenden Tag übermitteln. Aufgrund von unterschiedlichen Preisen für vorveranschlagte… (more)

Subjects/Keywords: 31.80 Angewandte Mathematik; 31.76 Numerische Mathematik; Stochastische Optimierung / Energiewirtschaft / Lineare Regression / Sample Average Approximation; Stochastic Programming / energy economics / linear regression / sample average approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sedlmayer, M. (2018). Analysis and stochastic programming in economics of wind energy. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/54324/

Not specified: Masters Thesis or Doctoral Dissertation

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

Sedlmayer, Michael. “Analysis and stochastic programming in economics of wind energy.” 2018. Thesis, University of Vienna. Accessed December 14, 2019. http://othes.univie.ac.at/54324/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sedlmayer, Michael. “Analysis and stochastic programming in economics of wind energy.” 2018. Web. 14 Dec 2019.

Vancouver:

Sedlmayer M. Analysis and stochastic programming in economics of wind energy. [Internet] [Thesis]. University of Vienna; 2018. [cited 2019 Dec 14]. Available from: http://othes.univie.ac.at/54324/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sedlmayer M. Analysis and stochastic programming in economics of wind energy. [Thesis]. University of Vienna; 2018. Available from: http://othes.univie.ac.at/54324/

Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

73. Liu, Yufeng. Multicategory psi-learning and support vector machine.

Degree: PhD, Statistics, 2004, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1085424065

► Many margin-based classification techniques such as support vector machine (SVM) and psi-learning deliver high performance by directly focusing on estimating the decision boundary, as opposed…
(more)

Subjects/Keywords: Statistics; classification; concave minimization; d.c. algorithms; generalization error; margins; nonconvex minimization; outer approximation; quadratic programming; support vectors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2004). Multicategory psi-learning and support vector machine. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1085424065

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

Liu, Yufeng. “Multicategory psi-learning and support vector machine.” 2004. Doctoral Dissertation, The Ohio State University. Accessed December 14, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1085424065.

MLA Handbook (7^{th} Edition):

Liu, Yufeng. “Multicategory psi-learning and support vector machine.” 2004. Web. 14 Dec 2019.

Vancouver:

Liu Y. Multicategory psi-learning and support vector machine. [Internet] [Doctoral dissertation]. The Ohio State University; 2004. [cited 2019 Dec 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1085424065.

Council of Science Editors:

Liu Y. Multicategory psi-learning and support vector machine. [Doctoral Dissertation]. The Ohio State University; 2004. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1085424065

Michigan State University

74.
Yuan, Chao.
Uniform behavior of *stochastic* *approximation* methods.

Degree: PhD, Department of Statistics and Probability, 1996, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:29765

Subjects/Keywords: Stochastic approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuan, C. (1996). Uniform behavior of stochastic approximation methods. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:29765

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

Yuan, Chao. “Uniform behavior of stochastic approximation methods.” 1996. Doctoral Dissertation, Michigan State University. Accessed December 14, 2019. http://etd.lib.msu.edu/islandora/object/etd:29765.

MLA Handbook (7^{th} Edition):

Yuan, Chao. “Uniform behavior of stochastic approximation methods.” 1996. Web. 14 Dec 2019.

Vancouver:

Yuan C. Uniform behavior of stochastic approximation methods. [Internet] [Doctoral dissertation]. Michigan State University; 1996. [cited 2019 Dec 14]. Available from: http://etd.lib.msu.edu/islandora/object/etd:29765.

Council of Science Editors:

Yuan C. Uniform behavior of stochastic approximation methods. [Doctoral Dissertation]. Michigan State University; 1996. Available from: http://etd.lib.msu.edu/islandora/object/etd:29765

University of Waterloo

75. Jain, Kshitij. Minimum Shared-Power Edge Cut.

Degree: 2018, University of Waterloo

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

► We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s…
(more)

Subjects/Keywords: Algorithms; Computational Geometry; Approximation Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jain, K. (2018). Minimum Shared-Power Edge Cut. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13664

Not specified: Masters Thesis or Doctoral Dissertation

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

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed December 14, 2019. http://hdl.handle.net/10012/13664.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 14 Dec 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10012/13664.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jain K. Minimum Shared-Power Edge Cut. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13664

Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

76. Wu, Fei. Electric Vehicle Charging Network Design and Control Strategies.

Degree: PhD, Industrial and Systems Engineering, 2016, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1479900508609434

► Electric vehicles hold great promise in improving transportation energy consumption efficiency. However, battery-related "range-anxiety" hampers large-scale EV adoption. To relieve range anxiety and accelerate wider…
(more)

Subjects/Keywords: Operations Research; Energy; Electric Vehicle, Charging Station, Stochastic Flow-Capturing Location Model, Station Control, Energy Storage, Ancillary Service, Stochastic Programming, Sample-Average Approximation, Monte-Carlo Simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, F. (2016). Electric Vehicle Charging Network Design and Control Strategies. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1479900508609434

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

Wu, Fei. “Electric Vehicle Charging Network Design and Control Strategies.” 2016. Doctoral Dissertation, The Ohio State University. Accessed December 14, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1479900508609434.

MLA Handbook (7^{th} Edition):

Wu, Fei. “Electric Vehicle Charging Network Design and Control Strategies.” 2016. Web. 14 Dec 2019.

Vancouver:

Wu F. Electric Vehicle Charging Network Design and Control Strategies. [Internet] [Doctoral dissertation]. The Ohio State University; 2016. [cited 2019 Dec 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1479900508609434.

Council of Science Editors:

Wu F. Electric Vehicle Charging Network Design and Control Strategies. [Doctoral Dissertation]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1479900508609434

Cornell University

77. Qian, Jiawei. Prize-Collecting Network Design .

Degree: 2012, Cornell University

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

► Network design is an active research area in discrete optimization that focuses on problems arising from the construction of communication networks. The prize-collecting version of…
(more)

Subjects/Keywords: Network design; Approximation algorithm; Online algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Qian, J. (2012). Prize-Collecting Network Design . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29363

Not specified: Masters Thesis or Doctoral Dissertation

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

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Thesis, Cornell University. Accessed December 14, 2019. http://hdl.handle.net/1813/29363.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Web. 14 Dec 2019.

Vancouver:

Qian J. Prize-Collecting Network Design . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1813/29363.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Qian J. Prize-Collecting Network Design . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/29363

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

78. Sheikh, Omar. Global Optimization of Sequential Processes.

Degree: Chemical Engineering, 2018, UCLA

URL: http://www.escholarship.org/uc/item/0sv3r6w4

► This work presents a novel method to identify the global optimum of a general class of single parameter optimization problems, typically arising in optimizing sequential…
(more)

Subjects/Keywords: Chemical engineering; Computer science; Mathematics; Global Optimization; Nonconvex; Nonlinear Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sheikh, O. (2018). Global Optimization of Sequential Processes. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/0sv3r6w4

Not specified: Masters Thesis or Doctoral Dissertation

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

Sheikh, Omar. “Global Optimization of Sequential Processes.” 2018. Thesis, UCLA. Accessed December 14, 2019. http://www.escholarship.org/uc/item/0sv3r6w4.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sheikh, Omar. “Global Optimization of Sequential Processes.” 2018. Web. 14 Dec 2019.

Vancouver:

Sheikh O. Global Optimization of Sequential Processes. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Dec 14]. Available from: http://www.escholarship.org/uc/item/0sv3r6w4.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sheikh O. Global Optimization of Sequential Processes. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/0sv3r6w4

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

79. Yao, Quanming CSE. Optimization with low-rank regularization.

Degree: 2018, Hong Kong University of Science and Technology

URL: https://doi.org/10.14711/thesis-991012596561403412 ; http://repository.ust.hk/ir/bitstream/1783.1-92261/1/th_redirect.html

► Low-rank modeling is important for machine learning, which has been widely used in many areas such as recommender systems and social network analysis in data…
(more)

Subjects/Keywords: Machine learning; Mathematical models; Computer algorithms; Nonconvex programming; Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yao, Q. C. (2018). Optimization with low-rank regularization. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-991012596561403412 ; http://repository.ust.hk/ir/bitstream/1783.1-92261/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Yao, Quanming CSE. “Optimization with low-rank regularization.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed December 14, 2019. https://doi.org/10.14711/thesis-991012596561403412 ; http://repository.ust.hk/ir/bitstream/1783.1-92261/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yao, Quanming CSE. “Optimization with low-rank regularization.” 2018. Web. 14 Dec 2019.

Vancouver:

Yao QC. Optimization with low-rank regularization. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2019 Dec 14]. Available from: https://doi.org/10.14711/thesis-991012596561403412 ; http://repository.ust.hk/ir/bitstream/1783.1-92261/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yao QC. Optimization with low-rank regularization. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: https://doi.org/10.14711/thesis-991012596561403412 ; http://repository.ust.hk/ir/bitstream/1783.1-92261/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Columbia University

80.
Sun, Ju.
When Are *Nonconvex* Optimization Problems Not Scary?.

Degree: 2016, Columbia University

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

► *Nonconvex* optimization is NP-hard, even the goal is to compute a local minimizer. In applied disciplines, however, *nonconvex* problems abound, and simple algorithms, such as…
(more)

Subjects/Keywords: Mathematical optimization; Nonconvex programming; Electrical engineering; Computer science; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sun, J. (2016). When Are Nonconvex Optimization Problems Not Scary?. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8251J7H

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

Sun, Ju. “When Are Nonconvex Optimization Problems Not Scary?.” 2016. Doctoral Dissertation, Columbia University. Accessed December 14, 2019. https://doi.org/10.7916/D8251J7H.

MLA Handbook (7^{th} Edition):

Sun, Ju. “When Are Nonconvex Optimization Problems Not Scary?.” 2016. Web. 14 Dec 2019.

Vancouver:

Sun J. When Are Nonconvex Optimization Problems Not Scary?. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2019 Dec 14]. Available from: https://doi.org/10.7916/D8251J7H.

Council of Science Editors:

Sun J. When Are Nonconvex Optimization Problems Not Scary?. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8251J7H

University of Limerick

81. Conway, Christina. Localised sound optimisation in small enclosures.

Degree: 2010, University of Limerick

URL: http://hdl.handle.net/10344/1625

►

peer-reviewed

In this work an application was developed which uses the Sequential Quadratic Pro- gramming (SQP) optimisation *algorithm* to optimise boundary absorption in order to…
(more)

Subjects/Keywords: quadratic programming; algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Conway, C. (2010). Localised sound optimisation in small enclosures. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/1625

Not specified: Masters Thesis or Doctoral Dissertation

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

Conway, Christina. “Localised sound optimisation in small enclosures.” 2010. Thesis, University of Limerick. Accessed December 14, 2019. http://hdl.handle.net/10344/1625.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Conway, Christina. “Localised sound optimisation in small enclosures.” 2010. Web. 14 Dec 2019.

Vancouver:

Conway C. Localised sound optimisation in small enclosures. [Internet] [Thesis]. University of Limerick; 2010. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10344/1625.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Conway C. Localised sound optimisation in small enclosures. [Thesis]. University of Limerick; 2010. Available from: http://hdl.handle.net/10344/1625

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

82. Truszkowski, Jakub. Fast Algorithms for Large-Scale Phylogenetic Reconstruction.

Degree: 2013, University of Waterloo

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

► One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories,…
(more)

Subjects/Keywords: phylogeny; randomized algorithm; quartet; Markov chain

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Truszkowski, J. (2013). Fast Algorithms for Large-Scale Phylogenetic Reconstruction. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8011

Not specified: Masters Thesis or Doctoral Dissertation

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

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Thesis, University of Waterloo. Accessed December 14, 2019. http://hdl.handle.net/10012/8011.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Web. 14 Dec 2019.

Vancouver:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10012/8011.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/8011

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

83. Musleh, Yossef. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.

Degree: 2018, University of Waterloo

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

► This thesis introduces a new Monte Carlo *randomized* *algorithm* for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic *algorithm*…
(more)

Subjects/Keywords: Drinfeld; Module; Elliptic; Curve; Cryptography; Algorithm; Randomized

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Musleh, Y. (2018). Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

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

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Thesis, University of Waterloo. Accessed December 14, 2019. http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Web. 14 Dec 2019.

Vancouver:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

84.
Naseh, Mohammad.
Some developments in *stochastic* *programming* and its
applications; -.

Degree: Statistics, 1995, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/51741

Abstract not available newline newline

Bibliography p. i-vi

Subjects/Keywords: Developments; Stochastic Programming; Applications; Knapsack Problem; Random Variables; Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naseh, M. (1995). Some developments in stochastic programming and its applications; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/51741

Not specified: Masters Thesis or Doctoral Dissertation

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

Naseh, Mohammad. “Some developments in stochastic programming and its applications; -.” 1995. Thesis, Aligarh Muslim University. Accessed December 14, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/51741.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Naseh, Mohammad. “Some developments in stochastic programming and its applications; -.” 1995. Web. 14 Dec 2019.

Vancouver:

Naseh M. Some developments in stochastic programming and its applications; -. [Internet] [Thesis]. Aligarh Muslim University; 1995. [cited 2019 Dec 14]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51741.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Naseh M. Some developments in stochastic programming and its applications; -. [Thesis]. Aligarh Muslim University; 1995. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51741

Not specified: Masters Thesis or Doctoral Dissertation

85. Rafael Bruno da Silva Brandi. Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull.

Degree: 2011, Universidade Federal de Juiz de Fora

URL: http://www.bdtd.ufjf.br/tde_busca/arquivo.php?codArquivo=1026

► O Sistema Elétrico Brasileiro (SEB) apresenta características peculiares devido às grandes dimensões do país e pelo fato da geração elétrica ser proveniente predominantemente de usinas…
(more)

Subjects/Keywords: Planejamento da Operação; Sistemas Hidrotérmicos; Programação Dinâmica Estocástica; Fechos Convexos; Processamento Paralelo; Operation Planning; Hydrothermal Systems; Stochastic Dynamic Programming; Convex Hull; Parallel Processing; ENGENHARIA ELETRICA

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brandi, R. B. d. S. (2011). Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull. (Thesis). Universidade Federal de Juiz de Fora. Retrieved from http://www.bdtd.ufjf.br/tde_busca/arquivo.php?codArquivo=1026

Not specified: Masters Thesis or Doctoral Dissertation

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

Brandi, Rafael Bruno da Silva. “Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull.” 2011. Thesis, Universidade Federal de Juiz de Fora. Accessed December 14, 2019. http://www.bdtd.ufjf.br/tde_busca/arquivo.php?codArquivo=1026.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Brandi, Rafael Bruno da Silva. “Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull.” 2011. Web. 14 Dec 2019.

Vancouver:

Brandi RBdS. Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull. [Internet] [Thesis]. Universidade Federal de Juiz de Fora; 2011. [cited 2019 Dec 14]. Available from: http://www.bdtd.ufjf.br/tde_busca/arquivo.php?codArquivo=1026.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brandi RBdS. Processo Iterativo de Construção da Função de Custo Futuro na Metodologia PDE-ConvexHull. [Thesis]. Universidade Federal de Juiz de Fora; 2011. Available from: http://www.bdtd.ufjf.br/tde_busca/arquivo.php?codArquivo=1026

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

86. Su, Suiyi. Sample Path Based Optimal Position Liquidation with CVaR Risk.

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

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

► The purpose of this research is to investigate devising theoptimal position liquidation strategies in financial markets. During the transaction of large block orders, investors need…
(more)

Subjects/Keywords: Anticipation; Assets; Datasets; Market prices; Mathematical monotonicity; Mathematics; Matrices; Objective functions; Prices; Real prices; convex – execution – guard – nonanticipativity – optimal – portfolio – programming – safe – stochastic – trading

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Su, S. (2012). Sample Path Based Optimal Position Liquidation with CVaR Risk. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044708

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

Su, Suiyi. “Sample Path Based Optimal Position Liquidation with CVaR Risk.” 2012. Masters Thesis, University of Florida. Accessed December 14, 2019. http://ufdc.ufl.edu/UFE0044708.

MLA Handbook (7^{th} Edition):

Su, Suiyi. “Sample Path Based Optimal Position Liquidation with CVaR Risk.” 2012. Web. 14 Dec 2019.

Vancouver:

Su S. Sample Path Based Optimal Position Liquidation with CVaR Risk. [Internet] [Masters thesis]. University of Florida; 2012. [cited 2019 Dec 14]. Available from: http://ufdc.ufl.edu/UFE0044708.

Council of Science Editors:

Su S. Sample Path Based Optimal Position Liquidation with CVaR Risk. [Masters Thesis]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044708

87. Peng, Shen. Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications.

Degree: Docteur es, Informatique, 2019, Paris Saclay; Xi'an Jiaotong University

URL: http://www.theses.fr/2019SACLS153

► L'incertitude est une propriété naturelle des systèmes complexes. Les paramètres de certains modèles peuvent être imprécis; la présence de perturbations aléatoires est une source majeure…
(more)

Subjects/Keywords: Contraintes en probabilités; Programmation convexe; Distributionnellement robuste; Distributions mixtes; Théorie des jeux stochastiques; Chance constraints; Convex programming; Distributionally robust; Mixture distribution; Stochastic game theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Peng, S. (2019). Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications. (Doctoral Dissertation). Paris Saclay; Xi'an Jiaotong University. Retrieved from http://www.theses.fr/2019SACLS153

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

Peng, Shen. “Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications.” 2019. Doctoral Dissertation, Paris Saclay; Xi'an Jiaotong University. Accessed December 14, 2019. http://www.theses.fr/2019SACLS153.

MLA Handbook (7^{th} Edition):

Peng, Shen. “Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications.” 2019. Web. 14 Dec 2019.

Vancouver:

Peng S. Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications. [Internet] [Doctoral dissertation]. Paris Saclay; Xi'an Jiaotong University; 2019. [cited 2019 Dec 14]. Available from: http://www.theses.fr/2019SACLS153.

Council of Science Editors:

Peng S. Optimisation stochastique avec contraintes en probabilités et applications : Chance constrained problem and its applications. [Doctoral Dissertation]. Paris Saclay; Xi'an Jiaotong University; 2019. Available from: http://www.theses.fr/2019SACLS153

The Ohio State University

88. Chang, Chin-Yao. Hierarchical Control of Inverter-Based Microgrids.

Degree: PhD, Electrical and Computer Engineering, 2016, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1471815065

► Electric power grid is experiencing a major paradigm shift toward a more reliable, efficient, and environmentally friendly grid. The concept of microgrid is introduced to…
(more)

Subjects/Keywords: Electrical Engineering; Mechanical Engineering; Distributed control, droop control, hierarchical control, microgrid control, optimal power flow problem, semidefinite programming convex relaxation, near global optimum algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chang, C. (2016). Hierarchical Control of Inverter-Based Microgrids. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1471815065

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

Chang, Chin-Yao. “Hierarchical Control of Inverter-Based Microgrids.” 2016. Doctoral Dissertation, The Ohio State University. Accessed December 14, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1471815065.

MLA Handbook (7^{th} Edition):

Chang, Chin-Yao. “Hierarchical Control of Inverter-Based Microgrids.” 2016. Web. 14 Dec 2019.

Vancouver:

Chang C. Hierarchical Control of Inverter-Based Microgrids. [Internet] [Doctoral dissertation]. The Ohio State University; 2016. [cited 2019 Dec 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1471815065.

Council of Science Editors:

Chang C. Hierarchical Control of Inverter-Based Microgrids. [Doctoral Dissertation]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1471815065

NSYSU

89.
Tseng, Ting-Wei.
A Projection Method for Minimizing the Sum of Finitely Many *Convex* Functions.

Degree: Master, Applied Mathematics, 2014, NSYSU

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

► Many practical problems can mathematically be modeled as a constrained *convex* minimization problem where the set of constraints is the intersection of finitely many closed…
(more)

Subjects/Keywords: constrained convex minimization; algorithm; nearest point projection; convergence; convex feasibility; projection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tseng, T. (2014). A Projection Method for Minimizing the Sum of Finitely Many Convex Functions. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726114-230655

Not specified: Masters Thesis or Doctoral Dissertation

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

Tseng, Ting-Wei. “A Projection Method for Minimizing the Sum of Finitely Many Convex Functions.” 2014. Thesis, NSYSU. Accessed December 14, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726114-230655.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tseng, Ting-Wei. “A Projection Method for Minimizing the Sum of Finitely Many Convex Functions.” 2014. Web. 14 Dec 2019.

Vancouver:

Tseng T. A Projection Method for Minimizing the Sum of Finitely Many Convex Functions. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Dec 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726114-230655.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tseng T. A Projection Method for Minimizing the Sum of Finitely Many Convex Functions. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726114-230655

Not specified: Masters Thesis or Doctoral Dissertation

90. Nguyen, Huu Quang. The supporting hyperplane and applications.

Degree: PhD, Applied Mathematics, 2015, NSYSU

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

► We study the explicit necessary and sufficient condition for the existence of supporting hyperplanes at boundary points of a *convex* subset C of a Hilbert…
(more)

Subjects/Keywords: Supporting hyperplane; Nonconvex problem; convex function; Variational inequalities; Nonconvex

…*Convex* Set and *Convex* Function
We will present here some basic properties of *convex* set and… …*convex* function, those
will be used in Chapter2 and Chapter3.
Deﬁnition 1.2.1. A set C in H is… …said to be *convex* if either C = ∅ or, whenever we
take two points in C, the segment that… …coeﬃcients
λ1 , λ2 , · · · , λn such that ni=1 λi = 1 and λi ≥ 0, is called a *convex* combination… …Proposition 1.2.1. The set C is *convex* if and only if every *convex* combination of
points in C is…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nguyen, H. Q. (2015). The supporting hyperplane and applications. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0502115-153252

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

Nguyen, Huu Quang. “The supporting hyperplane and applications.” 2015. Doctoral Dissertation, NSYSU. Accessed December 14, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0502115-153252.

MLA Handbook (7^{th} Edition):

Nguyen, Huu Quang. “The supporting hyperplane and applications.” 2015. Web. 14 Dec 2019.

Vancouver:

Nguyen HQ. The supporting hyperplane and applications. [Internet] [Doctoral dissertation]. NSYSU; 2015. [cited 2019 Dec 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0502115-153252.

Council of Science Editors:

Nguyen HQ. The supporting hyperplane and applications. [Doctoral Dissertation]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0502115-153252