Готові списки джерел за темами / Discrete descent

Добірка наукової літератури з теми "Discrete descent"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Discrete descent".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Discrete descent"

Sobral, Manuela. "Descent for Discrete (Co)fibrations." Applied Categorical Structures 12, no. 5/6 (October 2004): 527–35. http://dx.doi.org/10.1023/b:apcs.0000049316.87223.a4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

CASTRO, CARLOS, FRANCISCO PALACIOS, and ENRIQUE ZUAZUA. "AN ALTERNATING DESCENT METHOD FOR THE OPTIMAL CONTROL OF THE INVISCID BURGERS EQUATION IN THE PRESENCE OF SHOCKS." Mathematical Models and Methods in Applied Sciences 18, no. 03 (March 2008): 369–416. http://dx.doi.org/10.1142/s0218202508002723.

Повний текст джерела

Анотація:

We introduce a new optimization strategy to compute numerical approximations of minimizers for optimal control problems governed by scalar conservation laws in the presence of shocks. We focus on the 1 - d inviscid Burgers equation. We first prove the existence of minimizers and, by a Γ-convergence argument, the convergence of discrete minima obtained by means of numerical approximation schemes satisfying the so-called one-sided Lipschitz condition (OSLC). Then we address the problem of developing efficient descent algorithms. We first consider and compare the existing two possible approaches: the so-called discrete approach, based on a direct computation of gradients in the discrete problem and the so-called continuous one, where the discrete descent direction is obtained as a discrete copy of the continuous one. When optimal solutions have shock discontinuities, both approaches produce highly oscillating minimizing sequences and the effective descent rate is very weak. As a solution we propose a new method, that we shall call alternating descent method, that uses the recent developments of generalized tangent vectors and the linearization around discontinuous solutions. This method distinguishes and alternates the descent directions that move the shock and those that perturb the profile of the solution away of it producing very efficient and fast descent algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Carlson, David, Ya-Ping Hsieh, Edo Collins, Lawrence Carin, and Volkan Cevher. "Stochastic Spectral Descent for Discrete Graphical Models." IEEE Journal of Selected Topics in Signal Processing 10, no. 2 (March 2016): 296–311. http://dx.doi.org/10.1109/jstsp.2015.2505684.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Diaz-Lopez, Alexander, Pamela E. Harris, Erik Insko, Mohamed Omar, and Bruce E. Sagan. "Descent polynomials." Discrete Mathematics 342, no. 6 (June 2019): 1674–86. http://dx.doi.org/10.1016/j.disc.2019.01.034.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

DAIDZIC, Nihad E. "An algebraic model of high-altitude aircraft decompression and emergency descent." Aviation 21, no. 3 (August 3, 2018): 92–101. http://dx.doi.org/10.3846/16487788.2017.1380081.

Повний текст джерела

Анотація:

An emergency descent maneuver initiated by pilots shortly after the onset of the decompression recognition was developed for subsonic, supersonic and hypersonic cruisers. Among other findings, the times when a passenger cabin is exposed to altitudes above 25,000 and 40,000 ft and the maximum cabin altitude reached are estimated. An airplane descent aerodynamic model was incorporated for high-speed and low-speed high-drag emergency descents. Airplane cabin atmosphere is assumed to be isothermal. The environmental atmosphere is simulated using the NLPAM nonlinear atmospheric model valid up to 47 geopotential kilometers. Rapid and slow decompressions at several discrete cruising altitudes ranging from 12 to 40 km and varying pilot reaction times in initiating the emergency descent were simulated. The main motivation for this work was to estimate times and altitudes a cabin reaches during depressurization for various flight conditions. This model can be utilized in optimizing the emergency-descent piloting techniques, calculating oxygen supplies, evaluating aeromedical factors, estimating harmful exposures to low pressures, and for other important high-altitude aircraft operations.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ehrenborg, Richard, and Swapneel Mahajan. "Maximizing the descent statistic." Annals of Combinatorics 2, no. 2 (June 1998): 111–29. http://dx.doi.org/10.1007/bf01608482.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mahavier, W. T. "A convergence result for discreet steepest decent in weighted sobolev spaces." Abstract and Applied Analysis 2, no. 1-2 (1997): 67–72. http://dx.doi.org/10.1155/s1085337597000274.

Повний текст джерела

Анотація:

A convergence result is given for discrete descent based on Sobolev gradients arising from differential equations which may be expressed as quadratic forms. The argument is an extension of the result of David G. Luenberger on Euclidean descent and compliments the work of John W. Neuberger on Sobolev descent.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ng, Chi-Kong, Duan Li, and Lian-Sheng Zhang. "Discrete global descent method for discrete global optimization and nonlinear integer programming." Journal of Global Optimization 37, no. 3 (August 17, 2006): 357–79. http://dx.doi.org/10.1007/s10898-006-9053-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Murota, Kazuo. "On Steepest Descent Algorithms for Discrete Convex Functions." SIAM Journal on Optimization 14, no. 3 (January 2004): 699–707. http://dx.doi.org/10.1137/s1052623402419005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Yong-jian, and Lian-sheng Zhang. "A gradually descent method for discrete global optimization." Journal of Shanghai University (English Edition) 11, no. 1 (February 2007): 39–44. http://dx.doi.org/10.1007/s11741-007-0106-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Discrete descent"

Olsen, McCabe J. "HILBERT BASES, DESCENT STATISTICS, AND COMBINATORIAL SEMIGROUP ALGEBRAS." UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/52.

Повний текст джерела

Анотація:

The broad topic of this dissertation is the study of algebraic structure arising from polyhedral geometric objects. There are three distinct topics covered over three main chapters. However, each of these topics are further linked by a connection to the Eulerian polynomials. Chapter 2 studies Euler-Mahonian identities arising from both the symmetric group and generalized permutation groups. Specifically, we study the algebraic structure of unit cube semigroup algebra using Gröbner basis methods to acquire these identities. Moreover, this serves as a bridge between previous methods involving polyhedral geometry and triangulations with descent bases methods arising in representation theory. In Chapter 3, the aim is to characterize Hilbert basis elements of certain 𝒔-lecture hall cones. In particular, the main focus is the classification of the Hilbert bases for the 1 mod 𝑘 cones and the 𝓁-sequence cones, both of which generalize a previous known result. Additionally, there is much broader characterization of Hilbert bases in dimension ≤ 4 for 𝒖-generated Gorenstein lecture hall cones. Finally, Chapter 4 focuses on certain algebraic and geometric properties of 𝒔-lecture hall polytopes. This consists of partial classification results for the Gorenstein property, the integer-decomposition property, and the existence of regular, unimodular triangulations.

Стилі APA, Harvard, Vancouver, ISO та ін.

Happ, Alexander Thomas. "A Combinatorial Miscellany: Antipodes, Parking Cars, and Descent Set Powers." UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/53.

Повний текст джерела

Анотація:

In this dissertation we first introduce an extension of the notion of parking functions to cars of different sizes. We prove a product formula for the number of such sequences and provide a refinement using a multi-parameter extension of the Abel--Rothe polynomial. Next, we study the incidence Hopf algebra on the noncrossing partition lattice. We demonstrate a bijection between the terms in the canceled chain decomposition of its antipode and noncrossing hypertrees. Thirdly, we analyze the sum of the 𝑟th powers of the descent set statistic on permutations and how many small prime factors occur in these numbers. These results depend upon the base 𝑝 expansion of both the dimension and the power of these statistics. Finally, we inspect the ƒ-vector of the descent polytope DPv, proving a maximization result using an analogue of the boustrophedon transform.

Стилі APA, Harvard, Vancouver, ISO та ін.

Boberg, Jonas. "Counting Double-Descents and Double-Inversions in Permutations." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-54431.

Повний текст джерела

Анотація:

In this paper, new variations of some well-known permutation statistics are introduced and studied. Firstly, a double-descent of a permutation π is defined as a position i where πi ≥ 2πi+1. By proofs by induction and direct proofs, recursive and explicit expressions for the number of n-permutations with k double-descents are presented. Also, an expression for the total number of double-descents in all n-permutations is presented. Secondly, a double-inversion of a permutation π is defined as a pair (πi,πj) where i<j but πi ≥ 2πj. The total number of double-inversions in all n-permutations is presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

Djaneye-Boundjou, Ouboti Seydou Eyanaa. "Discrete-time Concurrent Learning for System Identification and Applications: Leveraging Memory Usage for Good Learning." University of Dayton / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=dayton151298579862899.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Coelho, Francisco Carlos Rodrigues. "Alocação de geração distribuída em sistemas de distribuição de energia elétrica via metaheurística empírica discreta." Universidade Federal de Juiz de Fora (UFJF), 2018. https://repositorio.ufjf.br/jspui/handle/ufjf/6506.

Повний текст джерела

Анотація:

Submitted by Geandra Rodrigues (geandrar@gmail.com) on 2018-03-27T14:05:45Z No. of bitstreams: 1 franciscocarlosrodriguescoelho.pdf: 4772391 bytes, checksum: e11633134429c05832808dad96be9940 (MD5)
Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-03-27T14:28:31Z (GMT) No. of bitstreams: 1 franciscocarlosrodriguescoelho.pdf: 4772391 bytes, checksum: e11633134429c05832808dad96be9940 (MD5)
Made available in DSpace on 2018-03-27T14:28:31Z (GMT). No. of bitstreams: 1 franciscocarlosrodriguescoelho.pdf: 4772391 bytes, checksum: e11633134429c05832808dad96be9940 (MD5) Previous issue date: 2018-02-22
A alocação de Geração Distribuída (GD) em sistemas de distribuição de energia elétrica consiste em determinar os barramentos para conexão destas unidades geradoras, e o montante de potência a ser injetado, visando um ou mais objetivos, que podem ser: redução das perdas de potência ativa, melhorias no perfil de tensão, minimização dos custos operacionais, maximização da geração de energia, ganhos ambientais, dentre outros. O principal objetivo considerado neste trabalho é a minimização das perdas de potência ativa, mantendo as tensões dos barramentos dentro de limites recomendados. Para alcançar este objetivo, uma metodologia de otimização é proposta, tratando separadamente os problemas de localização das unidades geradoras no sistema, e o dimensionamento destas unidades. A determinação das barras com conexão de GD é realizada através de uma nova técnica de otimização metaheurística, implementada no MATLAB, denominada Metaheurística Empírica Discreta (MED). Já o dimensionamento das unidades de GD é realizado de duas formas distintas, a depender do tipo de sistema de distribuição analisado. No caso dos sistemas cujos dados são equivalentes monofásicos, o montante de potencia é determinado por um Fluxo de Potência Ótimo implementado no software comercial LINGO. A segunda estratégia de determinação da potência despachada é empregada no caso dos testes realizados com sistemas trifásicos desbalanceados, cujo dimensionamento é feito pelo método do gradiente descendente e o cálculo do fluxo de potência é realizado pelo software OpenDSS. Os três sistemas equivalentes monofásicos utilizados são compostos por 33, 69 e 476 barras, enquanto os dois trifásicos desequilibrados possuem 34 e 123 barras. A qualidade da metodologia proposta na resolução do problema de alocação de geração distribuída é avaliada através de comparações com a literatura especializada, comparações com outras metaheurísticas e testes de robustez. Os resultados provenientes de simulações com alocação de três e quatro unidades de GD em sistemas de distribuição de energia elétrica mostram que a metodologia proposta é eficiente, sendo capaz de produzir resultados com significativas reduções nas perdas de potência ativa e perfis de tensão adequados.
The optimal Distributed Generation (DG) allocation problem consists in choosing the best locations of those distributed power plants at the distribution system, and to define its amount of power injection. The approach can be either single or multiobjective. The main objectives are: minimization of total power loss, voltage profile improvement, operational cost minimization, maximization of distributed generation capacity, environmental gains, among others. In this work, the main goal pursued is the total power loss minimization of the distribution system, keeping the buses voltages within the predetermined limits. To achieve this goal, an optimization methodology is proposed. This approach treats separately the location problem and the power dispatched by the generation units. The busbars connected to distributed generation are determined through a new metaheuristic algorithm, implemented in MATLAB, named Empirical Discrete Metaheuristic (EDM). The amount of power injection is solved by an Optimum Power Flow implemented in the commercial software LINGO, or by the Steepest Descent Method in the MATLAB environment. The first strategy to determine the DG dispatch is used on simulations with single phase equivalents systems. The second one is employed in the amount of power determination in unbalanced three phase systems, which the power flow is carried out by the open source software OpenDSS. The three single phase equivalent test systems analyzed are composed by 33, 69 and 476 buses, while the two systems with three phases have 34 and 123 buses, each. To evaluate the proposed methodology quality, comparisons to published works in the specialized literature are made. Also, robustness tests and comparisons to other well succeed metaheuristics are carried out. The results were obtained from simulations with three and four DG units in electric power distribution systems. These results consistently show that the proposed methodology is efficient, providing DGs configurations that significantly reduces the active power losses and keep the voltages at adequate levels.

Стилі APA, Harvard, Vancouver, ISO та ін.

Коваленко, Владислав Вячеславович. "Дослідження режимів мереж 35/10кВ операторів системи розподілу електроенергії". Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/39563.

Повний текст джерела

Анотація:

В бакалаврській роботі на тему «Дослідження режимів мереж 35/10кВ операторів системи розподілу електроенергії » виділяються дві частини: перша – розрахункова (розділ1), де реалізуються загальні електроенергетичні задачі розрахунку та оптимізації режимів і визначення струмів короткого замикання для достатньо складних електричних мереж та друга – дослідницька (розділ 2), що присвячена аналізу режимів схем 35/10кВ Одесаобленерго. Об`єктом дослідження є індивідуальна підстанція 110/35/10кВ, постачальна та розподільчі мережі 10/35кВ, та характерні проблемно-оріентовані експерементальні або промисловні моделі. Предметом дослідження є невідомі режимні характеристики (напруги, втрати, регулюючі значення реактивної потужності, струми К.З. та інше), а також моделі матриць провідності і опору, методи рішення нелінійних електроенергетичних рівнянь та інше. Мета роботи – підтвердити рівень інженерної кваліфікації бакалаврської роботи та згідно індивідуального завдання, виконати розробку розрахункової схеми Одесаобленерго і визначення головних характеристик (напруги, втрати потужності, споживання електроенергії) для режимних днів літнього та зимового максимуму. Бакалаврська робота містить 67 сторінок, 29 рисунків, 7 таблиць, 4 креслення та 11 літературних посилань. Для реалізації завдання задіяно учбовий комп`ютерний комплекс L_APEZ, промислові електроенергентичні комплекси РАОТВ, Z_REGIM, OPTIM.QT. В процесі реалізації задач розроблені індивідуальні розрахункові схеми.
In the bachelor's thesis on "Study of 35 / 10kV network modes of electricity distribution system operators" there are two parts: the first - calculation (section 1), which implements the general power problems of calculation and optimization of modes and short circuit currents for sufficiently complex electrical networks and the second - research (section 2), which is devoted to the analysis of the regimes of 35 / 10kV schemes of Odesaoblenergo. The object of studythere is an individual 110/35/10 kV substation, 110/35 kV supply and distribution networks, and typical problem-oriented experimental or industrial models. The subject of research there are unknown mode characteristics (voltages, losses, regulating values of reactive power, currents KZ, etc.), and also models of matrices of conductivity and resistance, methods of the decision of nonlinear electric equations and other. The goal of the work - to confirm the level of engineering qualification of the bachelor's degree and according to the individual task, to develop the calculation scheme of Odesaoblenergo and determine the main characteristics (voltage, power loss, electricity consumption) for the regime days of summer and winter maximum. The bachelor's thesis contains 67 pages, 29 drawings, 7 tables, 4 illustrations and 11 literary references. To implement the task, the educational computer complex L_APEZ, industrial power complexes RAOTV, Z_REGIM, OPTIM.QT are involved. In the process of realization of tasks individual calculation schemes are developed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Palomares, Roberto P. "Optical flow: related problems." Doctoral thesis, Universitat Pompeu Fabra, 2017. http://hdl.handle.net/10803/403061.

Повний текст джерела

Анотація:

Motion estimation plays a key role in many of the image processing and computer vision problems. This thesis addresses the problem of recovering a dense motion field from a scene through the Calculus of Variations. In particular, we make contributions to the problems of optical flow and scene flow estimation, as well as an application where its importance is shown. The optical flow aims to estimate the apparent motion caused by the relative movement between the observer and the scene. In the first part of the manuscript we present a new regularization term for optical flow energy functionals capable of recovering the rotations of the objects while keeping a similar behavior to the Total Variation in the rest of the movements. Then, we describe a model for binary video inpainting where the previous method is fundamental to complete the areas where the flow is unknown and to estimate the trajectories of visible objects. In the second part, we present a new minimization strategy for optical flow variational methods which is able to capture large displacements regardless of the chosen energy functional. This strategy is a two-step optimization process. It obtains a dense flow from a discrete set of correspondences which is subsequently refined in the second step. The experiments validate the contribution as a better alternative to the the multi-scale strategy since it outperforms the optical flow results for the same energy functional. The last part of this document focuses on the scene flow problem. It is defined as the estimation of the dense three-dimensional motion field of a nonrigid 3D scene. We extend the previous minimization strategy for optical flow to the scene flow context and present a decoupled energy model based on the work of Wedel et al. (2011). We present a variational model that jointly estimates the scene flow and the motion occlusions using the fact that occluded objects in the left view may be visible in the right view.
La estimación del movimiento es una de las piezas clave para muchos de los problemas de procesamiento de imagen y visión artificial. Esta tesis aborda el problema de la estimación de campos de movimiento densos de una escena a través del Cálculo de Variaciones. En particular, realizamos contribuciones a los problemas de optical flow (flujo óptico) y scene flow (flujo de escena), as\'i como una aplicación donde se demuestra su importancia. El flujo óptico tiene como objetivo estimar el movimiento aparente causado por el movimiento relativo entre el observador y la escena. En la primera parte del manuscrito presentamos un nuevo regularizador para flujo óptico capaz de recuperar las rotaciones de los objetos manteniendo un comportamiento similar a la Variación Total en el resto de movimientos. A continuación describimos un modelo de `binary video inpainting' donde el método previo juega un papel fundamental completando las zonas ocluidas en las que el flujo es desconocido y estimando las trayectorias de los objetos visibles. En la segunda parte, presentamos una nueva estrategia de minimización para flujo óptico capaz de capturar largos desplazamientos independientemente del funcional de energía escogido. Dicha estrategia es un proceso de optimización en dos fases que a partir de un conjunto discreto de correspondencias obtiene un flujo denso posteriormente refinado en la segunda fase. Los experimentos realizados validan la contribución presentada ya que los flujos ópticos son siempre más precisos que los obtenidos con el esquema multi-escala al minimizar el mismo funcional de energía. La última parte de este documento se centra en el problema de scene flow, definido como el campo de movimiento 3D de una escena. En dicho aporte extendemos la estrategia de minimización previa para flujo óptico al contexto de secene flow. Además presentamos un modelo de energía desacoplado, basado en el propuesto por Wedel et al. (2011), que aprovecha las distintas vistas de la escena para describir explícitamente las oclusiones- obteniendo una mayor precisi\'on en las discontinuidades del campo de movimiento.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Discrete descent"

Marti, Kurt. Computation of descent directions and stationary (efficient) points in stochastic optimization problems having discrete distributions. Neubiberg: Universität der Bundeswehr München, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Descent directions and efficient solutions in discretely distributed stochastic programs. Berlin: Springer-Verlag, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marti, Kurt. Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-662-02558-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abbes, Ahmed, Michel Gros, and Takeshi Tsuji. Almost étale coverings. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691170282.003.0005.

Повний текст джерела

Анотація:

This chapter explains Faltings' theory of almost étale extensions, a tool that has become essential in many questions in arithmetic geometry, even beyond p-adic Hodge theory. It begins with a brief historical overview of almost étale extensions, noting how Faltings developed the “almost purity theorem” and proved the Hodge–Tate decomposition of the étale cohomology of a proper smooth variety. The chapter proceeds by discussing almost isomorphisms, almost finitely generated projective modules, trace, rank and determinant, almost flat modules and almost faithfully flat modules, almost étale coverings, almost faithfully flat descent, and liftings. Finally, it describes group cohomology of discrete A–G-modules and Galois cohomology.

Стилі APA, Harvard, Vancouver, ISO та ін.

Chancy, Myriam J. A. Autochthonomies. University of Illinois Press, 2020. http://dx.doi.org/10.5622/illinois/9780252043048.001.0001.

Повний текст джерела

Анотація:

Autochthonomies is an intellectual project that engages readers in an interpretive journey: it engages and describes a process by which readers of texts created by artists and actors of African descent might engage such texts as legible within the context of African Diasporic historical and cultural discursive practices. It argues that there is a cultural and philosophical gain to understanding these texts not as products of, or responses only to, Western hegemonic dynamics or simply as products of discrete ethnic or national identities. By invoking a transnational African/Diasporic interpretive lens, negotiated through a virtual “lakou” or yard space in which such identities are transfigured, recognized, and exchanged, the study demonstrates how to best examine the salient features of the texts that underscore African/Diasporic sensibilities and renders them legible, thus offering a potential not only for richer readings of African Diasporic texts but also the possibility of rupturing the Manichean binary dynamics through which such texts have commonly been read. This produces an enriching interpretive capacity emphasizing the transnationalism of connections between subjects of African descent as the central pole for undertaking such investigations. Through the use of the neologism, autochthonomy, the study argues further that, despite colonial interruptions, critics of such works should seek to situate them as part of an intricate network of cultural and transnational exchanges.

Стилі APA, Harvard, Vancouver, ISO та ін.

Michel, Bierlaire. Optimization: Principles and Algorithms. EPFL Press, 2015. http://dx.doi.org/10.55430/6116v1mb.

Повний текст джерела

Анотація:

Every engineer and decision scientist must have a good mastery of optimization, an essential element in their toolkit. Thus, this articulate introductory textbook will certainly be welcomed by students and practicing professionals alike. Drawing from his vast teaching experience, the author skillfully leads the reader through a rich choice of topics in a coherent, fluid and tasteful blend of models and methods anchored on the underlying mathematical notions (only prerequisites: first year calculus and linear algebra). Topics range from the classics to some of the most recent developments in smooth unconstrained and constrained optimization, like descent methods, conjugate gradients, Newton and quasi-Newton methods, linear programming and the simplex method, trust region and interior point methods. Furthermore elements of discrete and combinatorial optimization like network optimization, integer programming and heuristic local search methods are also presented. This book presents optimization as a modeling tool that beyond supporting problem formulation plus design and implementation of efficient algorithms, also is a language suited for interdisciplinary human interaction. Readers further become aware that while the roots of mathematical optimization go back to the work of giants like Newton, Lagrange, Cauchy, Euler or Gauss, it did not become a discipline on its own until World War Two. Also that its present momentum really resulted from its symbiosis with modern computers, which made it possible to routinely solve problems with millions of variables and constraints. With his witty, entertaining, yet precise style, Michel Bierlaire captivates his readers and awakens their desire to try out the presented material in a creative mode. One of the outstanding assets of this book is the unified, clear and concise rendering of the various algorithms, which makes them easily readable and translatable into any high level programming language. ''This is an addictive book that I am very pleased to recommend.'' Prof. Thomas M. Liebling

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Discrete descent"

Brimberg, Jack, Nenad Mladenović, Raca Todosijević, and Dragan Urošević. "Variable Neighborhood Descent for the Capacitated Clustering Problem." In Discrete Optimization and Operations Research, 336–49. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44914-2_27.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Afric, Petar, Adrian Satja Kurdija, Lucija Sikic, Marin Silic, Goran Delac, Klemo Vladimir, and Sinisa Srbljic. "Population-Based Variable Neighborhood Descent for Discrete Optimization." In Artificial Intelligence and Mobile Services – AIMS 2019, 1–12. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23367-9_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bubeck, Sébastien, Michael B. Cohen, James R. Lee, and Yin Tat Lee. "Metrical task systems on trees via mirror descent and unfair gluing." In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 89–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2019. http://dx.doi.org/10.1137/1.9781611975482.6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cruttwell, Geoffrey S. H., Bruno Gavranović, Neil Ghani, Paul Wilson, and Fabio Zanasi. "Categorical Foundations of Gradient-Based Learning." In Programming Languages and Systems, 1–28. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99336-8_1.

Повний текст джерела

Анотація:

AbstractWe propose a categorical semantics of gradient-based machine learning algorithms in terms of lenses, parametric maps, and reverse derivative categories. This foundation provides a powerful explanatory and unifying framework: it encompasses a variety of gradient descent algorithms such as ADAM, AdaGrad, and Nesterov momentum, as well as a variety of loss functions such as MSE and Softmax cross-entropy, shedding new light on their similarities and differences. Our approach to gradient-based learning has examples generalising beyond the familiar continuous domains (modelled in categories of smooth maps) and can be realized in the discrete setting of boolean circuits. Finally, we demonstrate the practical significance of our framework with an implementation in Python.

Стилі APA, Harvard, Vancouver, ISO та ін.

Shantz, Michael, and Edlyn Teske. "Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study." In Lecture Notes in Computer Science, 94–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-42001-6_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frey, Gerhard, and Tanja Lange. "Background on Weil Descent." In Discrete Mathematics and Its Applications, 125–32. Chapman and Hall/CRC, 2005. http://dx.doi.org/10.1201/9781420034981.ch7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pallot, Judith, and Tat'yana Nefedova. "Ethno-cultural Differentiation in Household Production." In Russia's Unknown Agriculture. Oxford University Press, 2007. http://dx.doi.org/10.1093/oso/9780199227419.003.0013.

Повний текст джерела

Анотація:

Russia is a multi-ethnic country with more than two hundred different ‘officially recognized’ ethnic groups. Of these, twenty-seven have been given administrative recognition in the form of national republics, which together with non-ethnically based oblasts and krais (regions and territories) make up the Russian Federation. The Great Russians are numerically the most dominant group accounting for 80 per cent of the population. Next come the Tatars at 5.5 million, or 4 per cent of the total, and then Ukrainians, Bashkirs, Chuvashes, Chechens, Armenians, and other much less numerous groups. Soviet nationality policy did much to preserve ethnic identities in Russia, even though these were supposed to be transcended by a higher ‘Soviet socialist’ identity. When the USSR collapsed it did so along ethnic lines, and the post-Soviet Russian government was forced to accept ethnoterritorialism as an organizing principle of the new federal state (Smith, 1990, 1999). The major nationalities are not spatially discrete; many members of the most numerous nationalities live outside their republic and in only a minority of the national republics is the titular ethnic group the majority population. However, at lower scales, the picture is different and spatial segregation along ethnic lines can be marked, especially in rural areas. The southern steppe, describing an arc stretching from the Ukrainian border in the west to the regions beyond the River Volga in the east is, in fact, a veritable ethnic mosaic. Travellers who visited the southern and eastern steppe of European Russia in the eighteenth and nineteenth centuries commented upon the variety of national and religious groups of different descent settled in the area. Apart from the Russians who had come south during the protracted conquest of the steppe, people were to be found there of German, Swedish, Armenian, Bulgarian, Serbian,Walachian, Moldavian, Polish, Jewish, and Greek origin together with the descendants of the traditional steppe dwellers, the Tatars, Bashkirs, Chuvashes, Kirghiz, Kalmyks, and Mordvinians. The ethnic diversity of the settlers in the steppe was matched by the diversity of their cultural mores and religions.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ramsay-Jordan, Natasha N. "What Sports Do You Play? Actually, My Major Is Mathematics." In Women's Influence on Inclusion, Equity, and Diversity in STEM Fields, 66–75. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8870-2.ch003.

Повний текст джерела

Анотація:

Although many different cultures contribute richly to the development of mathematics, many research scholars promote Western and Eurocentric perspectives of mathematics as dominant forces in mathematics history, texts, curriculum, and instruction. This absence of diverse mathematicians has worked to shape current negative narratives surrounding people of color in science, technology, engineering, and mathematics (STEM). Particularly, women of African descent remain underrepresented in STEM, comprising only 1.6% of STEM professionals with bachelor's degrees, and only 1.4% of those with doctoral degrees. Marked by the intersection of systemic and institutionalized racism and gender oppression, these women, experience “double bind” challenges. Using the author's personal story, she explores these challenges to highlight how institutionalized racism and sexism permeated her mathematics-STEM experience. Lastly, approaches of how to navigate, discretely and indiscreetly, the underrepresentation of young girls and women of color in STEM are offered.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Discrete descent"

Farsa, Davood Zaman, and Shahryar Rahnamayan. "Discrete Coordinate Descent (DCD)." In 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2020. http://dx.doi.org/10.1109/smc42975.2020.9283201.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pochapsky, Eugene, and David Casasent. "Discrete Steepest Descent Algorithms And Their Realization On Optical Analog Processors." In 32nd Annual Technical Symposium, edited by J. P. Letellier. SPIE, 1989. http://dx.doi.org/10.1117/12.948555.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lombardi, Giovanni, Francois Beux, and Mattia de? Michieli Vitturi. "Analysis of 2D Coupled Sails: Use of an Optimization Technique Based on Turbulent Viscous Flows." In SNAME 16th Chesapeake Sailing Yacht Symposium. SNAME, 2003. http://dx.doi.org/10.5957/csys-2003-010.

Повний текст джерела

Анотація:

In this study the optimization of a complete 2D flying sails configuration is considered. An optimum shape design problem is then defined considering the maximization of the drive force on the sails, constrained by the heeling force, and complete flow modeling including turbulent effects. The corresponding numerical algorithm is based on a gradient descent method coupled with a discrete shape grid-point parameterization. The descent direction is obtained by an exact computation of an incomplete discrete gradient associated with a multilevel strategy. The numerical behavior of the present formulation has been illustrated by the optimization of real 2D configurations of an America’s Cup yacht.

Стилі APA, Harvard, Vancouver, ISO та ін.

Gharavi, Hani, Xueqin Liu, and Sean McLoone. "Warm start oriented discrete coordinate descent for dynamic CVR: A UK case study." In 2017 28th Irish Signals and Systems Conference (ISSC). IEEE, 2017. http://dx.doi.org/10.1109/issc.2017.7983628.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Liwei, and Maozhi Xu. "Improvements to the Descent Step in the Number Field Sieve for Discrete Logarithms." In 2020 International Conference on Computer, Information and Telecommunication Systems (CITS). IEEE, 2020. http://dx.doi.org/10.1109/cits49457.2020.9232505.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Heinke, Simon, and Herbert Werner. "A Gradient Descent Method for Finite Horizon Distributed Control of Discrete Time Systems." In 2021 60th IEEE Conference on Decision and Control (CDC). IEEE, 2021. http://dx.doi.org/10.1109/cdc45484.2021.9683326.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Hong, Ling Chen, Minglong Lei, Lingfeng Niu, Chuan Zhou, and Peng Zhang. "Discrete Embedding for Latent Networks." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/170.

Повний текст джерела

Анотація:

Discrete network embedding emerged recently as a new direction of network representation learning. Compared with traditional network embedding models, discrete network embedding aims to compress model size and accelerate model inference by learning a set of short binary codes for network vertices. However, existing discrete network embedding methods usually assume that the network structures (e.g., edge weights) are readily available. In real-world scenarios such as social networks, sometimes it is impossible to collect explicit network structure information and it usually needs to be inferred from implicit data such as information cascades in the networks. To address this issue, we present an end-to-end discrete network embedding model for latent networks DELN that can learn binary representations from underlying information cascades. The essential idea is to infer a latent Weisfeiler-Lehman proximity matrix that captures node dependence based on information cascades and then to factorize the latent Weisfiler-Lehman matrix under the binary node representation constraint. Since the learning problem is a mixed integer optimization problem, an efficient maximal likelihood estimation based cyclic coordinate descent (MLE-CCD) algorithm is used as the solution. Experiments on real-world datasets show that the proposed model outperforms the state-of-the-art network embedding methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

Lyubimov, Vladislav, and Ekaterina Kurkina. "Optimal Discrete Control Law for Rotation of a Descent Probe with a Small Inertial Asymmetry during the Descent in the Atmosphere of Mars." In 2019 XXI International Conference Complex Systems: Control and Modeling Problems (CSCMP). IEEE, 2019. http://dx.doi.org/10.1109/cscmp45713.2019.8976630.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alessandri, Angelo, and Mauro Gaggero. "Moving horizon state estimation for constrained discrete-time systems by using fast descent methods." In 2017 IEEE 56th Annual Conference on Decision and Control (CDC). IEEE, 2017. http://dx.doi.org/10.1109/cdc.2017.8263967.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Guo, Guibing, Enneng Yang, Li Shen, Xiaochun Yang, and Xiaodong He. "Discrete Trust-aware Matrix Factorization for Fast Recommendation." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/191.

Повний текст джерела

Анотація:

Trust-aware recommender systems have received much attention recently for their abilities to capture the influence among connected users. However, they suffer from the efficiency issue due to large amount of data and time-consuming real-valued operations. Although existing discrete collaborative filtering may alleviate this issue to some extent, it is unable to accommodate social influence. In this paper we propose a discrete trust-aware matrix factorization (DTMF) model to take dual advantages of both social relations and discrete technique for fast recommendation. Specifically, we map the latent representation of users and items into a joint hamming space by recovering the rating and trust interactions between users and items. We adopt a sophisticated discrete coordinate descent (DCD) approach to optimize our proposed model. In addition, experiments on two real-world datasets demonstrate the superiority of our approach against other state-of-the-art approaches in terms of ranking accuracy and efficiency.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!