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:(Interior Point Method). Showing records 1 – 30 of 39 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


Carnegie Mellon University

1. Wan, Wei. Advances in Newton-based Barrier Methods for Nonlinear Programming.

Degree: 2017, Carnegie Mellon University

 Nonlinear programming is a very important tool for optimizing many systems in science and engineering. The interior point solver IPOPT has become one of the… (more)

Subjects/Keywords: Dynamic optimization; Interior Point Method; MPCC; NLP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wan, W. (2017). Advances in Newton-based Barrier Methods for Nonlinear Programming. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/998

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

Wan, Wei. “Advances in Newton-based Barrier Methods for Nonlinear Programming.” 2017. Thesis, Carnegie Mellon University. Accessed November 15, 2019. http://repository.cmu.edu/dissertations/998.

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

MLA Handbook (7th Edition):

Wan, Wei. “Advances in Newton-based Barrier Methods for Nonlinear Programming.” 2017. Web. 15 Nov 2019.

Vancouver:

Wan W. Advances in Newton-based Barrier Methods for Nonlinear Programming. [Internet] [Thesis]. Carnegie Mellon University; 2017. [cited 2019 Nov 15]. Available from: http://repository.cmu.edu/dissertations/998.

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

Council of Science Editors:

Wan W. Advances in Newton-based Barrier Methods for Nonlinear Programming. [Thesis]. Carnegie Mellon University; 2017. Available from: http://repository.cmu.edu/dissertations/998

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


University of Edinburgh

2. Al-Jeiroudi, Ghussoun. On inexact Newton directions in interior point methods for linear optimization.

Degree: 2009, University of Edinburgh

 In each iteration of the interior point method (IPM) at least one linear system has to be solved. The main computational effort of IPMs consists… (more)

Subjects/Keywords: interior point method; linear programming; preconditioned conjugate gradients

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Jeiroudi, G. (2009). On inexact Newton directions in interior point methods for linear optimization. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/3863

Chicago Manual of Style (16th Edition):

Al-Jeiroudi, Ghussoun. “On inexact Newton directions in interior point methods for linear optimization.” 2009. Doctoral Dissertation, University of Edinburgh. Accessed November 15, 2019. http://hdl.handle.net/1842/3863.

MLA Handbook (7th Edition):

Al-Jeiroudi, Ghussoun. “On inexact Newton directions in interior point methods for linear optimization.” 2009. Web. 15 Nov 2019.

Vancouver:

Al-Jeiroudi G. On inexact Newton directions in interior point methods for linear optimization. [Internet] [Doctoral dissertation]. University of Edinburgh; 2009. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1842/3863.

Council of Science Editors:

Al-Jeiroudi G. On inexact Newton directions in interior point methods for linear optimization. [Doctoral Dissertation]. University of Edinburgh; 2009. Available from: http://hdl.handle.net/1842/3863


University of Newcastle

3. Podlich, Nathan. The development of efficient algorithms for large-scale finite element limit analysis.

Degree: PhD, 2018, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Finite element limit analysis is a useful numerical method for stability assessment of a wide range of geotechnical… (more)

Subjects/Keywords: finite element limit analysis; interior point method; Cholesky factorisation; linear systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Podlich, N. (2018). The development of efficient algorithms for large-scale finite element limit analysis. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1386306

Chicago Manual of Style (16th Edition):

Podlich, Nathan. “The development of efficient algorithms for large-scale finite element limit analysis.” 2018. Doctoral Dissertation, University of Newcastle. Accessed November 15, 2019. http://hdl.handle.net/1959.13/1386306.

MLA Handbook (7th Edition):

Podlich, Nathan. “The development of efficient algorithms for large-scale finite element limit analysis.” 2018. Web. 15 Nov 2019.

Vancouver:

Podlich N. The development of efficient algorithms for large-scale finite element limit analysis. [Internet] [Doctoral dissertation]. University of Newcastle; 2018. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1959.13/1386306.

Council of Science Editors:

Podlich N. The development of efficient algorithms for large-scale finite element limit analysis. [Doctoral Dissertation]. University of Newcastle; 2018. Available from: http://hdl.handle.net/1959.13/1386306


Dalhousie University

4. Mosbah, Hossam. State Estimation in Electrical Networks.

Degree: Master of Applied Science, Department of Electrical & Computer Engineering, 2013, Dalhousie University

 The continuous growth in power system electric grid by adding new substations lead to construct many new transmission lines, transformers, control devices, and circuit breakers… (more)

Subjects/Keywords: State Estimation, Weighted Least Squares, Extend Kalman Filter, Interior Point Method, Optimization; State Estimation Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mosbah, H. (2013). State Estimation in Electrical Networks. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/15958

Chicago Manual of Style (16th Edition):

Mosbah, Hossam. “State Estimation in Electrical Networks.” 2013. Masters Thesis, Dalhousie University. Accessed November 15, 2019. http://hdl.handle.net/10222/15958.

MLA Handbook (7th Edition):

Mosbah, Hossam. “State Estimation in Electrical Networks.” 2013. Web. 15 Nov 2019.

Vancouver:

Mosbah H. State Estimation in Electrical Networks. [Internet] [Masters thesis]. Dalhousie University; 2013. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/10222/15958.

Council of Science Editors:

Mosbah H. State Estimation in Electrical Networks. [Masters Thesis]. Dalhousie University; 2013. Available from: http://hdl.handle.net/10222/15958


Texas A&M University

5. Talavatifard, Habiballah. Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction.

Degree: 2013, Texas A&M University

 A surface reconstruction and image enhancement non-linear finite element technique based on minimization of L1 norm of the total variation of the gradient is introduced.… (more)

Subjects/Keywords: L1 minimization; Parallel Computing; Image Super-resolution; Domain Decomposition; Interior Point method; Augmented Lagrangian Method; Surface Reconstruction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Talavatifard, H. (2013). Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149512

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

Talavatifard, Habiballah. “Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction.” 2013. Thesis, Texas A&M University. Accessed November 15, 2019. http://hdl.handle.net/1969.1/149512.

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

MLA Handbook (7th Edition):

Talavatifard, Habiballah. “Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction.” 2013. Web. 15 Nov 2019.

Vancouver:

Talavatifard H. Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1969.1/149512.

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

Council of Science Editors:

Talavatifard H. Application of L1 Minimization Technique to Image Super-Resolution and Surface Reconstruction. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149512

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


NSYSU

6. Shen, Wan-Bao. System Contingency Study with Power Flow Tracing Method for Congestion Management.

Degree: Master, Electrical Engineering, 2011, NSYSU

 The âCongestion Managementâ (CM) always has been an outstanding and major problem in power system operation. To solve this problem, experts compose solutions in a… (more)

Subjects/Keywords: Sensitive Matrix; Congestion Management; Equivalent Current Injection; System Contingency; Power Flow Tracing Method; Contribution Matrix; Predictor-Corrector Interior Point Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shen, W. (2011). System Contingency Study with Power Flow Tracing Method for Congestion Management. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627111-215905

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

Shen, Wan-Bao. “System Contingency Study with Power Flow Tracing Method for Congestion Management.” 2011. Thesis, NSYSU. Accessed November 15, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627111-215905.

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

MLA Handbook (7th Edition):

Shen, Wan-Bao. “System Contingency Study with Power Flow Tracing Method for Congestion Management.” 2011. Web. 15 Nov 2019.

Vancouver:

Shen W. System Contingency Study with Power Flow Tracing Method for Congestion Management. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Nov 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627111-215905.

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

Council of Science Editors:

Shen W. System Contingency Study with Power Flow Tracing Method for Congestion Management. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627111-215905

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


Linköping University

7. Andersson, Amanda. Fast Real-Time MPC for Fighter Aircraft.

Degree: Automatic Control, 2018, Linköping University

  The main topic of this thesis is model predictive control (MPC) of an unstable fighter aircraft. When flying it is important to be able… (more)

Subjects/Keywords: MPC; fast MPC; explicit MPC; fighter; aircraft; neural network; model predictive control; interior-point method; Control Engineering; Reglerteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andersson, A. (2018). Fast Real-Time MPC for Fighter Aircraft. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148580

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, Amanda. “Fast Real-Time MPC for Fighter Aircraft.” 2018. Thesis, Linköping University. Accessed November 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148580.

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

MLA Handbook (7th Edition):

Andersson, Amanda. “Fast Real-Time MPC for Fighter Aircraft.” 2018. Web. 15 Nov 2019.

Vancouver:

Andersson A. Fast Real-Time MPC for Fighter Aircraft. [Internet] [Thesis]. Linköping University; 2018. [cited 2019 Nov 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148580.

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

Council of Science Editors:

Andersson A. Fast Real-Time MPC for Fighter Aircraft. [Thesis]. Linköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148580

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


University of Victoria

8. Zhou, Wenjie. Computing optimal designs for regression models via convex programming.

Degree: Department of Mathematics and Statistics, 2015, University of Victoria

 Optimal design problems aim at selecting design points optimally with respect to certain statistical criteria. The research of this thesis focuses on optimal design problems… (more)

Subjects/Keywords: A-optimality; approximate design; convex programming; CVX; D-optimality; E-optimality; interior point method; SeDuMi; semidefinite programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, W. (2015). Computing optimal designs for regression models via convex programming. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6555

Chicago Manual of Style (16th Edition):

Zhou, Wenjie. “Computing optimal designs for regression models via convex programming.” 2015. Masters Thesis, University of Victoria. Accessed November 15, 2019. http://hdl.handle.net/1828/6555.

MLA Handbook (7th Edition):

Zhou, Wenjie. “Computing optimal designs for regression models via convex programming.” 2015. Web. 15 Nov 2019.

Vancouver:

Zhou W. Computing optimal designs for regression models via convex programming. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1828/6555.

Council of Science Editors:

Zhou W. Computing optimal designs for regression models via convex programming. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6555


University of Illinois – Chicago

9. Maggioni, Marco. Sparse Convex Optimization on GPUs.

Degree: 2016, University of Illinois – Chicago

 Convex optimization is a fundamental mathematical framework used for general problem solving. The computational time taken to optimize problems formulated as Linear Programming, Integer Linear… (more)

Subjects/Keywords: SpMV; GPU; Interior Point Method; Convex Optimization; Linear Programming; Integer Linear Programming; Adaptive; Conjugate Gradient; Cholesky

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maggioni, M. (2016). Sparse Convex Optimization on GPUs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20173

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

Maggioni, Marco. “Sparse Convex Optimization on GPUs.” 2016. Thesis, University of Illinois – Chicago. Accessed November 15, 2019. http://hdl.handle.net/10027/20173.

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

MLA Handbook (7th Edition):

Maggioni, Marco. “Sparse Convex Optimization on GPUs.” 2016. Web. 15 Nov 2019.

Vancouver:

Maggioni M. Sparse Convex Optimization on GPUs. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/10027/20173.

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

Council of Science Editors:

Maggioni M. Sparse Convex Optimization on GPUs. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20173

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


KTH

10. Almgrund, Jonas. Alternative Methods for Operational Optimization of Hydro Power Plants.

Degree: Optimization and Systems Theory, 2019, KTH

The aim of this thesis is to optimize hydro power plants with data generated from observations and field tests at the plants. The output… (more)

Subjects/Keywords: Nonlinear Optimization; Interior-Point Method; Sequential Quadratic Programming; Penalty Methods; Hydro Power; Energy Optimization.; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Almgrund, J. (2019). Alternative Methods for Operational Optimization of Hydro Power Plants. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252552

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

Almgrund, Jonas. “Alternative Methods for Operational Optimization of Hydro Power Plants.” 2019. Thesis, KTH. Accessed November 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252552.

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

MLA Handbook (7th Edition):

Almgrund, Jonas. “Alternative Methods for Operational Optimization of Hydro Power Plants.” 2019. Web. 15 Nov 2019.

Vancouver:

Almgrund J. Alternative Methods for Operational Optimization of Hydro Power Plants. [Internet] [Thesis]. KTH; 2019. [cited 2019 Nov 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252552.

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

Council of Science Editors:

Almgrund J. Alternative Methods for Operational Optimization of Hydro Power Plants. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252552

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


University of Newcastle

11. Kardani, Omid. Efficient iterative sparse linear solvers for large-scale computational geomechanics.

Degree: PhD, 2015, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

It can be argued that a substantial part of engineering design problems can be formulated and solved using… (more)

Subjects/Keywords: computational geomechanics; sparse linear solvers; preconditioning; finite element limit analysis; conic optimisation; interior point method; graphic processing units

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kardani, O. (2015). Efficient iterative sparse linear solvers for large-scale computational geomechanics. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310569

Chicago Manual of Style (16th Edition):

Kardani, Omid. “Efficient iterative sparse linear solvers for large-scale computational geomechanics.” 2015. Doctoral Dissertation, University of Newcastle. Accessed November 15, 2019. http://hdl.handle.net/1959.13/1310569.

MLA Handbook (7th Edition):

Kardani, Omid. “Efficient iterative sparse linear solvers for large-scale computational geomechanics.” 2015. Web. 15 Nov 2019.

Vancouver:

Kardani O. Efficient iterative sparse linear solvers for large-scale computational geomechanics. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1959.13/1310569.

Council of Science Editors:

Kardani O. Efficient iterative sparse linear solvers for large-scale computational geomechanics. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310569


Kansas State University

12. Vitor, Fabio Torres. Two dimensional search algorithms for linear programming.

Degree: PhD, Department of Industrial & Manufacturing Systems Engineering, 2019, Kansas State University

 Linear programming is one of the most important classes of optimization problems. These mathematical models have been used by academics and practitioners to solve numerous… (more)

Subjects/Keywords: Linear programming; Two dimensional search algorithms; Two variable linear programs; Optimal basis; The double pivot simplex method; Interior point methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vitor, F. T. (2019). Two dimensional search algorithms for linear programming. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39723

Chicago Manual of Style (16th Edition):

Vitor, Fabio Torres. “Two dimensional search algorithms for linear programming.” 2019. Doctoral Dissertation, Kansas State University. Accessed November 15, 2019. http://hdl.handle.net/2097/39723.

MLA Handbook (7th Edition):

Vitor, Fabio Torres. “Two dimensional search algorithms for linear programming.” 2019. Web. 15 Nov 2019.

Vancouver:

Vitor FT. Two dimensional search algorithms for linear programming. [Internet] [Doctoral dissertation]. Kansas State University; 2019. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/2097/39723.

Council of Science Editors:

Vitor FT. Two dimensional search algorithms for linear programming. [Doctoral Dissertation]. Kansas State University; 2019. Available from: http://hdl.handle.net/2097/39723

13. Pereira, Aguinaldo Aparecido. O método da função Lagrangiana barreira modificada/penalidade.

Degree: Mestrado, Sistemas Elétricos de Potência, 2007, University of São Paulo

Neste trabalho propomos uma abordagem que utiliza o método de barreira modificada/penalidade para a resolução de problemas restritos gerais de otimização. Para isso, foram obtidos… (more)

Subjects/Keywords: Extrapolação quadrática; FPO; Interior point method; Método de barreira modificada; Método de Newton; Método de pontos interiores; Modified barrier method; Newton' method; OPF; Quadratic extrapolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, A. A. (2007). O método da função Lagrangiana barreira modificada/penalidade. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/18/18154/tde-14032008-155744/ ;

Chicago Manual of Style (16th Edition):

Pereira, Aguinaldo Aparecido. “O método da função Lagrangiana barreira modificada/penalidade.” 2007. Masters Thesis, University of São Paulo. Accessed November 15, 2019. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-14032008-155744/ ;.

MLA Handbook (7th Edition):

Pereira, Aguinaldo Aparecido. “O método da função Lagrangiana barreira modificada/penalidade.” 2007. Web. 15 Nov 2019.

Vancouver:

Pereira AA. O método da função Lagrangiana barreira modificada/penalidade. [Internet] [Masters thesis]. University of São Paulo; 2007. [cited 2019 Nov 15]. Available from: http://www.teses.usp.br/teses/disponiveis/18/18154/tde-14032008-155744/ ;.

Council of Science Editors:

Pereira AA. O método da função Lagrangiana barreira modificada/penalidade. [Masters Thesis]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/18/18154/tde-14032008-155744/ ;


University of Alberta

14. Hassanzadeh, Bardia. Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach.

Degree: PhD, Department of Chemical and Materials Engineering, 2015, University of Alberta

 Chemical and petrochemical plants typically integrate a number of geographically distributed operating units, which are physically linked through energy and material streams or inherently coupled… (more)

Subjects/Keywords: Interior-point Method; Nonlinear Model Predictive Control; Bi-level Optimization; Price Coordination; Successive Linearization; Distributed Model Predictive Control; Trust-region Algorithm; Method of Feasible Directions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hassanzadeh, B. (2015). Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/rn301422d

Chicago Manual of Style (16th Edition):

Hassanzadeh, Bardia. “Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach.” 2015. Doctoral Dissertation, University of Alberta. Accessed November 15, 2019. https://era.library.ualberta.ca/files/rn301422d.

MLA Handbook (7th Edition):

Hassanzadeh, Bardia. “Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach.” 2015. Web. 15 Nov 2019.

Vancouver:

Hassanzadeh B. Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach. [Internet] [Doctoral dissertation]. University of Alberta; 2015. [cited 2019 Nov 15]. Available from: https://era.library.ualberta.ca/files/rn301422d.

Council of Science Editors:

Hassanzadeh B. Price-Driven Coordination of Distributed Model Predictive Controllers: A Bi-Level Optimization Approach. [Doctoral Dissertation]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/rn301422d


Georgia Southern University

15. Petrenko, Iryna. Optimization Methods for Tabular Data Protection.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2017, Georgia Southern University

  In this thesis we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of… (more)

Subjects/Keywords: Statistical Disclosure Limitation; Controlled Tabular Adjustment; Conic Optimization Problem; Interior Point Method; Other Mathematics; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petrenko, I. (2017). Optimization Methods for Tabular Data Protection. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1630

Chicago Manual of Style (16th Edition):

Petrenko, Iryna. “Optimization Methods for Tabular Data Protection.” 2017. Masters Thesis, Georgia Southern University. Accessed November 15, 2019. https://digitalcommons.georgiasouthern.edu/etd/1630.

MLA Handbook (7th Edition):

Petrenko, Iryna. “Optimization Methods for Tabular Data Protection.” 2017. Web. 15 Nov 2019.

Vancouver:

Petrenko I. Optimization Methods for Tabular Data Protection. [Internet] [Masters thesis]. Georgia Southern University; 2017. [cited 2019 Nov 15]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1630.

Council of Science Editors:

Petrenko I. Optimization Methods for Tabular Data Protection. [Masters Thesis]. Georgia Southern University; 2017. Available from: https://digitalcommons.georgiasouthern.edu/etd/1630


Georgia Southern University

16. Brandies, Jason N. Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2009, Georgia Southern University

 In this thesis, we consider the Linear Complementarity Problem (LCP), which is a well-known mathematical problem with many practical applications. The objective of the LCP… (more)

Subjects/Keywords: ETD; Kernel function; Primal-dual; Interior-point method; Linear complementarity problem; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brandies, J. N. (2009). Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/680

Chicago Manual of Style (16th Edition):

Brandies, Jason N. “Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem.” 2009. Masters Thesis, Georgia Southern University. Accessed November 15, 2019. https://digitalcommons.georgiasouthern.edu/etd/680.

MLA Handbook (7th Edition):

Brandies, Jason N. “Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem.” 2009. Web. 15 Nov 2019.

Vancouver:

Brandies JN. Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem. [Internet] [Masters thesis]. Georgia Southern University; 2009. [cited 2019 Nov 15]. Available from: https://digitalcommons.georgiasouthern.edu/etd/680.

Council of Science Editors:

Brandies JN. Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem. [Masters Thesis]. Georgia Southern University; 2009. Available from: https://digitalcommons.georgiasouthern.edu/etd/680


Georgia Southern University

17. Kaluarachchi, H.K. Pubudu. Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2011, Georgia Southern University

  In this thesis, we present a new Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it… (more)

Subjects/Keywords: ETD; Linear complementarity problem; Interior-point method; Full Newton-step; Polynomial convergence; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaluarachchi, H. K. P. (2011). Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/669

Chicago Manual of Style (16th Edition):

Kaluarachchi, H K Pubudu. “Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems.” 2011. Masters Thesis, Georgia Southern University. Accessed November 15, 2019. https://digitalcommons.georgiasouthern.edu/etd/669.

MLA Handbook (7th Edition):

Kaluarachchi, H K Pubudu. “Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems.” 2011. Web. 15 Nov 2019.

Vancouver:

Kaluarachchi HKP. Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems. [Internet] [Masters thesis]. Georgia Southern University; 2011. [cited 2019 Nov 15]. Available from: https://digitalcommons.georgiasouthern.edu/etd/669.

Council of Science Editors:

Kaluarachchi HKP. Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems. [Masters Thesis]. Georgia Southern University; 2011. Available from: https://digitalcommons.georgiasouthern.edu/etd/669


Indian Institute of Science

18. Akhil, P T. Topics in Network Utility Maximization : Interior Point and Finite-step Methods.

Degree: 2017, Indian Institute of Science

 Network utility maximization has emerged as a powerful tool in studying flow control, resource allocation and other cross-layer optimization problems. In this work, we study… (more)

Subjects/Keywords: Network Utility Maximization; Interior-Point Method; Distributed Optimization; Linear Ascending Constraints; Differential Inclusions; NUM Algorithm; Network Utility Maximization Algorithm; Polymatroids; Decomposition Algorithm; Convex Programming; Network Models; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akhil, P. T. (2017). Topics in Network Utility Maximization : Interior Point and Finite-step Methods. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3268

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

Akhil, P T. “Topics in Network Utility Maximization : Interior Point and Finite-step Methods.” 2017. Thesis, Indian Institute of Science. Accessed November 15, 2019. http://hdl.handle.net/2005/3268.

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

MLA Handbook (7th Edition):

Akhil, P T. “Topics in Network Utility Maximization : Interior Point and Finite-step Methods.” 2017. Web. 15 Nov 2019.

Vancouver:

Akhil PT. Topics in Network Utility Maximization : Interior Point and Finite-step Methods. [Internet] [Thesis]. Indian Institute of Science; 2017. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/2005/3268.

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

Council of Science Editors:

Akhil PT. Topics in Network Utility Maximization : Interior Point and Finite-step Methods. [Thesis]. Indian Institute of Science; 2017. Available from: http://hdl.handle.net/2005/3268

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

19. LI LU. Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming.

Degree: 2010, National University of Singapore

Subjects/Keywords: Convex Optimization; Semidefinite Programming; Interior-Point Method; Inexact Search Direction; Covariance Selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LU, L. (2010). Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/22110

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

LU, LI. “Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming.” 2010. Thesis, National University of Singapore. Accessed November 15, 2019. http://scholarbank.nus.edu.sg/handle/10635/22110.

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

MLA Handbook (7th Edition):

LU, LI. “Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming.” 2010. Web. 15 Nov 2019.

Vancouver:

LU L. Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming. [Internet] [Thesis]. National University of Singapore; 2010. [cited 2019 Nov 15]. Available from: http://scholarbank.nus.edu.sg/handle/10635/22110.

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

Council of Science Editors:

LU L. Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming. [Thesis]. National University of Singapore; 2010. Available from: http://scholarbank.nus.edu.sg/handle/10635/22110

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

20. Yamakawa, Yuya. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究.

Degree: 博士(情報学), 2015, Kyoto University / 京都大学

新制・課程博士

甲第19122号

情博第568号

Subjects/Keywords: Optimization; Nonlinear semidefinite programming; Global convergence; Superlinear convergence; Primal-dual interior point method; Block coordinate descent method

Page 1 Page 2 Page 3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yamakawa, Y. (2015). Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/199446 ; http://dx.doi.org/10.14989/doctor.k19122

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

Yamakawa, Yuya. “Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究.” 2015. Thesis, Kyoto University / 京都大学. Accessed November 15, 2019. http://hdl.handle.net/2433/199446 ; http://dx.doi.org/10.14989/doctor.k19122.

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

MLA Handbook (7th Edition):

Yamakawa, Yuya. “Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究.” 2015. Web. 15 Nov 2019.

Vancouver:

Yamakawa Y. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究. [Internet] [Thesis]. Kyoto University / 京都大学; 2015. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/2433/199446 ; http://dx.doi.org/10.14989/doctor.k19122.

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

Council of Science Editors:

Yamakawa Y. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems : 非線形半正定値計画問題に対する最適化手法の研究. [Thesis]. Kyoto University / 京都大学; 2015. Available from: http://hdl.handle.net/2433/199446 ; http://dx.doi.org/10.14989/doctor.k19122

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


Kyoto University

21. Yamakawa, Yuya. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems .

Degree: 2015, Kyoto University

Subjects/Keywords: Optimization; Nonlinear semidefinite programming; Global convergence; Superlinear convergence; Primal-dual interior point method; Block coordinate descent method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yamakawa, Y. (2015). Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/199446

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

Yamakawa, Yuya. “Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems .” 2015. Thesis, Kyoto University. Accessed November 15, 2019. http://hdl.handle.net/2433/199446.

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

MLA Handbook (7th Edition):

Yamakawa, Yuya. “Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems .” 2015. Web. 15 Nov 2019.

Vancouver:

Yamakawa Y. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems . [Internet] [Thesis]. Kyoto University; 2015. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/2433/199446.

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

Council of Science Editors:

Yamakawa Y. Studies on Optimization Methods for Nonlinear Semidefinite Programming Problems . [Thesis]. Kyoto University; 2015. Available from: http://hdl.handle.net/2433/199446

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

22. Celestin, Kamta. Constructing an Index Fund Using Interior Point Primal- Dual Method.

Degree: Culture and Communication, 2011, Mälardalen University

  Optimization methods nowadays play a very important role in financial decisions such as portfolio managements, construction of index funds and pension funds.  This Master… (more)

Subjects/Keywords: Index fund; interior point method; primal dual method; linear programming model

…Constructing an Index Fund Using Interior Point Primal – Dual Method 13. Extreme points… …solution. 8 Constructing an Index Fund Using Interior Point Primal – Dual Method Introduction… …using the interior point method for linear programming. Delimitations The data used in this… …index. 12 Constructing an Index Fund Using Interior Point Primal – Dual Method Thesis… …solving LP problems. This chapter also describes the Primal-Dual interior point method in detail… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Celestin, K. (2011). Constructing an Index Fund Using Interior Point Primal- Dual Method. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13041

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

Celestin, Kamta. “Constructing an Index Fund Using Interior Point Primal- Dual Method.” 2011. Thesis, Mälardalen University. Accessed November 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13041.

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

MLA Handbook (7th Edition):

Celestin, Kamta. “Constructing an Index Fund Using Interior Point Primal- Dual Method.” 2011. Web. 15 Nov 2019.

Vancouver:

Celestin K. Constructing an Index Fund Using Interior Point Primal- Dual Method. [Internet] [Thesis]. Mälardalen University; 2011. [cited 2019 Nov 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13041.

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

Council of Science Editors:

Celestin K. Constructing an Index Fund Using Interior Point Primal- Dual Method. [Thesis]. Mälardalen University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13041

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


University of Waterloo

23. Dang, Jiarui. Empirical Analysis of Algorithms for Block-Angular Linear Programs.

Degree: 2007, University of Waterloo

 This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms… (more)

Subjects/Keywords: empirical analysis; block-angular; Dantzig-Wolfe decomposition; analytic center cutting plane method; interior point method; simplex

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dang, J. (2007). Empirical Analysis of Algorithms for Block-Angular Linear Programs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3189

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

Dang, Jiarui. “Empirical Analysis of Algorithms for Block-Angular Linear Programs.” 2007. Thesis, University of Waterloo. Accessed November 15, 2019. http://hdl.handle.net/10012/3189.

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

MLA Handbook (7th Edition):

Dang, Jiarui. “Empirical Analysis of Algorithms for Block-Angular Linear Programs.” 2007. Web. 15 Nov 2019.

Vancouver:

Dang J. Empirical Analysis of Algorithms for Block-Angular Linear Programs. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/10012/3189.

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

Council of Science Editors:

Dang J. Empirical Analysis of Algorithms for Block-Angular Linear Programs. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3189

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

24. Tran, Ngoc Nguyen. Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire.

Degree: Docteur es, Mathematiques, 2018, Limoges

Dans cette thèse, nous nous étudions des algorithmes d’optimisation non linéaire. D’une part nous proposons des techniques de détection rapide de la non-réalisabilité d’un problème… (more)

Subjects/Keywords: Optimisation nonlinéaire; Détection de la non-réalisabilité; Regularisation; Dégénéré; Méthode lagrangienne augmentée; Méthode de point intérieur; Méthodes primales-duales; Borne d’erreur locale; Convergence superlinéaire/quadratique; Nonlinear optimization; Infeasibility detection; Regularization; Degenerate; Augmented Lagrangian method; Interior point method; Primal-dual methods; Local error bound condition; Superlinear/quadratic convergence; 519.76

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tran, N. N. (2018). Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire. (Doctoral Dissertation). Limoges. Retrieved from http://www.theses.fr/2018LIMO0059

Chicago Manual of Style (16th Edition):

Tran, Ngoc Nguyen. “Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire.” 2018. Doctoral Dissertation, Limoges. Accessed November 15, 2019. http://www.theses.fr/2018LIMO0059.

MLA Handbook (7th Edition):

Tran, Ngoc Nguyen. “Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire.” 2018. Web. 15 Nov 2019.

Vancouver:

Tran NN. Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire. [Internet] [Doctoral dissertation]. Limoges; 2018. [cited 2019 Nov 15]. Available from: http://www.theses.fr/2018LIMO0059.

Council of Science Editors:

Tran NN. Infeasibility detection and regularization strategies in nonlinear optimization : Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire. [Doctoral Dissertation]. Limoges; 2018. Available from: http://www.theses.fr/2018LIMO0059


Brunel University

25. Guertler, Marion. Modelling and solution methods for portfolio optimisation.

Degree: PhD, 2004, Brunel University

 In this thesis modelling and solution methods for portfolio optimisation are presented. The investigations reported in this thesis extend the Markowitz mean-variance model to the… (more)

Subjects/Keywords: 519.77; Quadratic mixed integer programming (QIMP); Sparse simplex (SSX); Interior point method (IPM); Warmstart; Discrete efficient frontier (DEF)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guertler, M. (2004). Modelling and solution methods for portfolio optimisation. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/4855 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397882

Chicago Manual of Style (16th Edition):

Guertler, Marion. “Modelling and solution methods for portfolio optimisation.” 2004. Doctoral Dissertation, Brunel University. Accessed November 15, 2019. http://bura.brunel.ac.uk/handle/2438/4855 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397882.

MLA Handbook (7th Edition):

Guertler, Marion. “Modelling and solution methods for portfolio optimisation.” 2004. Web. 15 Nov 2019.

Vancouver:

Guertler M. Modelling and solution methods for portfolio optimisation. [Internet] [Doctoral dissertation]. Brunel University; 2004. [cited 2019 Nov 15]. Available from: http://bura.brunel.ac.uk/handle/2438/4855 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397882.

Council of Science Editors:

Guertler M. Modelling and solution methods for portfolio optimisation. [Doctoral Dissertation]. Brunel University; 2004. Available from: http://bura.brunel.ac.uk/handle/2438/4855 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397882


Texas A&M University

26. Sorek, Nadav. Reservoir Flooding Optimization by Control Polynomial Approximations.

Degree: PhD, Petroleum Engineering, 2017, Texas A&M University

 In this dissertation, we provide novel parametrization procedures for water-flooding production optimization problems, using polynomial approximation techniques. The methods project the original infinite dimensional controls… (more)

Subjects/Keywords: Optimization; Optimal Control; Polynomial Approximation; Waterflooding; Reservoir Simulation; Reduced Order Modeling; Control Parameterization; Chebyshev; Spline Interpolation; Particle Swarm Optimization; Interior Point; LBFGS; BFGS; Adjoint Method; Optimization Under Uncertainty; Conditional Value at Risk; Conditional Value at Success

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sorek, N. (2017). Reservoir Flooding Optimization by Control Polynomial Approximations. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/166003

Chicago Manual of Style (16th Edition):

Sorek, Nadav. “Reservoir Flooding Optimization by Control Polynomial Approximations.” 2017. Doctoral Dissertation, Texas A&M University. Accessed November 15, 2019. http://hdl.handle.net/1969.1/166003.

MLA Handbook (7th Edition):

Sorek, Nadav. “Reservoir Flooding Optimization by Control Polynomial Approximations.” 2017. Web. 15 Nov 2019.

Vancouver:

Sorek N. Reservoir Flooding Optimization by Control Polynomial Approximations. [Internet] [Doctoral dissertation]. Texas A&M University; 2017. [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1969.1/166003.

Council of Science Editors:

Sorek N. Reservoir Flooding Optimization by Control Polynomial Approximations. [Doctoral Dissertation]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/166003

27. Deklerck, M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.

Degree: 2016, Delft University of Technology

 Structural optimization, first introduced by Schmidt in 1960, is a rapid growing factor in the development of new aerospace structures. This growth is established by… (more)

Subjects/Keywords: structural optimization; stiffened panel; interior point method; conservative approximation; sequential convex programming

…Predictor-Corrector interior point method . . . . . . . . . . . . . . . . . 42 4.2.4 Convergence… …problems[5]. Therefore Mehrotra’s predictor-corrector interior point method is used in… …elements of the interior point method; And E. Ferede for his support on the coupling between… …software with an interior point method coded in MATLAB. The FE software and optimization method… …selected are NASTRAN and Mehrotra’s predictor corrector interior point method as described by… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deklerck, M. (2016). Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1

Chicago Manual of Style (16th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Masters Thesis, Delft University of Technology. Accessed November 15, 2019. http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

MLA Handbook (7th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Web. 15 Nov 2019.

Vancouver:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2019 Nov 15]. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

Council of Science Editors:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1


Queens University

28. Li, Daozhong. Multi-material topology optimization for lightweight design .

Degree: Mechanical and Materials Engineering, Queens University

 Multi-material topology optimization remains an active research topic. This work enriches the key techniques of multi-material topology optimization, such as the multi-material property determination, topology… (more)

Subjects/Keywords: Topology optimization; Multi-material; SIMP; SAMP; Lightweight design; Weight minimization; Stress constraints; Primal-dual interior-point method; Scaling mechanism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, D. (n.d.). Multi-material topology optimization for lightweight design . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/24963

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Li, Daozhong. “Multi-material topology optimization for lightweight design .” Thesis, Queens University. Accessed November 15, 2019. http://hdl.handle.net/1974/24963.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Li, Daozhong. “Multi-material topology optimization for lightweight design .” Web. 15 Nov 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Li D. Multi-material topology optimization for lightweight design . [Internet] [Thesis]. Queens University; [cited 2019 Nov 15]. Available from: http://hdl.handle.net/1974/24963.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Li D. Multi-material topology optimization for lightweight design . [Thesis]. Queens University; Available from: http://hdl.handle.net/1974/24963

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Delft University of Technology

29. El Ghami, M. New Primal-dual Interior-point Methods Based on Kernel Functions.

Degree: 2005, Delft University of Technology

 Two important classes of polynomial-time interior-point method (IPMs) are small- and large-update methods, respectively. The theoretical complexity bound for large-update methods is a factor √{n}… (more)

Subjects/Keywords: linear optimization; semidefinite optimization; primal-dual interior-point algorithm; large- and small-update method; kernel functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El Ghami, M. (2005). New Primal-dual Interior-point Methods Based on Kernel Functions. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272

Chicago Manual of Style (16th Edition):

El Ghami, M. “New Primal-dual Interior-point Methods Based on Kernel Functions.” 2005. Doctoral Dissertation, Delft University of Technology. Accessed November 15, 2019. http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272.

MLA Handbook (7th Edition):

El Ghami, M. “New Primal-dual Interior-point Methods Based on Kernel Functions.” 2005. Web. 15 Nov 2019.

Vancouver:

El Ghami M. New Primal-dual Interior-point Methods Based on Kernel Functions. [Internet] [Doctoral dissertation]. Delft University of Technology; 2005. [cited 2019 Nov 15]. Available from: http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272.

Council of Science Editors:

El Ghami M. New Primal-dual Interior-point Methods Based on Kernel Functions. [Doctoral Dissertation]. Delft University of Technology; 2005. Available from: http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; urn:NBN:nl:ui:24-uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272 ; http://resolver.tudelft.nl/uuid:0fa98a15-e579-4542-8c9f-cfecf3b64272

30. Mariano, Cristiane Regina. Estudo e análise do desempenho do método barreira modificada.

Degree: Mestrado, Sistemas Elétricos de Potência, 2006, University of São Paulo

Este trabalho tem por objetivo estudar e analisar a influência do parâmetro de barreira e de seu fator de correção no processo de convergência dos… (more)

Subjects/Keywords: Composed Newton method; Interior point method; Método de barreira modificada; Método de Newton; Método de pontos interiores; Método Newton composto; Método preditor-corretor; Modified barrier method; Newton’s method; Nonlinear programming; Predictor-corrector method; Programação não-linear

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mariano, C. R. (2006). Estudo e análise do desempenho do método barreira modificada. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/18/18154/tde-15022007-163305/ ;

Chicago Manual of Style (16th Edition):

Mariano, Cristiane Regina. “Estudo e análise do desempenho do método barreira modificada.” 2006. Masters Thesis, University of São Paulo. Accessed November 15, 2019. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-15022007-163305/ ;.

MLA Handbook (7th Edition):

Mariano, Cristiane Regina. “Estudo e análise do desempenho do método barreira modificada.” 2006. Web. 15 Nov 2019.

Vancouver:

Mariano CR. Estudo e análise do desempenho do método barreira modificada. [Internet] [Masters thesis]. University of São Paulo; 2006. [cited 2019 Nov 15]. Available from: http://www.teses.usp.br/teses/disponiveis/18/18154/tde-15022007-163305/ ;.

Council of Science Editors:

Mariano CR. Estudo e análise do desempenho do método barreira modificada. [Masters Thesis]. University of São Paulo; 2006. Available from: http://www.teses.usp.br/teses/disponiveis/18/18154/tde-15022007-163305/ ;

[1] [2]

.