Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(quadratic programming). Showing records 1 – 30 of 157 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of Limerick

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

Degree: 2010, University of Limerick

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Conway, Christina. “Localised sound optimisation in small enclosures.” 2010. Web. 22 May 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Oregon State University

2. Slagle, Rodney L. Modification of Beale's method for quadratic programming problems.

Degree: MS, Statistics, 1978, Oregon State University

 This thesis deals with a modification to an existing mathematical ppogramming algorithm called Beale's method. This method is designed to solve only quadratic or linear… (more)

Subjects/Keywords: Quadratic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slagle, R. L. (1978). Modification of Beale's method for quadratic programming problems. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42812

Chicago Manual of Style (16th Edition):

Slagle, Rodney L. “Modification of Beale's method for quadratic programming problems.” 1978. Masters Thesis, Oregon State University. Accessed May 22, 2019. http://hdl.handle.net/1957/42812.

MLA Handbook (7th Edition):

Slagle, Rodney L. “Modification of Beale's method for quadratic programming problems.” 1978. Web. 22 May 2019.

Vancouver:

Slagle RL. Modification of Beale's method for quadratic programming problems. [Internet] [Masters thesis]. Oregon State University; 1978. [cited 2019 May 22]. Available from: http://hdl.handle.net/1957/42812.

Council of Science Editors:

Slagle RL. Modification of Beale's method for quadratic programming problems. [Masters Thesis]. Oregon State University; 1978. Available from: http://hdl.handle.net/1957/42812


University of Minnesota

3. Tranter, John. Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval.

Degree: M.S.E.E., Electrical Engineering, 2016, University of Minnesota

 Unit-modulus Least Squares (ULS) problems arise in many applications, including phase-only beamforming, phase retrieval and radar code design. These problems are NP-hard, so there exist… (more)

Subjects/Keywords: Beamforming; Phase Retrieval; Quadratic programming; Unit-modulus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tranter, J. (2016). Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/182098

Chicago Manual of Style (16th Edition):

Tranter, John. “Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval.” 2016. Masters Thesis, University of Minnesota. Accessed May 22, 2019. http://hdl.handle.net/11299/182098.

MLA Handbook (7th Edition):

Tranter, John. “Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval.” 2016. Web. 22 May 2019.

Vancouver:

Tranter J. Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval. [Internet] [Masters thesis]. University of Minnesota; 2016. [cited 2019 May 22]. Available from: http://hdl.handle.net/11299/182098.

Council of Science Editors:

Tranter J. Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval. [Masters Thesis]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/182098

4. Vankova, Martina. Algorithms for the solution of the quadratic programming problem.

Degree: Faculty of Science, 2004, University of Port Elizabeth

 The purpose of this dissertation was to provide a review of the theory of Optimization, in particular quadratic programming, and the algorithms suitable for solving… (more)

Subjects/Keywords: Quadratic programming; Nonlinear programming; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vankova, M. (2004). Algorithms for the solution of the quadratic programming problem. (Thesis). University of Port Elizabeth. Retrieved from http://hdl.handle.net/10948/348

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vankova, Martina. “Algorithms for the solution of the quadratic programming problem.” 2004. Thesis, University of Port Elizabeth. Accessed May 22, 2019. http://hdl.handle.net/10948/348.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vankova, Martina. “Algorithms for the solution of the quadratic programming problem.” 2004. Web. 22 May 2019.

Vancouver:

Vankova M. Algorithms for the solution of the quadratic programming problem. [Internet] [Thesis]. University of Port Elizabeth; 2004. [cited 2019 May 22]. Available from: http://hdl.handle.net/10948/348.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vankova M. Algorithms for the solution of the quadratic programming problem. [Thesis]. University of Port Elizabeth; 2004. Available from: http://hdl.handle.net/10948/348

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

5. Eu, Jai Hong. Quadratic approximation methods for constrained nonlinear programming.

Degree: PhD, Industrial engineering, 1982, Georgia Tech

Subjects/Keywords: Nonlinear programming; Quadratic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eu, J. H. (1982). Quadratic approximation methods for constrained nonlinear programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/30674

Chicago Manual of Style (16th Edition):

Eu, Jai Hong. “Quadratic approximation methods for constrained nonlinear programming.” 1982. Doctoral Dissertation, Georgia Tech. Accessed May 22, 2019. http://hdl.handle.net/1853/30674.

MLA Handbook (7th Edition):

Eu, Jai Hong. “Quadratic approximation methods for constrained nonlinear programming.” 1982. Web. 22 May 2019.

Vancouver:

Eu JH. Quadratic approximation methods for constrained nonlinear programming. [Internet] [Doctoral dissertation]. Georgia Tech; 1982. [cited 2019 May 22]. Available from: http://hdl.handle.net/1853/30674.

Council of Science Editors:

Eu JH. Quadratic approximation methods for constrained nonlinear programming. [Doctoral Dissertation]. Georgia Tech; 1982. Available from: http://hdl.handle.net/1853/30674


Georgia Tech

6. Edwards, Teresa Dawn. The box method for minimizing strictly convex functions over convex sets.

Degree: PhD, Industrial engineering, 1990, Georgia Tech

Subjects/Keywords: Quadratic programming; Nonlinear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Edwards, T. D. (1990). The box method for minimizing strictly convex functions over convex sets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/30690

Chicago Manual of Style (16th Edition):

Edwards, Teresa Dawn. “The box method for minimizing strictly convex functions over convex sets.” 1990. Doctoral Dissertation, Georgia Tech. Accessed May 22, 2019. http://hdl.handle.net/1853/30690.

MLA Handbook (7th Edition):

Edwards, Teresa Dawn. “The box method for minimizing strictly convex functions over convex sets.” 1990. Web. 22 May 2019.

Vancouver:

Edwards TD. The box method for minimizing strictly convex functions over convex sets. [Internet] [Doctoral dissertation]. Georgia Tech; 1990. [cited 2019 May 22]. Available from: http://hdl.handle.net/1853/30690.

Council of Science Editors:

Edwards TD. The box method for minimizing strictly convex functions over convex sets. [Doctoral Dissertation]. Georgia Tech; 1990. Available from: http://hdl.handle.net/1853/30690


University of New South Wales

7. Lau, Karen Karman. Multistage quadratic stochastic programming.

Degree: Mathematics, 1999, University of New South Wales

 Multistage stochastic programming is an important tool in medium to long term planning where there are uncertainties in the data. In this thesis, we consider… (more)

Subjects/Keywords: Quadratic programming; Stochastic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lau, K. K. (1999). Multistage quadratic stochastic programming. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/32672 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1707/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Lau, Karen Karman. “Multistage quadratic stochastic programming.” 1999. Doctoral Dissertation, University of New South Wales. Accessed May 22, 2019. http://handle.unsw.edu.au/1959.4/32672 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1707/SOURCE02?view=true.

MLA Handbook (7th Edition):

Lau, Karen Karman. “Multistage quadratic stochastic programming.” 1999. Web. 22 May 2019.

Vancouver:

Lau KK. Multistage quadratic stochastic programming. [Internet] [Doctoral dissertation]. University of New South Wales; 1999. [cited 2019 May 22]. Available from: http://handle.unsw.edu.au/1959.4/32672 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1707/SOURCE02?view=true.

Council of Science Editors:

Lau KK. Multistage quadratic stochastic programming. [Doctoral Dissertation]. University of New South Wales; 1999. Available from: http://handle.unsw.edu.au/1959.4/32672 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1707/SOURCE02?view=true


University of Colorado

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

Degree: PhD, Applied Mathematics, 2019, University of Colorado

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

Subjects/Keywords: nonconvex optimization; bilinear programming; quadratic programming; super-resolution imaging; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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


University of British Columbia

9. Boljunčić, Jadranka. Quadratic programming : quantitative analysis and polynomial running time algorithms .

Degree: 1987, University of British Columbia

 Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial… (more)

Subjects/Keywords: Nonlinear programming; Quadratic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boljunčić, J. (1987). Quadratic programming : quantitative analysis and polynomial running time algorithms . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/27532

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Boljunčić, Jadranka. “Quadratic programming : quantitative analysis and polynomial running time algorithms .” 1987. Thesis, University of British Columbia. Accessed May 22, 2019. http://hdl.handle.net/2429/27532.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Boljunčić, Jadranka. “Quadratic programming : quantitative analysis and polynomial running time algorithms .” 1987. Web. 22 May 2019.

Vancouver:

Boljunčić J. Quadratic programming : quantitative analysis and polynomial running time algorithms . [Internet] [Thesis]. University of British Columbia; 1987. [cited 2019 May 22]. Available from: http://hdl.handle.net/2429/27532.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Boljunčić J. Quadratic programming : quantitative analysis and polynomial running time algorithms . [Thesis]. University of British Columbia; 1987. Available from: http://hdl.handle.net/2429/27532

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

10. Ding, Yichuan. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming.

Degree: 2007, University of Waterloo

 Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time… (more)

Subjects/Keywords: Semidefinite Programming; Quadratically Constrained Quadratic Programming; Quadratic Matrix Programming; Quadratic Assignment Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, Y. (2007). On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ding, Yichuan. “On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming.” 2007. Thesis, University of Waterloo. Accessed May 22, 2019. http://hdl.handle.net/10012/3044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ding, Yichuan. “On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming.” 2007. Web. 22 May 2019.

Vancouver:

Ding Y. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 May 22]. Available from: http://hdl.handle.net/10012/3044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ding Y. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Newcastle

11. Foster, James Daniel. Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow.

Degree: PhD, 2014, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

This thesis investigates of the structure and solution of quadratically constrained optimization problems incorporating models of electrical power… (more)

Subjects/Keywords: optimization; mixed-integer nonlinear programming; quadratic programming; electrical power systems; optimal power flow; distributed generation; quadratic function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foster, J. D. (2014). Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1048192

Chicago Manual of Style (16th Edition):

Foster, James Daniel. “Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow.” 2014. Doctoral Dissertation, University of Newcastle. Accessed May 22, 2019. http://hdl.handle.net/1959.13/1048192.

MLA Handbook (7th Edition):

Foster, James Daniel. “Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow.” 2014. Web. 22 May 2019.

Vancouver:

Foster JD. Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow. [Internet] [Doctoral dissertation]. University of Newcastle; 2014. [cited 2019 May 22]. Available from: http://hdl.handle.net/1959.13/1048192.

Council of Science Editors:

Foster JD. Mixed-integer quadratically-constrained programming, piecewise-linear approximation and error analysis with applications in power flow. [Doctoral Dissertation]. University of Newcastle; 2014. Available from: http://hdl.handle.net/1959.13/1048192


Pontifical Catholic University of Rio de Janeiro

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

Degree: 2011, Pontifical Catholic University of Rio de Janeiro

[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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rutgers University

13. Ye, Jiankuan, 1976-. Experimental study and geometrical analysis of a linear programming support vector machine.

Degree: PhD, Computer Science, 2011, Rutgers University

This dissertation describes a systematic study of a linear programming SVM proposed by Vapnik, which directly minimizes the ratio of support vectors to the number… (more)

Subjects/Keywords: Linear programming – Data processing; Support vector machines; Quadratic programming – Computer programs; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ye, Jiankuan, 1. (2011). Experimental study and geometrical analysis of a linear programming support vector machine. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057715

Chicago Manual of Style (16th Edition):

Ye, Jiankuan, 1976-. “Experimental study and geometrical analysis of a linear programming support vector machine.” 2011. Doctoral Dissertation, Rutgers University. Accessed May 22, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057715.

MLA Handbook (7th Edition):

Ye, Jiankuan, 1976-. “Experimental study and geometrical analysis of a linear programming support vector machine.” 2011. Web. 22 May 2019.

Vancouver:

Ye, Jiankuan 1. Experimental study and geometrical analysis of a linear programming support vector machine. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2019 May 22]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057715.

Council of Science Editors:

Ye, Jiankuan 1. Experimental study and geometrical analysis of a linear programming support vector machine. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000057715

14. Quddus, Md Abdul. Concave quadratic programming; -.

Degree: Statistics, 1984, Aligarh Muslim University

Abstract available newline newline

Bibliography p.i-viii

Advisors/Committee Members: Islam, Zahirul.

Subjects/Keywords: Concave; Quadratic; Programming; Quadratio; Polyhebron

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quddus, M. A. (1984). Concave quadratic programming; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/51754

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Quddus, Md Abdul. “Concave quadratic programming; -.” 1984. Thesis, Aligarh Muslim University. Accessed May 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/51754.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Quddus, Md Abdul. “Concave quadratic programming; -.” 1984. Web. 22 May 2019.

Vancouver:

Quddus MA. Concave quadratic programming; -. [Internet] [Thesis]. Aligarh Muslim University; 1984. [cited 2019 May 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51754.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Quddus MA. Concave quadratic programming; -. [Thesis]. Aligarh Muslim University; 1984. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51754

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Dalhousie University

15. Fraser, Kathleen. Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution.

Degree: Master of Computer Science, Faculty of Computer Science, 2012, Dalhousie University

 The Barzilai-Borwein (BB) method for unconstrained optimization has attracted attention for its "chaotic" behaviour and fast convergence on image deconvolution problems. However, images with large… (more)

Subjects/Keywords: Image processing; image deconvolution; fluorescence microscopy; quadratic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fraser, K. (2012). Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/15712

Chicago Manual of Style (16th Edition):

Fraser, Kathleen. “Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution.” 2012. Masters Thesis, Dalhousie University. Accessed May 22, 2019. http://hdl.handle.net/10222/15712.

MLA Handbook (7th Edition):

Fraser, Kathleen. “Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution.” 2012. Web. 22 May 2019.

Vancouver:

Fraser K. Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution. [Internet] [Masters thesis]. Dalhousie University; 2012. [cited 2019 May 22]. Available from: http://hdl.handle.net/10222/15712.

Council of Science Editors:

Fraser K. Projected Barzilai-Borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution. [Masters Thesis]. Dalhousie University; 2012. Available from: http://hdl.handle.net/10222/15712


University of Alberta

16. Khabbazibasmenj, Arash. Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications.

Degree: PhD, Department of Electrical and Computer Engineering, 2013, University of Alberta

 In this thesis, we introduce and solve a particular generalization of the quadratically constrained quadratic programming (QCQP) problem which is frequently encountered in the fields… (more)

Subjects/Keywords: Generalized Quadratically Constrained Quadratic Programming; Cooperative Communications; Array Signal Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khabbazibasmenj, A. (2013). Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/hm50tr89c

Chicago Manual of Style (16th Edition):

Khabbazibasmenj, Arash. “Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications.” 2013. Doctoral Dissertation, University of Alberta. Accessed May 22, 2019. https://era.library.ualberta.ca/files/hm50tr89c.

MLA Handbook (7th Edition):

Khabbazibasmenj, Arash. “Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications.” 2013. Web. 22 May 2019.

Vancouver:

Khabbazibasmenj A. Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2019 May 22]. Available from: https://era.library.ualberta.ca/files/hm50tr89c.

Council of Science Editors:

Khabbazibasmenj A. Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/hm50tr89c


Baylor University

17. Yang, Zhuocheng. Remotely sensed hyperspectral image unmixing.

Degree: Engineering., 2010, Baylor University

 Estimating abundance fractions of materials in hyperspectral images is an important area of study in the field of remote sensing. The need for liner unmixing… (more)

Subjects/Keywords: Hyperspectral imaging.; Linear unmixing.; Parameter estimation.; Quadratic programming.; Remote sensing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Z. (2010). Remotely sensed hyperspectral image unmixing. (Thesis). Baylor University. Retrieved from http://hdl.handle.net/2104/8068

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yang, Zhuocheng. “Remotely sensed hyperspectral image unmixing. ” 2010. Thesis, Baylor University. Accessed May 22, 2019. http://hdl.handle.net/2104/8068.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yang, Zhuocheng. “Remotely sensed hyperspectral image unmixing. ” 2010. Web. 22 May 2019.

Vancouver:

Yang Z. Remotely sensed hyperspectral image unmixing. [Internet] [Thesis]. Baylor University; 2010. [cited 2019 May 22]. Available from: http://hdl.handle.net/2104/8068.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang Z. Remotely sensed hyperspectral image unmixing. [Thesis]. Baylor University; 2010. Available from: http://hdl.handle.net/2104/8068

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


King Abdullah University of Science and Technology

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

Degree: 2012, King Abdullah University of Science and Technology

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

19. Wang, Xianzhi. Resolution of Ties in Parametric Quadratic Programming.

Degree: 2004, University of Waterloo

 We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such… (more)

Subjects/Keywords: Mathematics; Parametric quadratic programming; ties

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, X. (2004). Resolution of Ties in Parametric Quadratic Programming. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1199

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Xianzhi. “Resolution of Ties in Parametric Quadratic Programming.” 2004. Thesis, University of Waterloo. Accessed May 22, 2019. http://hdl.handle.net/10012/1199.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Xianzhi. “Resolution of Ties in Parametric Quadratic Programming.” 2004. Web. 22 May 2019.

Vancouver:

Wang X. Resolution of Ties in Parametric Quadratic Programming. [Internet] [Thesis]. University of Waterloo; 2004. [cited 2019 May 22]. Available from: http://hdl.handle.net/10012/1199.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang X. Resolution of Ties in Parametric Quadratic Programming. [Thesis]. University of Waterloo; 2004. Available from: http://hdl.handle.net/10012/1199

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Andersson, Emma. Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control.

Degree: The Institute of Technology, 2012, Linköping UniversityLinköping University

The system for mission handling in the Gripen fighter aircraft, and in its ground supporting system, consists for example of ways to plan mission… (more)

Subjects/Keywords: Model Predictive Control; Quadratic Programming; path re-planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andersson, E. (2012). Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-80638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Andersson, Emma. “Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control.” 2012. Thesis, Linköping UniversityLinköping University. Accessed May 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-80638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Andersson, Emma. “Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control.” 2012. Web. 22 May 2019.

Vancouver:

Andersson E. Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2019 May 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-80638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Andersson E. Intuitive Mission Handling with Automatic Route Re-planning using Model Predictive Control. [Thesis]. Linköping UniversityLinköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-80638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


North Carolina State University

21. Liu, Zhe. The Nearest Point Problem in a Polyhedral Cone and Its Extensions.

Degree: PhD, Operations Research, 2009, North Carolina State University

 The problem of finding the nearest point in a polyhedral cone to a given point in n-dimensional space can be formulated as a convex quadratic(more)

Subjects/Keywords: Active constraint; Projection face; Pos cone; Quadratic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2009). The Nearest Point Problem in a Polyhedral Cone and Its Extensions. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5303

Chicago Manual of Style (16th Edition):

Liu, Zhe. “The Nearest Point Problem in a Polyhedral Cone and Its Extensions.” 2009. Doctoral Dissertation, North Carolina State University. Accessed May 22, 2019. http://www.lib.ncsu.edu/resolver/1840.16/5303.

MLA Handbook (7th Edition):

Liu, Zhe. “The Nearest Point Problem in a Polyhedral Cone and Its Extensions.” 2009. Web. 22 May 2019.

Vancouver:

Liu Z. The Nearest Point Problem in a Polyhedral Cone and Its Extensions. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2019 May 22]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5303.

Council of Science Editors:

Liu Z. The Nearest Point Problem in a Polyhedral Cone and Its Extensions. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5303


Georgia Tech

22. Tao, Ye. Optimal power flow via quadratic modeling.

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

 Optimal power flow (OPF) is the choice tool for determining the optimal operating status of the power system by managing controllable devices. The importance of… (more)

Subjects/Keywords: Quadratized power flow; Three-phase optimal power flow; Sequential linear programming; Nonlinear programming; Quadratic programming; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tao, Y. (2011). Optimal power flow via quadratic modeling. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45766

Chicago Manual of Style (16th Edition):

Tao, Ye. “Optimal power flow via quadratic modeling.” 2011. Doctoral Dissertation, Georgia Tech. Accessed May 22, 2019. http://hdl.handle.net/1853/45766.

MLA Handbook (7th Edition):

Tao, Ye. “Optimal power flow via quadratic modeling.” 2011. Web. 22 May 2019.

Vancouver:

Tao Y. Optimal power flow via quadratic modeling. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 May 22]. Available from: http://hdl.handle.net/1853/45766.

Council of Science Editors:

Tao Y. Optimal power flow via quadratic modeling. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/45766


University of Iowa

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Chen J. Convex relaxations in nonconvex and applied optimization. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 May 22]. 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 Florida

24. Phan, Dung. Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction.

Degree: PhD, Mathematics, 2010, University of Florida

 In this dissertation, we develop theories and practical algorithms for optimization problems which arise from science, economics and engineering. First, an ellipsoidal branch and bound… (more)

Subjects/Keywords: Algorithms; Approximation; Ellipsoids; Function values; Integers; Linear programming; Mathematics; Objective functions; Quadratic programming; Underestimates; bound, branch, convex, global, graph, image, nonmonotone, nonsmooth, optimization, partitioning, quadratic, reconstruction, sparse, sublinear, underestimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phan, D. (2010). Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0041470

Chicago Manual of Style (16th Edition):

Phan, Dung. “Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction.” 2010. Doctoral Dissertation, University of Florida. Accessed May 22, 2019. http://ufdc.ufl.edu/UFE0041470.

MLA Handbook (7th Edition):

Phan, Dung. “Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction.” 2010. Web. 22 May 2019.

Vancouver:

Phan D. Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2019 May 22]. Available from: http://ufdc.ufl.edu/UFE0041470.

Council of Science Editors:

Phan D. Topics in Global Optimization Ellipsoidal Bisection, Graph Partitioning and Sparse Reconstruction. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0041470


Texas A&M University

25. Lee, Kooktae. Analysis of Large-Scale Asynchronous Switched Dynamical Systems.

Degree: 2015, Texas A&M University

 This dissertation addresses research problems related to the switched system as well as its application to large-scale asynchronous dynamical systems. For decades, this switched system… (more)

Subjects/Keywords: switched system; analysis and synthesis; asynchronous algorithm; distributed quadratic programming; large-scale networked control system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, K. (2015). Analysis of Large-Scale Asynchronous Switched Dynamical Systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155616

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lee, Kooktae. “Analysis of Large-Scale Asynchronous Switched Dynamical Systems.” 2015. Thesis, Texas A&M University. Accessed May 22, 2019. http://hdl.handle.net/1969.1/155616.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lee, Kooktae. “Analysis of Large-Scale Asynchronous Switched Dynamical Systems.” 2015. Web. 22 May 2019.

Vancouver:

Lee K. Analysis of Large-Scale Asynchronous Switched Dynamical Systems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 May 22]. Available from: http://hdl.handle.net/1969.1/155616.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee K. Analysis of Large-Scale Asynchronous Switched Dynamical Systems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155616

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Jesus, Nuno Manuel Boléo Teles de. Programação da produção: Otimização de Layouts Industriais.

Degree: 2017, Instituto Politécnico do Porto

O problema conhecido na literatura como “Facility layout problem (FLP)”, em que se pretende determinar a disposição de recursos de produção e a sua interação… (more)

Subjects/Keywords: Facility layout problem; Quadratic Assignment Problem; Mixed Integer Programming Problem; Particle Swarm Optimization; Gestão Industrial

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jesus, N. M. B. T. d. (2017). Programação da produção: Otimização de Layouts Industriais. (Thesis). Instituto Politécnico do Porto. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jesus, Nuno Manuel Boléo Teles de. “Programação da produção: Otimização de Layouts Industriais.” 2017. Thesis, Instituto Politécnico do Porto. Accessed May 22, 2019. https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jesus, Nuno Manuel Boléo Teles de. “Programação da produção: Otimização de Layouts Industriais.” 2017. Web. 22 May 2019.

Vancouver:

Jesus NMBTd. Programação da produção: Otimização de Layouts Industriais. [Internet] [Thesis]. Instituto Politécnico do Porto; 2017. [cited 2019 May 22]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jesus NMBTd. Programação da produção: Otimização de Layouts Industriais. [Thesis]. Instituto Politécnico do Porto; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Sul

27. Sant'anna, Leonardo Riegel. Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos.

Degree: 2014, Universidade do Rio Grande do Sul

Nesta dissertação, discute-se o problema de otimização de carteiras de investimento para estratégia passiva de Index Tracking. Os objetivos principais são (i) apresentar um modelo… (more)

Subjects/Keywords: Carteiras de investimento; Index track; Otimização; Portfolio optimization; Algoritmo genético; Quadratic integer programming; Asset management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sant'anna, L. R. (2014). Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/96876

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sant'anna, Leonardo Riegel. “Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed May 22, 2019. http://hdl.handle.net/10183/96876.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sant'anna, Leonardo Riegel. “Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos.” 2014. Web. 22 May 2019.

Vancouver:

Sant'anna LR. Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2019 May 22]. Available from: http://hdl.handle.net/10183/96876.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sant'anna LR. Index Tracking com controle do número de ativos e aplicação com uso de algoritmos genéticos. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/96876

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Alabama

28. Xu, Jie. Three essays on improving ensemble models.

Degree: 2013, University of Alabama

 Ensemble models, such as bagging (Breiman, 1996), random forests (Breiman, 2001a), and boosting (Freund and Schapire, 1997), have better predictive accuracy than single classifiers. These… (more)

Subjects/Keywords: Electronic Thesis or Dissertation;  – thesis; Statistics; AdaBoost; Bagging; Classification; Predictive Modeling; Quadratic Programming; Random Forests

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, J. (2013). Three essays on improving ensemble models. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/97228

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xu, Jie. “Three essays on improving ensemble models.” 2013. Thesis, University of Alabama. Accessed May 22, 2019. http://purl.lib.ua.edu/97228.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xu, Jie. “Three essays on improving ensemble models.” 2013. Web. 22 May 2019.

Vancouver:

Xu J. Three essays on improving ensemble models. [Internet] [Thesis]. University of Alabama; 2013. [cited 2019 May 22]. Available from: http://purl.lib.ua.edu/97228.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu J. Three essays on improving ensemble models. [Thesis]. University of Alabama; 2013. Available from: http://purl.lib.ua.edu/97228

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

29. Wang, Zhao-yu. Some Variants of Self-Constructing Clustering.

Degree: Master, Electrical Engineering, 2017, NSYSU

 Self-constructing clustering (SCC) was proposed, in which the number of clusters is not required to be specified in advance by the user. For a given… (more)

Subjects/Keywords: training cycle; iterative computing; quadratic programming; z-distance; data clustering; data mining; self-constructing clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Z. (2017). Some Variants of Self-Constructing Clustering. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619117-161041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Zhao-yu. “Some Variants of Self-Constructing Clustering.” 2017. Thesis, NSYSU. Accessed May 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619117-161041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Zhao-yu. “Some Variants of Self-Constructing Clustering.” 2017. Web. 22 May 2019.

Vancouver:

Wang Z. Some Variants of Self-Constructing Clustering. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 May 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619117-161041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Z. Some Variants of Self-Constructing Clustering. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619117-161041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

30. Fu, Cong. Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S.

Degree: PhD, Social and Behavioral Sciences, 2015, Louisiana State University

 The Cancer Centers designated by the National Cancer Institute (NCI) form the “backbone” of the cancer care system in the United States. Awarded via a… (more)

Subjects/Keywords: NCI Cancer Center; geographic disparities; demographic disparities; optimization; equal accessibility; Quadratic Programming; Particle Swarm Optimization.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, C. (2015). Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07032015-223738 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1363

Chicago Manual of Style (16th Edition):

Fu, Cong. “Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S.” 2015. Doctoral Dissertation, Louisiana State University. Accessed May 22, 2019. etd-07032015-223738 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1363.

MLA Handbook (7th Edition):

Fu, Cong. “Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S.” 2015. Web. 22 May 2019.

Vancouver:

Fu C. Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S. [Internet] [Doctoral dissertation]. Louisiana State University; 2015. [cited 2019 May 22]. Available from: etd-07032015-223738 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1363.

Council of Science Editors:

Fu C. Planning Towards Equal Spatial Accessibility of NCI Cancer Centers Across Geographic Areas and Demographic Groups in the U.S. [Doctoral Dissertation]. Louisiana State University; 2015. Available from: etd-07032015-223738 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1363

[1] [2] [3] [4] [5] [6]

.