Advanced search options

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

You searched for `subject:(semidefinite programming)`

.
Showing records 1 – 30 of
110 total matches.

Search Limiters

Dates

- 2015 – 2019 (45)
- 2010 – 2014 (41)
- 2005 – 2009 (22)

Degrees

- PhD (22)
- Docteur es (10)

▼ Search Limiters

Virginia Tech

1.
Monir Vaghefi, Sayed Reza.
Cooperative Positioning in Wireless Sensor Networks Using *Semidefinite* * Programming*.

Degree: PhD, Electrical and Computer Engineering, 2015, Virginia Tech

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

► With the rapid development of wireless technologies, the demand for positioning services has grown dramatically over the past three decades. The Global Positioning System (GPS)…
(more)

Subjects/Keywords: Cooperative positioning; localization; semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Monir Vaghefi, S. R. (2015). Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/71884

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

Monir Vaghefi, Sayed Reza. “Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming.” 2015. Doctoral Dissertation, Virginia Tech. Accessed June 20, 2019. http://hdl.handle.net/10919/71884.

MLA Handbook (7^{th} Edition):

Monir Vaghefi, Sayed Reza. “Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming.” 2015. Web. 20 Jun 2019.

Vancouver:

Monir Vaghefi SR. Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10919/71884.

Council of Science Editors:

Monir Vaghefi SR. Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/71884

University of Waterloo

2.
Adams, Elspeth.
A *Semidefinite* *Programming* Model for the Facility Layout Problem.

Degree: 2010, University of Waterloo

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

► The continuous facility layout problem consists of arranging a set of facilities so that no pair overlaps and the total sum of the pairwise connection…
(more)

Subjects/Keywords: Facility Layout Problem; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adams, E. (2010). A Semidefinite Programming Model for the Facility Layout Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5398

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

Adams, Elspeth. “A Semidefinite Programming Model for the Facility Layout Problem.” 2010. Thesis, University of Waterloo. Accessed June 20, 2019. http://hdl.handle.net/10012/5398.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Adams, Elspeth. “A Semidefinite Programming Model for the Facility Layout Problem.” 2010. Web. 20 Jun 2019.

Vancouver:

Adams E. A Semidefinite Programming Model for the Facility Layout Problem. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10012/5398.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Adams E. A Semidefinite Programming Model for the Facility Layout Problem. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5398

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

3. Chen, Yutong. Non-Unique Games Over Compact Groups and Applications .

Degree: PhD, 2018, Princeton University

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

► Let G be a compact group and let fij 2 L2(G). We dene the Non-Unique Games (NUG) problem as nding g1; : : : ;…
(more)

Subjects/Keywords: cryo-EM; representation theory; semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, Y. (2018). Non-Unique Games Over Compact Groups and Applications . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp0108612r22w

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

Chen, Yutong. “Non-Unique Games Over Compact Groups and Applications .” 2018. Doctoral Dissertation, Princeton University. Accessed June 20, 2019. http://arks.princeton.edu/ark:/88435/dsp0108612r22w.

MLA Handbook (7^{th} Edition):

Chen, Yutong. “Non-Unique Games Over Compact Groups and Applications .” 2018. Web. 20 Jun 2019.

Vancouver:

Chen Y. Non-Unique Games Over Compact Groups and Applications . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Jun 20]. Available from: http://arks.princeton.edu/ark:/88435/dsp0108612r22w.

Council of Science Editors:

Chen Y. Non-Unique Games Over Compact Groups and Applications . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp0108612r22w

University of Waterloo

4.
Wang, Ningchuan.
Eigenvalue, Quadratic *Programming* and *Semidefinite* *Programming* Bounds for Graph Partitioning Problems.

Degree: 2014, University of Waterloo

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

► The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic…
(more)

Subjects/Keywords: Graph Partitioning; Semidefinite Programming; eigenvalue bounds

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, N. (2014). Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8760

Not specified: Masters Thesis or Doctoral Dissertation

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

Wang, Ningchuan. “Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems.” 2014. Thesis, University of Waterloo. Accessed June 20, 2019. http://hdl.handle.net/10012/8760.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Ningchuan. “Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems.” 2014. Web. 20 Jun 2019.

Vancouver:

Wang N. Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10012/8760.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang N. Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8760

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

5. Lo, Kun-Feng. Approximate LMMSE detector for uplink in multi-receiver MIMO system.

Degree: Master, Communications Engineering, 2011, NSYSU

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

► In this thesis, we consider receiver design problems in a multi-cell MIMO system using the coordinated multi-point transmission/reception technique. The linear minimum mean square error…
(more)

Subjects/Keywords: LMMSE; MIMO; Cayley-Hamilton theorem; Second-Order Cone Programming; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lo, K. (2011). Approximate LMMSE detector for uplink in multi-receiver MIMO system. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815111-171006

Not specified: Masters Thesis or Doctoral Dissertation

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

Lo, Kun-Feng. “Approximate LMMSE detector for uplink in multi-receiver MIMO system.” 2011. Thesis, NSYSU. Accessed June 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815111-171006.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lo, Kun-Feng. “Approximate LMMSE detector for uplink in multi-receiver MIMO system.” 2011. Web. 20 Jun 2019.

Vancouver:

Lo K. Approximate LMMSE detector for uplink in multi-receiver MIMO system. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Jun 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815111-171006.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lo K. Approximate LMMSE detector for uplink in multi-receiver MIMO system. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815111-171006

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

6.
Ghaddar, Bissan.
New Conic Optimization Techniques for Solving Binary Polynomial *Programming* Problems.

Degree: 2011, University of Waterloo

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

► Polynomial *programming*, a class of non-linear *programming* where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the…
(more)

Subjects/Keywords: Polynomial Programming; Semidefinite Programming; Branch-and-Bound; Inequality Generation; Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghaddar, B. (2011). New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6139

Not specified: Masters Thesis or Doctoral Dissertation

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

Ghaddar, Bissan. “New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems.” 2011. Thesis, University of Waterloo. Accessed June 20, 2019. http://hdl.handle.net/10012/6139.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ghaddar, Bissan. “New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems.” 2011. Web. 20 Jun 2019.

Vancouver:

Ghaddar B. New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10012/6139.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghaddar B. New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6139

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

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

Degree: PhD, 2018, Princeton University

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

Texas A&M University

8. Aziz, Ahsan. Robust Beamforming for Two-Way Relay Systems.

Degree: 2013, Texas A&M University

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

► In wireless communication systems, relays are widely used to extend coverage. Over the past years, relays have evolved from simple repeaters to more sophisticated units…
(more)

Subjects/Keywords: Robust beamforming; Two-way Relay; SDP; semidefinite programming; linearized robust; beamforming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aziz, A. (2013). Robust Beamforming for Two-Way Relay Systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151346

Not specified: Masters Thesis or Doctoral Dissertation

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

Aziz, Ahsan. “Robust Beamforming for Two-Way Relay Systems.” 2013. Thesis, Texas A&M University. Accessed June 20, 2019. http://hdl.handle.net/1969.1/151346.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Aziz, Ahsan. “Robust Beamforming for Two-Way Relay Systems.” 2013. Web. 20 Jun 2019.

Vancouver:

Aziz A. Robust Beamforming for Two-Way Relay Systems. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/1969.1/151346.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aziz A. Robust Beamforming for Two-Way Relay Systems. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151346

Not specified: Masters Thesis or Doctoral Dissertation

De Montfort University

9. Khan, Adnan Umar. Distributive time division multiplexed localization technique for WLANs.

Degree: PhD, 2012, De Montfort University

URL: http://hdl.handle.net/2086/7102

► This thesis presents the research work regarding the solution of a localization problem in indoor WLANs by introducing a distributive time division multiplexed localization technique…
(more)

Subjects/Keywords: 600; WLAN Localization; semidefinite programming; Euclidean distance matrix

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khan, A. U. (2012). Distributive time division multiplexed localization technique for WLANs. (Doctoral Dissertation). De Montfort University. Retrieved from http://hdl.handle.net/2086/7102

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

Khan, Adnan Umar. “Distributive time division multiplexed localization technique for WLANs.” 2012. Doctoral Dissertation, De Montfort University. Accessed June 20, 2019. http://hdl.handle.net/2086/7102.

MLA Handbook (7^{th} Edition):

Khan, Adnan Umar. “Distributive time division multiplexed localization technique for WLANs.” 2012. Web. 20 Jun 2019.

Vancouver:

Khan AU. Distributive time division multiplexed localization technique for WLANs. [Internet] [Doctoral dissertation]. De Montfort University; 2012. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2086/7102.

Council of Science Editors:

Khan AU. Distributive time division multiplexed localization technique for WLANs. [Doctoral Dissertation]. De Montfort University; 2012. Available from: http://hdl.handle.net/2086/7102

Hong Kong University of Science and Technology

10.
Zheng, Jianying.
* Semidefinite* cone-invariant systems : theory and applications.

Degree: 2016, Hong Kong University of Science and Technology

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

► *Semidefinite* cone-invariant (SCI) systems are defined as a class of linear time-invariant (LTI) systems which possess the spectrahedral cone-invariance property. Such systems have a rich…
(more)

Subjects/Keywords: Linear time invariant systems; Mathematical models; Semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zheng, J. (2016). Semidefinite cone-invariant systems : theory and applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1584859 ; http://repository.ust.hk/ir/bitstream/1783.1-80397/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Zheng, Jianying. “Semidefinite cone-invariant systems : theory and applications.” 2016. Thesis, Hong Kong University of Science and Technology. Accessed June 20, 2019. https://doi.org/10.14711/thesis-b1584859 ; http://repository.ust.hk/ir/bitstream/1783.1-80397/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zheng, Jianying. “Semidefinite cone-invariant systems : theory and applications.” 2016. Web. 20 Jun 2019.

Vancouver:

Zheng J. Semidefinite cone-invariant systems : theory and applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2016. [cited 2019 Jun 20]. Available from: https://doi.org/10.14711/thesis-b1584859 ; http://repository.ust.hk/ir/bitstream/1783.1-80397/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zheng J. Semidefinite cone-invariant systems : theory and applications. [Thesis]. Hong Kong University of Science and Technology; 2016. Available from: https://doi.org/10.14711/thesis-b1584859 ; http://repository.ust.hk/ir/bitstream/1783.1-80397/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

11.
Kolla, Alexandra.
Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and *Semidefinite* * Programming*.

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

URL: http://www.escholarship.org/uc/item/30x0b4b0

► In this thesis, we study three problems related to expanders, whose analysis involves understanding the intimate connection between expanders, spectra and *semidefinite* *programming*. Our first…
(more)

Subjects/Keywords: Computer Science; Mathematics; expansion; graphs; semidefinite programming; sparsification; spectra; Unique Games

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kolla, A. (2009). Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/30x0b4b0

Not specified: Masters Thesis or Doctoral Dissertation

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

Kolla, Alexandra. “Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming.” 2009. Thesis, University of California – Berkeley. Accessed June 20, 2019. http://www.escholarship.org/uc/item/30x0b4b0.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kolla, Alexandra. “Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming.” 2009. Web. 20 Jun 2019.

Vancouver:

Kolla A. Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming. [Internet] [Thesis]. University of California – Berkeley; 2009. [cited 2019 Jun 20]. Available from: http://www.escholarship.org/uc/item/30x0b4b0.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kolla A. Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming. [Thesis]. University of California – Berkeley; 2009. Available from: http://www.escholarship.org/uc/item/30x0b4b0

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

12.
Cosse, Augustin.
*Semidefinite**programming* relaxations for matrix completion, inverse scattering and blind deconvolution.

Degree: 2016, Université Catholique de Louvain

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

►

The thesis studies *semidefinite* *programming* relaxations for three instances of the general affine rank minimization problem. The first instance, rank one matrix completion, was known…
(more)

Subjects/Keywords: Semidefinite programming relaxation; Lasserre hierarchy; Matrix completion; Blind deconvolution; Inverse scattering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cosse, A. (2016). Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/178083

Not specified: Masters Thesis or Doctoral Dissertation

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

Cosse, Augustin. “Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution.” 2016. Thesis, Université Catholique de Louvain. Accessed June 20, 2019. http://hdl.handle.net/2078.1/178083.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cosse, Augustin. “Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution.” 2016. Web. 20 Jun 2019.

Vancouver:

Cosse A. Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2078.1/178083.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cosse A. Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/178083

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

13.
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 June 20, 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. 20 Jun 2019.

Vancouver:

Hall G. Optimization over Nonnegative and Convex Polynomials with and without Semidefinite Programming . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Jun 20]. 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

University of Illinois – Urbana-Champaign

14.
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 June 20, 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. 20 Jun 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 Jun 20]. 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

University of Waterloo

15.
Zvereva, Margarita.
Mathematical *Programming* Formulations of the Planar Facility Location Problem.

Degree: 2007, University of Waterloo

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

► The facility location problem is the task of optimally placing a given number of facilities in a certain subset of the plane. In this thesis,…
(more)

Subjects/Keywords: facility location; semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zvereva, M. (2007). Mathematical Programming Formulations of the Planar Facility Location Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3283

Not specified: Masters Thesis or Doctoral Dissertation

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

Zvereva, Margarita. “Mathematical Programming Formulations of the Planar Facility Location Problem.” 2007. Thesis, University of Waterloo. Accessed June 20, 2019. http://hdl.handle.net/10012/3283.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zvereva, Margarita. “Mathematical Programming Formulations of the Planar Facility Location Problem.” 2007. Web. 20 Jun 2019.

Vancouver:

Zvereva M. Mathematical Programming Formulations of the Planar Facility Location Problem. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10012/3283.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zvereva M. Mathematical Programming Formulations of the Planar Facility Location Problem. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3283

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

16.
Landry, Jason Conrad.
A Robust Optimization Approach to the Self-scheduling Problem Using *Semidefinite* * Programming*.

Degree: 2010, University of Waterloo

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

► In deregulated electricity markets, generating companies submit energy bids which are derived from a self-schedule. In this thesis, we propose an improved *semidefinite* *programming*-based model…
(more)

Subjects/Keywords: Semidefinite Programming; Robust Optimization; Self-scheduling problem; Electricity markets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Landry, J. C. (2010). A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4961

Not specified: Masters Thesis or Doctoral Dissertation

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

Landry, Jason Conrad. “A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming.” 2010. Thesis, University of Waterloo. Accessed June 20, 2019. http://hdl.handle.net/10012/4961.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Landry, Jason Conrad. “A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming.” 2010. Web. 20 Jun 2019.

Vancouver:

Landry JC. A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10012/4961.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Landry JC. A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4961

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

17. -8689-6770. Strong lower bounds on generic convex relaxations.

Degree: Computer Sciences, 2016, University of Texas – Austin

URL: http://hdl.handle.net/2152/44040

► Despite significant successes in understanding the hardness of computational problems based on standard assumptions such as P != NP, there are important settings where the…
(more)

Subjects/Keywords: Lower bounds; Semidefinite programming; Planted clique; Constraint satisfaction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-8689-6770. (2016). Strong lower bounds on generic convex relaxations. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/44040

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Thesis, University of Texas – Austin. Accessed June 20, 2019. http://hdl.handle.net/2152/44040.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Web. 20 Jun 2019.

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

Author name may be incomplete

Vancouver:

-8689-6770. Strong lower bounds on generic convex relaxations. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2152/44040.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-8689-6770. Strong lower bounds on generic convex relaxations. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/44040

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

University of Minnesota

18. Kauffman, Christopher Daniel. Computational methods for protein structure prediction and energy minimization.

Degree: PhD, 2013, University of Minnesota

URL: http://purl.umn.edu/158523

► The importance of proteins in biological systems cannot be overstated: genetic defects manifest themselves in misfolded proteins with tremendous human cost, drugs in turn target…
(more)

Subjects/Keywords: Machine learning; Protein decoys; Protein structure prediction; Semidefinite programming; Structural biology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kauffman, C. D. (2013). Computational methods for protein structure prediction and energy minimization. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/158523

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

Kauffman, Christopher Daniel. “Computational methods for protein structure prediction and energy minimization.” 2013. Doctoral Dissertation, University of Minnesota. Accessed June 20, 2019. http://purl.umn.edu/158523.

MLA Handbook (7^{th} Edition):

Kauffman, Christopher Daniel. “Computational methods for protein structure prediction and energy minimization.” 2013. Web. 20 Jun 2019.

Vancouver:

Kauffman CD. Computational methods for protein structure prediction and energy minimization. [Internet] [Doctoral dissertation]. University of Minnesota; 2013. [cited 2019 Jun 20]. Available from: http://purl.umn.edu/158523.

Council of Science Editors:

Kauffman CD. Computational methods for protein structure prediction and energy minimization. [Doctoral Dissertation]. University of Minnesota; 2013. Available from: http://purl.umn.edu/158523

Washington State University

19.
[No author].
CONTRIBUTIONS TO THE THEORY OF *SEMIDEFINITE* *PROGRAMMING* UNDER UNCERTAINTY
.

Degree: 2012, Washington State University

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

► Stochastic *semidefinite* programs (SSDPs) were introduced recently as a natural extension of two-stage stochastic linear programs and of *semidefinite* programs. Theoretical results for stochastic linear…
(more)

Subjects/Keywords: Applied mathematics; Operations research; PROGRAMMING; SEMIDEFINITE; Stochastic; Uncertainty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2012). CONTRIBUTIONS TO THE THEORY OF SEMIDEFINITE PROGRAMMING UNDER UNCERTAINTY . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/4635

Not specified: Masters Thesis or Doctoral Dissertation

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

author], [No. “CONTRIBUTIONS TO THE THEORY OF SEMIDEFINITE PROGRAMMING UNDER UNCERTAINTY .” 2012. Thesis, Washington State University. Accessed June 20, 2019. http://hdl.handle.net/2376/4635.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

author], [No. “CONTRIBUTIONS TO THE THEORY OF SEMIDEFINITE PROGRAMMING UNDER UNCERTAINTY .” 2012. Web. 20 Jun 2019.

Vancouver:

author] [. CONTRIBUTIONS TO THE THEORY OF SEMIDEFINITE PROGRAMMING UNDER UNCERTAINTY . [Internet] [Thesis]. Washington State University; 2012. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2376/4635.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. CONTRIBUTIONS TO THE THEORY OF SEMIDEFINITE PROGRAMMING UNDER UNCERTAINTY . [Thesis]. Washington State University; 2012. Available from: http://hdl.handle.net/2376/4635

Not specified: Masters Thesis or Doctoral Dissertation

Washington State University

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

Degree: 2016, Washington State University

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Pontifical Catholic University of Rio de Janeiro

21. DANIEL FLEISCHMAN. [en] AN IMPROVED EXACT METHOD FOR THE UBQP.

Degree: 2011, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054

►

[pt] A Programação Quadrática Binária Irrestrita (UBQP) é amplamente estudada. Trata-se de uma ferramenta de modelagem poderosa, mas otimizar de um problema NP-difícil. Neste trabalho… (more)

Subjects/Keywords: [pt] SEMIDEFINITE PROGRAMMING; [pt] BRANCH-AND-BOUND; [pt] UNCONSTRAINED BINARY QUADRATIC PROGRAMMING

Record Details Similar Records

❌

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

APA (6^{th} Edition):

FLEISCHMAN, D. (2011). [en] AN IMPROVED EXACT METHOD FOR THE UBQP. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054

Not specified: Masters Thesis or Doctoral Dissertation

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

FLEISCHMAN, DANIEL. “[en] AN IMPROVED EXACT METHOD FOR THE UBQP.” 2011. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed June 20, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

FLEISCHMAN, DANIEL. “[en] AN IMPROVED EXACT METHOD FOR THE UBQP.” 2011. Web. 20 Jun 2019.

Vancouver:

FLEISCHMAN D. [en] AN IMPROVED EXACT METHOD FOR THE UBQP. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2011. [cited 2019 Jun 20]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

FLEISCHMAN D. [en] AN IMPROVED EXACT METHOD FOR THE UBQP. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2011. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

22. 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

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 June 20, 2019. http://hdl.handle.net/10012/8662.

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. 20 Jun 2019.

Vancouver:

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

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 Iowa

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

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

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Iowa

24.
Xu, Guanglin.
Optimization under uncertainty: conic *programming* representations, relaxations, and approximations.

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

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

► In practice, the presence of uncertain parameters in optimization problems introduces new challenges in modeling and solvability to operations research. There are three main…
(more)

Subjects/Keywords: Conic programming; Copositive programming; Operations research; Robust optimization; Semidefinite programming; Stochastic optimization; Business Administration, Management, and Operations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, G. (2017). Optimization under uncertainty: conic programming representations, relaxations, and approximations. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/5881

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

Xu, Guanglin. “Optimization under uncertainty: conic programming representations, relaxations, and approximations.” 2017. Doctoral Dissertation, University of Iowa. Accessed June 20, 2019. https://ir.uiowa.edu/etd/5881.

MLA Handbook (7^{th} Edition):

Xu, Guanglin. “Optimization under uncertainty: conic programming representations, relaxations, and approximations.” 2017. Web. 20 Jun 2019.

Vancouver:

Xu G. Optimization under uncertainty: conic programming representations, relaxations, and approximations. [Internet] [Doctoral dissertation]. University of Iowa; 2017. [cited 2019 Jun 20]. Available from: https://ir.uiowa.edu/etd/5881.

Council of Science Editors:

Xu G. Optimization under uncertainty: conic programming representations, relaxations, and approximations. [Doctoral Dissertation]. University of Iowa; 2017. Available from: https://ir.uiowa.edu/etd/5881

Carnegie Mellon University

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

Degree: 2010, Carnegie Mellon University

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

26. Russi, Trent Michael. Uncertainty Quantification with Experimental Data and Complex System Models.

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

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

► This dissertation discusses uncertainty quantication as posed in the Data Collaboration framework. Data Collaboration is a methodology for combining experimental data and system models to…
(more)

Subjects/Keywords: Engineering, Mechanical; Applied Mathematics; Active subspace; Data collaboration; Semidefinite programming; Surrogate modeling; Uncertainty quantification

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Russi, T. M. (2010). Uncertainty Quantification with Experimental Data and Complex System Models. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5d01s25c

Not specified: Masters Thesis or Doctoral Dissertation

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

Russi, Trent Michael. “Uncertainty Quantification with Experimental Data and Complex System Models.” 2010. Thesis, University of California – Berkeley. Accessed June 20, 2019. http://www.escholarship.org/uc/item/5d01s25c.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Russi, Trent Michael. “Uncertainty Quantification with Experimental Data and Complex System Models.” 2010. Web. 20 Jun 2019.

Vancouver:

Russi TM. Uncertainty Quantification with Experimental Data and Complex System Models. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2019 Jun 20]. Available from: http://www.escholarship.org/uc/item/5d01s25c.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Russi TM. Uncertainty Quantification with Experimental Data and Complex System Models. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/5d01s25c

Not specified: Masters Thesis or Doctoral Dissertation

University of Sydney

27. Bhim, Louis. Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing .

Degree: 2017, University of Sydney

URL: http://hdl.handle.net/2123/16509

► This thesis introduces a new approach for obtaining smooth deterministic upper bounds for the solutions to bounded domain obstacle problems. These bounding functions are characterized…
(more)

Subjects/Keywords: Polynomial Supersolution; Obstacle Problem; American Option; Regime-Switching; Financial Derivative Pricing; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhim, L. (2017). Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/16509

Not specified: Masters Thesis or Doctoral Dissertation

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

Bhim, Louis. “Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing .” 2017. Thesis, University of Sydney. Accessed June 20, 2019. http://hdl.handle.net/2123/16509.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bhim, Louis. “Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing .” 2017. Web. 20 Jun 2019.

Vancouver:

Bhim L. Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing . [Internet] [Thesis]. University of Sydney; 2017. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2123/16509.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhim L. Polynomial Bounds for Solutions to Boundary Value and Obstacle Problems with Applications to Financial Derivative Pricing . [Thesis]. University of Sydney; 2017. Available from: http://hdl.handle.net/2123/16509

Not specified: Masters Thesis or Doctoral Dissertation

University of Sydney

28. Jafarizadeh, Saber. Distributed coding and algorithm optimization for large-scale networked systems .

Degree: 2014, University of Sydney

URL: http://hdl.handle.net/2123/13238

► In this thesis design and optimization of several distributed algorithms in large-scale networked systems is studied. The studied algorithms operate on networks of autonomous agents…
(more)

Subjects/Keywords: Distributed consensus; Semidefinite programming; Distributed data storage; Network coding; Y-networks; Fountain codes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jafarizadeh, S. (2014). Distributed coding and algorithm optimization for large-scale networked systems . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/13238

Not specified: Masters Thesis or Doctoral Dissertation

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

Jafarizadeh, Saber. “Distributed coding and algorithm optimization for large-scale networked systems .” 2014. Thesis, University of Sydney. Accessed June 20, 2019. http://hdl.handle.net/2123/13238.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jafarizadeh, Saber. “Distributed coding and algorithm optimization for large-scale networked systems .” 2014. Web. 20 Jun 2019.

Vancouver:

Jafarizadeh S. Distributed coding and algorithm optimization for large-scale networked systems . [Internet] [Thesis]. University of Sydney; 2014. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/2123/13238.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jafarizadeh S. Distributed coding and algorithm optimization for large-scale networked systems . [Thesis]. University of Sydney; 2014. Available from: http://hdl.handle.net/2123/13238

Not specified: Masters Thesis or Doctoral Dissertation

Harvard University

29. Sheriff, Jamin Lebbe. The Convexity of Quadratic Maps and the Controllability of Coupled Systems.

Degree: PhD, Engineering and Applied Sciences, 2013, Harvard University

URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11030574

►

A quadratic form on (ℝ^{n}) is a map of the form (x \mapsto x^{T} M x), where M is a symmetric (n × n) matrix.…
(more)

Subjects/Keywords: Electrical engineering; Applied mathematics; Mathematics; controllability; control theory; convexity; lie groups; quadratic maps; semidefinite programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sheriff, J. L. (2013). The Convexity of Quadratic Maps and the Controllability of Coupled Systems. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:11030574

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

Sheriff, Jamin Lebbe. “The Convexity of Quadratic Maps and the Controllability of Coupled Systems.” 2013. Doctoral Dissertation, Harvard University. Accessed June 20, 2019. http://nrs.harvard.edu/urn-3:HUL.InstRepos:11030574.

MLA Handbook (7^{th} Edition):

Sheriff, Jamin Lebbe. “The Convexity of Quadratic Maps and the Controllability of Coupled Systems.” 2013. Web. 20 Jun 2019.

Vancouver:

Sheriff JL. The Convexity of Quadratic Maps and the Controllability of Coupled Systems. [Internet] [Doctoral dissertation]. Harvard University; 2013. [cited 2019 Jun 20]. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11030574.

Council of Science Editors:

Sheriff JL. The Convexity of Quadratic Maps and the Controllability of Coupled Systems. [Doctoral Dissertation]. Harvard University; 2013. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11030574

Virginia Tech

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

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

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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