Relevant bibliographies by topics / Bilinear optimization

Academic literature on the topic 'Bilinear optimization'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

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

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.

Journal articles on the topic "Bilinear optimization"

1

Berta, Mario, Omar Fawzi, and Volkher B. Scholz. "Quantum Bilinear Optimization." SIAM Journal on Optimization 26, no. 3 (January 2016): 1529–64. http://dx.doi.org/10.1137/15m1037731.

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

Wang, Cheng. "Optimization of SVM Method with RBF Kernel." Applied Mechanics and Materials 496-500 (January 2014): 2306–10. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.2306.

Full text
Abstract:
Usually there is no a uniform model to the choice of SVMs kernel function and its parameters for SVM. This paper presents a bilinear grid search method for the purpose of getting the parameter of SVM with RBF kernel, with the approach of combining grid search with bilinear search. Experiment results show that the proposed bilinear grid search has combined both the advantage of moderate training quantity by the bilinear search and of high predict accuracy by the grid search.
APA, Harvard, Vancouver, ISO, and other styles
3

Rasina, I. V., and O. V. Baturina. "Control optimization in bilinear systems." Automation and Remote Control 74, no. 5 (May 2013): 802–10. http://dx.doi.org/10.1134/s0005117913050056.

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

Witsenhausen, H. S. "A simple bilinear optimization problem." Systems & Control Letters 8, no. 1 (October 1986): 1–4. http://dx.doi.org/10.1016/0167-6911(86)90022-8.

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

Gronski, Jessica, Mohamed-Amin Ben Sassi, Stephen Becker, and Sriram Sankaranarayanan. "Template polyhedra and bilinear optimization." Formal Methods in System Design 54, no. 1 (September 4, 2018): 27–63. http://dx.doi.org/10.1007/s10703-018-0323-1.

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

Pamarthi, Nagaraju, and N. Nagamalleswara Rao. "Exponential Ant-Lion Rider Optimization for Privacy Preservation in Cloud Computing." Web Intelligence 19, no. 4 (January 20, 2022): 275–93. http://dx.doi.org/10.3233/web-210473.

Full text
Abstract:
The innovative trend of cloud computing is outsourcing data to the cloud servers by individuals or enterprises. Recently, various techniques are devised for facilitating privacy protection on untrusted cloud platforms. However, the classical privacy-preserving techniques failed to prevent leakage and cause huge information loss. This paper devises a novel methodology, namely the Exponential-Ant-lion Rider optimization algorithm based bilinear map coefficient Generation (Exponential-AROA based BMCG) method for privacy preservation in cloud infrastructure. The proposed Exponential-AROA is devised by integrating Exponential weighted moving average (EWMA), Ant Lion optimizer (ALO), and Rider optimization algorithm (ROA). The input data is fed to the privacy preservation process wherein the data matrix, and bilinear map coefficient Generation (BMCG) coefficient are multiplied through Hilbert space-based tensor product. Here, the bilinear map coefficient is obtained by multiplying the original data matrix and with modified elliptical curve cryptography (MECC) encryption to maintain data security. The bilinear map coefficient is used to handle both the utility and the sensitive information. Hence, an optimization-driven algorithm is utilized to evaluate the optimal bilinear map coefficient. Here, the fitness function is newly devised considering privacy and utility. The proposed Exponential-AROA based BMCG provided superior performance with maximal accuracy of 94.024%, maximal fitness of 1, and minimal Information loss of 5.977%.
APA, Harvard, Vancouver, ISO, and other styles
7

Konno, Hiroshi, and Michimori Inori. "BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING." Journal of the Operations Research Society of Japan 32, no. 2 (1989): 143–58. http://dx.doi.org/10.15807/jorsj.32.143.

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

Peleg, Dori, and Ron Meir. "A bilinear formulation for vector sparsity optimization." Signal Processing 88, no. 2 (February 2008): 375–89. http://dx.doi.org/10.1016/j.sigpro.2007.08.015.

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

Shuwaysh Alanazi, Badriah, and Maawiya Ould Sidi. "Optimal Control Problem Governed by an Evolution Equation and Using Bilinear Regular Feedback." Journal of Mathematics 2022 (April 23, 2022): 1–11. http://dx.doi.org/10.1155/2022/3521914.

Full text
Abstract:
We solve an optimal control problem governed by an evolution equation using bilinear regular feedback. Using optimization techniques, we show how to approximate the flow of a reaction-diffusion bilinear system by a desired target. For application, we consider the regional flow problem constrained by a bilinear distributed system. The paper ends by an example illustrating the numerical approach of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
10

Nie, Zelin, Feng Gao, and Chao-Bo Yan. "A Multi-Timescale Bilinear Model for Optimization and Control of HVAC Systems with Consistency." Energies 14, no. 2 (January 12, 2021): 400. http://dx.doi.org/10.3390/en14020400.

Full text
Abstract:
Reducing the energy consumption of the heating, ventilation, and air conditioning (HVAC) systems while ensuring users’ comfort is of both academic and practical significance. However, the-state-of-the-art of the optimization model of the HVAC system is that either the thermal dynamic model is simplified as a linear model, or the optimization model of the HVAC system is single-timescale, which leads to heavy computation burden. To balance the practicality and the overhead of computation, in this paper, a multi-timescale bilinear model of HVAC systems is proposed. To guarantee the consistency of models in different timescales, the fast timescale model is built first with a bilinear form, and then the slow timescale model is induced from the fast one, specifically, with a bilinear-like form. After a simplified replacement made for the bilinear-like part, this problem can be solved by a convexification method. Extensive numerical experiments have been conducted to validate the effectiveness of this model.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bilinear optimization"

1

Flagg, Garret Michael. "Interpolation Methods for the Model Reduction of Bilinear Systems." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/27521.

Full text
Abstract:
Bilinear systems are a class of nonlinear dynamical systems that arise in a variety of applications. In order to obtain a sufficiently accurate representation of the underlying physical phenomenon, these models frequently have state-spaces of very large dimension, resulting in the need for model reduction. In this work, we introduce two new methods for the model reduction of bilinear systems in an interpolation framework. Our first approach is to construct reduced models that satisfy multipoint interpolation constraints defined on the Volterra kernels of the full model. We show that this approach can be used to develop an asymptotically optimal solution to the H_2 model reduction problem for bilinear systems. In our second approach, we construct a solution to a bilinear system realization problem posed in terms of constructing a bilinear realization whose kth-order transfer functions satisfy interpolation conditions in k complex variables. The solution to this realization problem can be used to construct a bilinear system realization directly from sampling data on the kth-order transfer functions, without requiring the formation of the realization matrices for the full bilinear system.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
2

Dominick, Steven James. "COMMERCIALIZATION AND OPTIMIZATION OF THE PIXEL ROUTER." UKnowledge, 2010. http://uknowledge.uky.edu/gradschool_theses/39.

Full text
Abstract:
The Pixel Router was developed at the University of Kentucky with the intent of supporting multi-projector displays by combining the scalability of commercial software solutions with the flexibility of commercial hardware solutions. This custom hardware solution uses a Look Up Table for an arbitrary input to output pixel mapping, but suffers from high memory latencies due to random SDRAM accesses. In order for this device to achieve marketability, the image interpolation method needed improvement as well. The previous design used the nearest neighbor interpolation method, which produces poor looking results but requires the least amount of memory accesses. A cache was implemented to support bilinear interpolation to simultaneously increase the output frame rate and image quality. A number of software simulations were conducted to test and refine the cache design, and these results were verified by testing the implementation on hardware. The frame rate was improved by a factor of 6 versus bilinear interpolation on the previous design, and by as much as 50% versus nearest neighbor on the previous design. The Pixel Router was also certified for FCC conducted and radiated emissions compliance, and potential commercial market areas were explored.
APA, Harvard, Vancouver, ISO, and other styles
3

Swirydowicz, Katarzyna. "Strategies For Recycling Krylov Subspace Methods and Bilinear Form Estimation." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/78695.

Full text
Abstract:
The main theme of this work is effectiveness and efficiency of Krylov subspace methods and Krylov subspace recycling. While solving long, slowly changing sequences of large linear systems, such as the ones that arise in engineering, there are many issues we need to consider if we want to make the process reliable (converging to a correct solution) and as fast as possible. This thesis is built on three main components. At first, we target bilinear and quadratic form estimation. Bilinear form $c^TA^{-1}b$ is often associated with long sequences of linear systems, especially in optimization problems. Thus, we devise algorithms that adapt cheap bilinear and quadratic form estimates for Krylov subspace recycling. In the second part, we develop a hybrid recycling method that is inspired by a complex CFD application. We aim to make the method robust and cheap at the same time. In the third part of the thesis, we optimize the implementation of Krylov subspace methods on Graphic Processing Units (GPUs). Since preconditioners based on incomplete matrix factorization (ILU, Cholesky) are very slow on the GPUs, we develop a preconditioner that is effective but well suited for GPU implementation.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
4

Cabral, Ricardo da Silveira. "Unifying Low-Rank Models for Visual Learning." Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/506.

Full text
Abstract:
Many problems in signal processing, machine learning and computer vision can be solved by learning low rank models from data. In computer vision, problems such as rigid structure from motion have been formulated as an optimization over subspaces with fixed rank. These hard-rank constraints have traditionally been imposed by a factorization that parameterizes subspaces as a product of two matrices of fixed rank. Whilst factorization approaches lead to efficient and kernelizable optimization algorithms, they have been shown to be NP-Hard in presence of missing data. Inspired by recent work in compressed sensing, hard-rank constraints have been replaced by soft-rank constraints, such as the nuclear norm regularizer. Vis-a-vis hard-rank approaches, soft-rank models are convex even in presence of missing data: but how is convex optimization solving a NP-Hard problem? This thesis addresses this question by analyzing the relationship between hard and soft rank constraints in the unsupervised factorization with missing data problem. Moreover, we extend soft rank models to weakly supervised and fully supervised learning problems in computer vision. There are four main contributions of our work: (1) The analysis of a new unified low-rank model for matrix factorization with missing data. Our model subsumes soft and hard-rank approaches and merges advantages from previous formulations, such as efficient algorithms and kernelization. It also provides justifications on the choice of algorithms and regions that guarantee convergence to global minima. (2) A deterministic \rank continuation" strategy for the NP-hard unsupervised factorization with missing data problem, that is highly competitive with the state-of-the-art and often achieves globally optimal solutions. In preliminary work, we show that this optimization strategy is applicable to other NP-hard problems which are typically relaxed to convex semidentite programs (e.g., MAX-CUT, quadratic assignment problem). (3) A new soft-rank fully supervised robust regression model. This convex model is able to deal with noise, outliers and missing data in the input variables. (4) A new soft-rank model for weakly supervised image classification and localization. Unlike existing multiple-instance approaches for this problem, our model is convex.
APA, Harvard, Vancouver, ISO, and other styles
5

Joannopoulos, Emilie. "Contributions à la résolution globale de problèmes bilinéaires appliqués à l'indstrie porcine." Thesis, Rennes, INSA, 2018. http://www.theses.fr/2018ISAR0006/document.

Full text
Abstract:
Aujourd'hui, l'alimentation représente plus de 70% du coût de production en engraissement porcin et dans le contexte économique actuel, il est important de parvenir à réduire ce coût. L'alimentation utilisée actuellement utilise des phases et est représentée par un modèle linéaire. L'alimentation par mélanges introduite récemment est représentée par un modèle bilinéaire. Nous introduisons ici une nouvelle formulation qui est une combinaison des alimentations traditionnelle par mélanges: la méthode hybride. Nous montrons qu'elle permet de réduire le coût de plus de 5%. L'étude principale porte sur l'optimisation globale du problème bilinéaire, non convexe, modélisant l'alimentation par mélanges. La bilinéarité apparaît dans la fonction objectif et dans les contraintes. Ce problème peut posséder plusieurs minima, mais nous souhaitons obtenir un minimum global. Il est équivalent à un problème de pooling et nous montrons qu'il est fortement NP-difficile. Après de premiers résultats, nous énonçons la conjecture que tout minimum local est global pour ce problème bilinéaire appliqué à l'industrie porcine. Nous la prouvons sur un exemple de dimension réduite. Notre problème ne pouvant pas être résolu avec des solveurs globaux à cause de sa dimension, nous utilisons des approches telle que la pénalisation, la discrétisation, et techniques de relaxation lagrangienne ou convexe. Toutes ces approches supportent notre conjecture. Nous faisons également une étude de la robustesse des modèles à la variation des prix des ingrédients ainsi qu'une étude multicritère nous permettant d'obtenir des résultats numériques réduisant considérablement les rejets, autres enjeux importants
Today, feed represents more than 70% of the production cost in growing-finishing pig industry and in the current economic context, it is important to reduce it. The feeding system currently used uses phases and is expressed as a linear model. The feeding system using feeds introduced more recently is represented by a bilinear model. We introduced here new feeding system which is a combination offeeding systems using phases and feeds: the hybrid method. We show that it can reduce the feed cost by more than 5%. The main part of this manuscript is about global optimization of the bilinear problem, and non convex, problem modeling feeding system using feeds. The objective function and some constraints are bilinear. This problem can have several local minima but we would like to have a global one. It is equivalent to a pooling problem and we prove that it is a strongly NP-hard problem. After a study of first results, we enounce the conjecture that any local minimum is a global minimum for that problem applied in the pig industry. We prove it for a small size example. Our problem cannot be solved by using global solver due to its size, then we applied some relaxation methods such as penalization of bilinear terms, their discretization and Langrangian and convex relaxations. All these approaches support our conjecture. Then we study the robustness of the models on the ingredient price variations and a multicriteria study reducing phosphorus and nitrogen excretion
APA, Harvard, Vancouver, ISO, and other styles
6

Malina, Lukáš. "Kryptografické protokoly s ochranou soukromí pro zabezpečení heterogenních sítí." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-233671.

Full text
Abstract:
Disertační práce se zabývá kryptografickými protokoly poskytující ochranu soukromí, které jsou určeny pro zabezpečení komunikačních a informačních systémů tvořících heterogenní sítě. Práce se zaměřuje především na možnosti využití nekonvenčních kryptografických prostředků, které poskytují rozšířené bezpečnostní požadavky, jako je například ochrana soukromí uživatelů komunikačního systému. V práci je stanovena výpočetní náročnost kryptografických a matematických primitiv na různých zařízeních, které se podílí na zabezpečení heterogenní sítě. Hlavní cíle práce se zaměřují na návrh pokročilých kryptografických protokolů poskytujících ochranu soukromí. V práci jsou navrženy celkově tři protokoly, které využívají skupinových podpisů založených na bilineárním párování pro zajištění ochrany soukromí uživatelů. Tyto navržené protokoly zajišťují ochranu soukromí a nepopiratelnost po celou dobu datové komunikace spolu s autentizací a integritou přenášených zpráv. Pro navýšení výkonnosti navržených protokolů je využito optimalizačních technik, např. dávkového ověřování, tak aby protokoly byly praktické i pro heterogenní sítě.
APA, Harvard, Vancouver, ISO, and other styles
7

Ruiz, Manuel. "Une approche exacte de résolution de problèmes de pooling appliquée à la fabrication d'aliments." Phd thesis, Université de Grenoble, 2013. http://tel.archives-ouvertes.fr/tel-00992383.

Full text
Abstract:
Cette thèse intitulée " Une approche exacte de résolution de problèmes de pooling appliquée à la fabrication d'aliments ", porte sur la résolution (par des méthodes exactes d'optimisation) de problèmes industriels liés à la fabrication d'aliments. Ces problèmes industriels traitent de l'aide à la décision pour la fabrication d'aliments pour des animaux et se rapprochent de problèmes biens connus de la littérature scientifique, à savoir les problèmes de pooling. La méthode présentée dans cet exposé permet de résoudre les problèmes d'optimisation bilinéaires issus de cette problématique industrielle. Elle est basée un branch-and-bound résolvant des linéarisations. Une approche lagrangienne a aussi été explorée et testée pour calculer des bornes inférieures.
APA, Harvard, Vancouver, ISO, and other styles
8

Bonnal, Thomas. "Développements de modèles optiques et de méthodes non supervisées de résolution des problèmes bilinéaires : application à l’imagerie vibrationnelle." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE1063.

Full text
Abstract:
La caractérisation fine des matériaux inorganiques nécessite d'avoir accès à des informations complémentaires de celles apportées par des techniques d'analyse élémentaire ou de diffraction. La spectroscopie infrarouge à transformée de Fourier permet de caractériser les liaisons covalentes et l'environnement des groupes fonctionnels dans les matériaux. C'est donc une technique de choix pour l'étude des matériaux hydratés, amorphes ou sujets à des phénomènes de vieillissement. En couplant cette technique à une platine de déplacement, il est possible de réaliser des cartographies des phases sur quelques centimètres carrés : c'est la microscopie infrarouge. Cette thèse développe plus particulièrement l'utilisation de la lumière réfléchie au travers de l'étude de la réflexion spéculaire et de la réflexion totale atténuée (ATR).Après une première partie se focalisant sur les méthodes d'acquisitions disponibles, une seconde partie s'attache à obtenir de manière non supervisée les cartographies chimiques associées aux concentrations relatives des différents composants présents dans la zone analysée. Des techniques de réduction de données et d'analyse factorielle sont mises en place afin d'estimer le nombre de composants chimiques et leurs spectres relatifs ; des problèmes de minimisation sous contraintes sont résolus pour extraire l'information chimique. La réflexion spéculaire ne nécessite aucun contact avec l‘échantillon et, de ce fait, n'entraine aucune altération de la surface analysée. C'est sur le papier une technique de choix pour suivre l'évolution d'un matériau. Cependant, elle souffre de la complexité d'interprétation liée à l'allure des spectres obtenus. Afin de développer la cartographie issue de la réflexion spéculaire, des modèles prenant en compte l'optique géométrique, l'optique ondulatoire, des corrections d'interférogrammes et des méthodes classiques d'homogénéisation ont été développés. Ce travail a permis d'aboutir à un modèle optique liant les spectres issus de la réflexion spéculaire avec les concentrations relatives des composants. Ce modèle tient compte de la polarisation, de l'angle d'incidence et utilise les constantes diélectriques du matériau. Ce modèle a été validé sur un matériau contenant trois composants distincts facilement identifiables en infrarouge et spécialement mis en forme pour cette étude. Ce modèle a ouvert la voie à l'utilisation innovante de lumières polarisées elliptiquement pour déterminer l'indice de réfraction complexe d'un matériau. Ainsi, des spectroscopes infrarouges couplés à un accessoire de contrôle de l'angle d'incidence peuvent être utilisés en complément de l'ellipsométrie
Complementary information, to that provided by elemental analysis and diffraction techniques, is needed to characterize inorganic materials. Fourier Transform Infrared spectroscopy enables to characterize covalent bonds and the environment of functional groups in materials. Thus, it is a technique of interest to study hydrated materials, amorphous materials or any materials, which may experience ageing phenomena. By combining this technique with a micrometric motorized stage, cartographies of chemical compounds can be obtained on several square millimeters: this is the infrared microscopy technique. This Ph.D. thesis focuses on the use of reflected light, in particular through the study of specular reflection and of Attenuated Total Reflectance (ATR). After a first part focused on the different acquisition set-ups, a second part covers the unsupervised methodologies of resolution employed to obtain chemical maps. They result in one map for each component present in the analyzed area. Dimensions reduction techniques and multivariate statistics techniques are implemented to estimate the number of components and their infrared spectra; minimization problems under constraints are solved to retrieve chemical information. When specular reflection is used to acquire spectra, no contact is made with the sample, thus no damage of the analyzed area occurs during the acquisition. A priori, it is a great technique to study the evolution of a material. However, this technique suffers from the complexity of interpretation of the resulting spectra. With the objective to democratize the use of specular reflection to obtain chemical maps, models based on geometrical optics and including diffraction, correction of interferograms and classical homogenization techniques have been developed. This work resulted in an optical model linking the angle of incidence, the polarization state and the dielectric optical constants of the material with the reflected light, which is measured. A model material, constituted of three distinct phases, detectable in the infrared range, has specially been fabricated to validate this optical model. This model set the stage for the use of elliptically polarized light in the determining of the complex refractive indices of materials in the infrared range. Thanks to this development, infrared spectroscopes, equipped with a classical set-up to control the angle of incidence, can now be used in addition to ellipsometry techniques
APA, Harvard, Vancouver, ISO, and other styles
9

Rigterink, Fabian. "Pooling problems: advances in theory and applications." Thesis, 2017. http://hdl.handle.net/1959.13/1350692.

Full text
Abstract:
Research Doctorate - Doctor of Philosophy (PhD)
This thesis presents advances in theory and applications of the pooling problem—a nonlinear optimisation problem of great importance to the oil and petroleum refining industry, but also to the mining industry. The nonlinearities of the problem arise from bilinear constraints that capture the blending of material. Linearisation is a common approach used in state-of-the-art optimisation software to solve these types of problems. A crucial task is to construct tight linear relaxations, the tightest being the convex hull. Typically, bilinear functions are linearised using a term-wise McCormick relaxation. For a single bilinear term, the McCormick relaxation is convex hull defining, however, for a bilinear function, it often is not. In addition to the McCormick inequalities, Padberg introduced triangle, clique, cut, generalised cut, and odd cycle inequalities, to further approximate the convex hull. On the theoretical side, we propose new multi-commodity flow formulations of the pooling problem which outperform previously known formulations. Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs is polynomially solvable. This result further defines the border between (strongly) NP-hard and polynomially solvable cases of the problem. Answering a question of Luedtke, Namazifar, and Linderoth, we show that the McCormick relaxation of a bilinear function can, in some sense, be arbitrarily looser than its convex hull. We present an alternative proof for a result of Misener, Smadbeck, and Floudas which characterises bilinear functions for which the McCormick relaxation is convex hull defining. Using McCormick and Padberg inequalities, we define the convex hulls of several additional classes of bilinear functions. As for bilinear functions for which we cannot define the convex hull, we find that McCormick and Padberg's triangle inequalities approximate the convex hull best, and we apply these inequalities to (quadratically constrained) quadratic programs to speed up a solver's performance. On the applied side, we model coal blending operations at the port of Newcastle, Australia—the world's largest coal export port. Coal is made-to-order according to customers' desired quality values and vessel loading times. The coal chain coordinator is interested in meeting these target qualities and times since deviations on either side typically result in contractually agreed costs. We model this setting as a dynamic, time-expanded pooling problem, apply flow discretisations, and solve large, realistic instances.
APA, Harvard, Vancouver, ISO, and other styles
10

Bokhari, Syed. "Design and Discrete Optimization of BIBO Stable FRM Digital Filters Incorporating IIR Digital Interpolation Subfilters." Master's thesis, 2010. http://hdl.handle.net/10048/1014.

Full text
Abstract:
Digital filters having sharp transition band play a vital role in modern digital signal processing (DSP) applications. Emerging technologies require digital filters to be both computationally efficient in software/hardware realizations. This thesis is concerned with the design and structural-level optimization of sharp transition band digital filters employing the well known frequency response masking (FRM) approach. Unlike the conventional finite impulse response (FIR) based FRM approach, the FRM technique used in this thesis incorporates infinite impulse response (IIR) digital interpolation subfilters, thereby reducing the overall filter order that results in a reduction of hardware complexity. Two realization methods are discussed in this thesis, namely, the bilinear-lossless-discrete-integrators (bilinear-LDI) digital filter design technique, and the lattice wave digital filter (lattice WDF) digital filter design technique. Diversity controlled (DC) genetic algorithm (GA) is employed to optimize both types of IIR based FRM digital filters over the efficient canonical signed digit (CSD) multiplier coefficient space. DCGAs represent FRM digital filters by a binary chromosome and proceed from a population pool of candidate chromosomes to future generations in order to arrive at the desired FRM digital filter satisfying the design specifications. A novel cost-function is used that allows the DCGA to simultaneously optimize both the amplitude-frequency and group-delay frequency response. A fast convergence speed has been observed.
Communications
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Bilinear optimization"

1

Pardalos, Panos M., and Vitaliy Yatsenko. Optimization and Control of Bilinear Systems. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3.

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

Pardalos, P. M. Optimization and control of bilinear systems: Theory, algorithms, and applications. New York: Springer, 2008.

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

Pardalos, P. M. Optimization and Control of Bilinear Systems: Theory, Algorithms, and Applications. Springer, 2010.

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

Book chapters on the topic "Bilinear optimization"

1

Floudas, Christodoulos A., Pãnos M. Pardalos, Claire S. Adjiman, William R. Esposito, Zeynep H. Gümüş, Stephen T. Harding, John L. Klepeis, Clifford A. Meyer, and Carl A. Schweiger. "Bilinear problems." In Nonconvex Optimization and Its Applications, 33–57. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-3040-1_5.

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

Dolecki, S. "Continuity of bilinear and non-bilinear polarities." In Optimization and Related Fields, 191–213. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/bfb0076707.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Control of Bilinear Systems." In Optimization and Control of Bilinear Systems, 65–91. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_2.

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

Pardalos, Panos M., Pavel S. Knopov, Stanislav P. Uryasev, and Vitaliy A. Yatsenko. "Optimal Estimation of Signal Parameters Using Bilinear Observations." In Applied Optimization, 103–17. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-6099-6_8.

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

Caprara, Alberto, Marco Locatelli, and Michele Monaci. "Bidimensional Packing by Bilinear Programming." In Integer Programming and Combinatorial Optimization, 377–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11496915_28.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Superconducting Levitation and Bilinear Systems." In Optimization and Control of Bilinear Systems, 177–206. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_5.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Bilinear Systems and Nonlinear Estimation Theory." In Optimization and Control of Bilinear Systems, 93–138. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_3.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Modeling And Analysis Of Bilinear Systems." In Optimization and Control of Bilinear Systems, 313–51. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_8.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Optimization And Control Of Quantum-Mechanical Processes." In Optimization and Control of Bilinear Systems, 207–60. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_6.

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

Pardalos, Panos M., and Vitaliy Yatsenko. "Modeling And Global Optimization In Biomolecular Systems." In Optimization and Control of Bilinear Systems, 261–312. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73669-3_7.

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

Conference papers on the topic "Bilinear optimization"

1

Hijazi, Hassan. "Perspective envelopes for bilinear functions." In PROCEEDINGS LEGO – 14TH INTERNATIONAL GLOBAL OPTIMIZATION WORKSHOP. Author(s), 2019. http://dx.doi.org/10.1063/1.5089984.

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

Zhuo, Li'an, Baochang Zhang, Linlin Yang, Hanlin Chen, Qixiang Ye, David Doermann, Rongrong Ji, and Guodong Guo. "Cogradient Descent for Bilinear Optimization." In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2020. http://dx.doi.org/10.1109/cvpr42600.2020.00798.

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

"Optimization of bilinear systems using higher-order method." In Proceedings of the 1999 American Control Conference. IEEE, 1999. http://dx.doi.org/10.1109/acc.1999.783171.

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

Zhao, LinTong, Kai Che, Jian Lv, and Yun Zhou. "Bilinear interpolation algorithm based on gradient-weighted optimization." In 2022 International Conference on Image Processing, Computer Vision and Machine Learning (ICICML). IEEE, 2022. http://dx.doi.org/10.1109/icicml57342.2022.10009750.

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

Tang, Yuelong, and Yuchun Hua. "Superconvergence of Variational Discretization for Bilinear Elliptic Optimization Problems." In 2017 International Conference on Applied Mathematics, Modelling and Statistics Application (AMMSA 2017). Paris, France: Atlantis Press, 2017. http://dx.doi.org/10.2991/ammsa-17.2017.65.

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

Zhen, Ping, Xiaobo Hu, Yanyan Yu, Liang Liu, and Haifeng Zhang. "Research on the Optimization Computation of SM9 Bilinear Pairings." In the 2017 2nd International Conference. New York, New York, USA: ACM Press, 2017. http://dx.doi.org/10.1145/3158233.3159381.

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

Zhen, Ping, Yinzi Tu, Bingbing Xia, Jie Gan, and Xiaoke Tang. "Research on the miller loop optimization of SM9 bilinear pairings." In 2017 IEEE 17th International Conference on Communication Technology (ICCT). IEEE, 2017. http://dx.doi.org/10.1109/icct.2017.8359619.

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

Liu, Xianze, Jihong Liu, Bifei Jiang, Haozhen Jiang, and Zhi Yang. "More Efficient SM9 Algorithm Based on Bilinear Pair Optimization Processing." In 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). IEEE, 2020. http://dx.doi.org/10.1109/trustcom50675.2020.00234.

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

Doelman, Reinier, and Michel Verhaegen. "Sequential convex relaxation for convex optimization with bilinear matrix equalities." In 2016 European Control Conference (ECC). IEEE, 2016. http://dx.doi.org/10.1109/ecc.2016.7810576.

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

"A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities." In Proceedings of the 1999 American Control Conference. IEEE, 1999. http://dx.doi.org/10.1109/acc.1999.786170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bilinear optimization' for particular source types:
Journal articles
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