Relevant bibliographies by topics / Newton algorithms

Contents

  1. Dissertations / Theses

Academic literature on the topic 'Newton algorithms'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Newton algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Dissertations / Theses on the topic "Newton algorithms"

1

Wei, Ermin. "Distributed Newton-type algorithms for network resource allocation." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/60822.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 99-101).<br>Most of today's communication networks are large-scale and comprise of agents with local information and heterogeneous preferences, making centralized control and coordination impractical. This motivated much interest in developing and studying distributed algorithms for network resource allocation problems, such as Internet routing, data collection and processing in sensor networks, and
APA, Harvard, Vancouver, ISO, and other styles
2

Saadallah, A. F. "A new approach to quasi-Newton methods for minimization." Thesis, University of Essex, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Klemes, Marek Carleton University Dissertation Engineering Electronics. "Fast robust Quasi-Newton adaptive algorithms for general array processing." Ottawa, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ghandhari, R. A. "On the use of function values to improve quasi-Newton methods." Thesis, University of Essex, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Harrison, Anthony Westbrook. "Algorithms for Computing the Lattice Size." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1529781033957183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sassi, Carlos Alberto. "Sobre o desempenho de métodos Quase-Newton e aplicações." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306041.

Full text
Abstract:
Orientador: Maria Aparecida Diniz Ehrhardt<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-16T22:41:08Z (GMT). No. of bitstreams: 1 Sassi_Carlos_M.pdf: 2431422 bytes, checksum: 7e2d7456777a9a43cc62a5524d3fca93 (MD5) Previous issue date: 2010<br>Resumo: Iniciamos este trabalho com o estudo de equações não lineares, transcendentais de uma única variável, com o objetivo principal de abordar sistemas de equações não lineares, analisar os métodos, algoritmos e realizar t
APA, Harvard, Vancouver, ISO, and other styles
7

Gaujoux, Renaud Gilles. "Resolução de sistema KKT por metodo de tipo Newton não diferenciavel." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306442.

Full text
Abstract:
Orientador: Roberto Andreani<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-04T05:03:19Z (GMT). No. of bitstreams: 1 Gaujoux_RenaudGilles_M.pdf: 1743739 bytes, checksum: a3548a59bc983f4398cb0136c62c1d6a (MD5) Previous issue date: 2005<br>Resumo: Esta dissertação trata da aplicação de um método de tipo Newton generalizado aos sistemas KKT. Graças às funções chamadas de NCP, o sistema KKT pode ser reformulado como uma equação do tipo H(z) = O, onde H é uma função semi-suave. Nos
APA, Harvard, Vancouver, ISO, and other styles
8

Woodgate, K. G. "Optimization over positive semi-definite symmetric matrices with application to Quasi-Newton algorithms." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/46914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zanjácomo, Paulo Régis. "On weighted paths for nonlinear semidefinite complementarity problems and newton methods for semidefinite programming." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/21680.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hüeber, Stefan. "Discretization techniques and efficient algorithms for contact problems." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-36087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Newton algorithms' for particular source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography