登录
首页 » Others » 布谷鸟算法

布谷鸟算法

于 2020-12-09 发布
0 184
下载积分: 1 下载次数: 5

代码说明:

布谷鸟算法python代码,基于xinshe Yang的matlab m文件改编

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 优秀毕业设计(带论文和答辩ppt):智能家居系统(强烈推荐!)
    基于vxwork and arm的智能家居系统 可用手机发送短信控制 控制温度 智能报警等-
    2020-12-06下载
    积分:1
  • 基于DCT的JPEG图像压缩码算法的MATLAB实现 钱裕禄,周雪娇论文
    图像压缩算法JPEG基于DCT图像压缩算法JPEG基于DCT图像压缩算法JPEG基于DCT图像压缩算法JPEG基于DCT
    2020-12-01下载
    积分:1
  • matlab 多项式、插值与数据拟合.ppt
    【实例简介】Lagrange插值 Hermite插值 Runge现象和分段插值 分段插值 样条插值的MATLAB表示 多项式拟合 函数线性组合的曲线拟合方法 最小二乘曲线拟合 B样条函数及其MATLAB表示
    2021-11-26 00:32:23下载
    积分:1
  • 凸优化在信号处理与通信中的应用Convex Optimization in Signal Processing and Communications
    凸优化理论在信号处理以及通信系统中的应用 比较经典的通信系统凸优化入门教程ContentsList of contributorspage IxPrefaceAutomatic code generation for real- time convex optimizationJacob Mattingley and stephen Boyd1.1 Introduction1.2 Solvers and specification languages61. 3 Examples121. 4 Algorithm considerations1.5 Code generation261.6 CVXMOD: a preliminary implementation281.7 Numerical examples291. 8 Summary, conclusions, and implicationsAcknowledgments35ReferencesGradient-based algorithms with applications to signal-recoveryproblemsAmir beck and marc teboulle2.1 Introduction422.2 The general optimization model432.3 Building gradient-based schemes462. 4 Convergence results for the proximal-gradient method2.5 A fast proximal-gradient method2.6 Algorithms for l1-based regularization problems672.7 TV-based restoration problems2. 8 The source-localization problem772.9 Bibliographic notes83References85ContentsGraphical models of autoregressive processes89Jitkomut Songsiri, Joachim Dahl, and Lieven Vandenberghe3.1 Introduction893.2 Autoregressive processes923.3 Autoregressive graphical models983. 4 Numerical examples1043.5 Conclusion113Acknowledgments114References114SDP relaxation of homogeneous quadratic optimization: approximationbounds and applicationsZhi-Quan Luo and Tsung-Hui Chang4.1 Introduction1174.2 Nonconvex QCQPs and sDP relaxation1184.3 SDP relaxation for separable homogeneous QCQPs1234.4 SDP relaxation for maximization homogeneous QCQPs1374.5 SDP relaxation for fractional QCQPs1434.6 More applications of SDP relaxation1564.7 Summary and discussion161Acknowledgments162References162Probabilistic analysis of semidefinite relaxation detectors for multiple-input,multiple-output systems166Anthony Man-Cho So and Yinyu Ye5.1 Introduction1665.2 Problem formulation1695.3 Analysis of the SDr detector for the MPsK constellations1725.4 Extension to the Qam constellations1795.5 Concluding remarks182Acknowledgments182References189Semidefinite programming matrix decomposition, and radar code design192Yongwei Huang, Antonio De Maio, and Shuzhong Zhang6.1 Introduction and notation1926.2 Matrix rank-1 decomposition1946.3 Semidefinite programming2006.4 Quadratically constrained quadratic programming andts sdp relaxation201Contents6.5 Polynomially solvable QCQP problems2036.6 The radar code-design problem2086.7 Performance measures for code design2116.8 Optimal code design2146.9 Performance analysis2186.10 Conclusions223References226Convex analysis for non-negative blind source separation withapplication in imaging22Wing-Kin Ma, Tsung-Han Chan, Chong-Yung Chi, and Yue Wang7.1 Introduction2297.2 Problem statement2317.3 Review of some concepts in convex analysis2367.4 Non-negative, blind source-Separation criterion via CAMNS2387.5 Systematic linear-programming method for CAMNS2457.6 Alternating volume-maximization heuristics for CAMNS2487.7 Numerical results2527.8 Summary and discussion257Acknowledgments263References263Optimization techniques in modern sampling theory266Tomer Michaeli and yonina c. eldar8.1 Introduction2668.2 Notation and mathematical preliminaries2688.3 Sampling and reconstruction setup2708.4 Optimization methods2788.5 Subspace priors2808.6 Smoothness priors2908.7 Comparison of the various scenarios3008.8 Sampling with noise3028. 9 Conclusions310Acknowledgments311References311Robust broadband adaptive beamforming using convex optimizationMichael Rubsamen, Amr El-Keyi, Alex B Gershman, and Thia Kirubarajan9.1 Introduction3159.2 Background3179.3 Robust broadband beamformers3219.4 Simulations330Contents9.5 Conclusions337Acknowledgments337References337Cooperative distributed multi-agent optimization340Angelia Nedic and asuman ozdaglar10.1 Introduction and motivation34010.2 Distributed-optimization methods using dual decomposition34310.3 Distributed-optimization methods using consensus algorithms35810.4 Extensions37210.5 Future work37810.6 Conclusions38010.7 Problems381References384Competitive optimization of cognitive radio MIMO systems via game theory387Gesualso Scutari, Daniel P Palomar, and Sergio Barbarossa11.1 Introduction and motivation38711.2 Strategic non-cooperative games: basic solution concepts and algorithms 39311.3 Opportunistic communications over unlicensed bands411.4 Opportunistic communications under individual-interferenceconstraints4151.5 Opportunistic communications under global-interference constraints43111.6 Conclusions438Ackgment439References43912Nash equilibria: the variational approach443Francisco Facchinei and Jong-Shi Pang12.1 Introduction44312.2 The Nash-equilibrium problem4412. 3 EXI45512.4 Uniqueness theory46612.5 Sensitivity analysis47212.6 Iterative algorithms47812.7 A communication game483Acknowledgments490References491Afterword494Index49ContributorsSergio BarbarossaYonina c, eldarUniversity of rome-La SapienzaTechnion-Israel Institute of TechnologyHaifaIsraelAmir beckTechnion-Israel instituteAmr El-Keyiof TechnologyAlexandra universityHaifEgyptIsraelFrancisco facchiniStephen boydUniversity of rome La sapienzaStanford UniversityRomeCaliforniaItalyUSAAlex b, gershmanTsung-Han ChanDarmstadt University of TechnologyNational Tsing Hua UniversityDarmstadtHsinchuGermanyTaiwanYongwei HuangTsung-Hui ChangHong Kong university of scienceNational Tsing Hua Universityand TechnologyHsinchuHong KongTaiwanThia KirubarajanChong-Yung chiMcMaster UniversityNational Tsing Hua UniversityHamilton ontarioHsinchuCanadaTaiwanZhi-Quan LuoJoachim dahlUniversity of minnesotaanybody Technology A/sMinneapolisDenmarkUSAList of contributorsWing-Kin MaMichael rebsamenChinese University of Hong KongDarmstadt UniversityHong KonTechnologyDarmstadtAntonio de maioGermanyUniversita degli studi di napoliFederico iiGesualdo scutariNaplesHong Kong University of Sciencealyand TechnologyHong KongJacob MattingleyAnthony Man-Cho SoStanford UniversityChinese University of Hong KongCaliforniaHong KongUSAJitkomut songsinTomer michaeliUniversity of californiaTechnion-Israel instituteLoS Angeles. CaliforniaogyUSAHaifaMarc teboulleTel-Aviv UniversityAngelia NedicTel-AvUniversity of Illinois atIsraelUrbana-ChampaignInoSLieven VandenbergheUSAUniversity of CaliforniaLos Angeles, CaliforniaUSAAsuman OzdaglarMassachusetts Institute of TechnologyYue WangBoston massachusettsVirginia Polytechnic InstituteUSAand State UniversityArlingtonDaniel p palomarUSAHong Kong University ofScience and TechnologyYinyu YeHong KongStanford UniversityCaliforniaong-Shi PangUSAUniversity of illinoisat Urbana-ChampaignShuzhong zhangIllinoisChinese university of Hong KongUSAHong KongPrefaceThe past two decades have witnessed the onset of a surge of research in optimization.This includes theoretical aspects, as well as algorithmic developments such as generalizations of interior-point methods to a rich class of convex-optimization problemsThe development of general-purpose software tools together with insight generated bythe underlying theory have substantially enlarged the set of engineering-design problemsthat can be reliably solved in an efficient manner. The engineering community has greatlybenefited from these recent advances to the point where convex optimization has nowemerged as a major signal-processing technique on the other hand, innovative applica-tions of convex optimization in signal processing combined with the need for robust andefficient methods that can operate in real time have motivated the optimization commu-nity to develop additional needed results and methods. The combined efforts in both theoptimization and signal-processing communities have led to technical breakthroughs ina wide variety of topics due to the use of convex optimization This includes solutions tonumerous problems previously considered intractable; recognizing and solving convex-optimization problems that arise in applications of interest; utilizing the theory of convexoptimization to characterize and gain insight into the optimal-solution structure and toderive performance bounds; formulating convex relaxations of difficult problems; anddeveloping general purpose or application-driven specific algorithms, including thosethat enable large-scale optimization by exploiting the problem structureThis book aims at providing the reader with a series of tutorials on a wide varietyof convex-optimization applications in signal processing and communications, writtenby worldwide leading experts, and contributing to the diffusion of these new developments within the signal-processing community. The goal is to introduce convexoptimization to a broad signal-processing community, provide insights into how convexoptimization can be used in a variety of different contexts, and showcase some notablesuccesses. The topics included are automatic code generation for real-time solvers, graphical models for autoregressive processes, gradient-based algorithms for signal-recoveryapplications, semidefinite programming(SDP)relaxation with worst-case approximationperformance, radar waveform design via SDP, blind non-negative source separation forimage processing, modern sampling theory, robust broadband beamforming techniquesdistributed multiagent optimization for networked systems, cognitive radio systems viagame theory, and the variational-inequality approach for Nash-equilibrium solutionsPrefaceThere are excellent textbooks that introduce nonlinear and convex optimization, providing the reader with all the basics on convex analysis, reformulation of optimizationproblems, algorithms, and a number of insightful engineering applications. This book istargeted at advanced graduate students, or advanced researchers that are already familiarwith the basics of convex optimization. It can be used as a textbook for an advanced graduate course emphasizing applications, or as a complement to an introductory textbookthat provides up-to-date applications in engineering. It can also be used for self-study tobecome acquainted with the state of-the-art in a wide variety of engineering topicsThis book contains 12 diverse chapters written by recognized leading experts worldwide, covering a large variety of topics. Due to the diverse nature of the book chaptersit is not possible to organize the book into thematic areas and each chapter should betreated independently of the others. a brief account of each chapter is given nextIn Chapter 1, Mattingley and Boyd elaborate on the concept of convex optimizationin real-time embedded systems and automatic code generation. As opposed to genericsolvers that work for general classes of problems, in real-time embedded optimization thesame optimization problem is solved many times, with different data, often with a hardreal-time deadline. Within this setup the authors propose an automatic code-generationsystem that can then be compiled to yield an extremely efficient custom solver for theproblem familyIn Chapter 2, Beck and Teboulle provide a unified view of gradient-based algorithmsfor possibly nonconvex and non-differentiable problems, with applications to signalrecovery. They start by rederiving the gradient method from several different perspectives and suggest a modification that overcomes the slow convergence of the algorithmThey then apply the developed framework to different image-processing problems suchas e1-based regularization, TV-based denoising, and Tv-based deblurring, as well ascommunication applications like source localizationIn Chapter 3, Songsiri, Dahl, and Vandenberghe consider graphical models for autore-gressive processes. They take a parametric approach for maximum-likelihood andmaximum-entropy estimation of autoregressive models with conditional independenceconstraints, which translates into a sparsity pattern on the inverse of the spectral-densitymatrix. These constraints turn out to be nonconvex. To treat them the authors proposea relaxation which in some cases is an exact reformulation of the original problem. Theproposed methodology allows the selection of graphical models by fitting autoregressiveprocesses to different topologies and is illustrated in different applicationsThe following three chapters deal with optimization problems closely related to SDPand relaxation techniquesIn Chapter 4, Luo and Chang consider the SDP relaxation for several classes ofquadratic-optimization problems such as separable quadratically constrained quadraticprograms(QCQPs)and fractional QCQPs, with applications in communications and signal processing. They identify cases for which the relaxation is tight as well as classes ofquadratic-optimization problems whose relaxation provides a guaranteed, finite worstcase approximation performance. Numerical simulations are carried out to assess theefficacy of the SDP-relaxation approach
    2020-12-10下载
    积分:1
  • 求取图像的相关系数---matlab ---M文件
    有关于求取图像相关系数的matlab M 文件;虽然很简单,但可以为你省去那么一点时间。 共享改变未来!
    2020-11-30下载
    积分:1
  • Datcom说明书
    计算飞机气动特性的软件的说明书,主要应用于概念设计和初步设计阶段TABLE 2AERODYNAMIC OUTPUT AS A FUNCTION OF /CONFIGURATION AND SPEED REGIME● OUTPUT A∨A| LABLED OUTPUT ONLY FOR CON FIGURATIONS WITH STRAIGHT TAPERED SURFACESA OUTPUT ONLY WITH EXPERIMENTAL DATA INPUCONFIGURATION SPEEDSTATIC AERODYN AMIC CHARACTERISTIC OUTPUTDY NAMIC STABILITY CUTPUREGIMECLSUBSONICBODYTRANSONICSUPERSONICHY PERSONICWINGTRANS0NC口▲|口「口百口SUPERSONIC●{a!口口日口HYPERSONIC口!口D口口HORIZONTALTRANS0NCa|▲▲口口|口白SUPERSONIC·a|口口口·『●|●IY PERSONICVERTICAL TAILSUBSONICOR VENTRALTRANSONIC口FINA sUPERSONIC.「百|口HY PERSONICSUBSONICWING-BODYRANSONC口口口o口SUPERSONIC●d|口HY PERSON百口HORIZONTALTRANS0NIc口口口TAIL- BOOYSUPERSONIC口口0口HY PERSONICSUBSONICVERTICAL TAILTRANSONIC口VENTRAL FIN-2 SUPERSONIC.BODY●●|●|●HYPERSONIC口w|NG-B0D¥△ SUBSONIC■口|口|口|口|a口|aaa0|口aaaaTRANSONICO|口TAILSUPERS0NC口百|百口「口。|口HYPERS0NC口口|口口口口口口SUBSON1C●VERTICAL TAILTRANS0NC▲口VENTRAL FINA SUPERSONIC●●|●●HYPERSONICING BOOYSUBSONICHORIZONTAL口日|a口口a「aa}aTRANSONIC|▲|▲▲▲口A SUPERSONIC O。|。口}口|口口|口VERTICAL TAILVENTRAL FINHYPERS0NC口口c1 THE EFFECTS OF JET POW2PELLER POWER, AND GROUND PROXIMITY MAY BE OBTAINED FOR THESE CONFIGURATIONS IF THE REQUIREDNAMELISTS ARE INPUT, THE EFFECTS OF POWER AND GROUND EFFECTS ARE INCLUDED ONLY IN THE SU!C LONGI TUDIN AL STABILITY RESULTS2 DY NAMIC STABILITY RESULTS ARE THE SAME AS WING-BODY3 TKIN VERTICAL TAIL RESULTS MAY BE OBTAINED FOR THESE CONFIGURATIONS IF THE REQUIRED NAMELIST IS INPUTTHESE EFFECTS ARE INCLUDED ONLY IN THE SUBSONIC LATERAL STABILITY DATAREFER TO DATCOM HANDBOOK FOR METHOD LIMITATIONS IF OUTPUT IS NOT OBTAINED5 AVAILABLE ONLY IN COMBINAT:ON WITH A WING OR TAILCC
    2020-12-12下载
    积分:1
  • 利用bp神经网络实现0~9数字识别,matlab源码
    是matlab源码,利用bp网络实现0~9数字识别系统,友好的系统界面,包括训练样本和含噪声的数字图片
    2020-11-29下载
    积分:1
  • 华为中兴的FPGA岗位面试
    华为中兴的FPGA岗位面试题,绝对经典,希望大家喜欢。
    2020-12-04下载
    积分:1
  • 数据结构 走迷宫大作业 c语言完整代码
    数据结构走迷宫 c语言完整代码 迷宫代码 迷宫完整代码
    2021-05-06下载
    积分:1
  • UE4触控屏手势输入SDK,单指点击,双指缩放,功能齐全
    该工具适用于UE4的触控屏开发,单指,双指,点击缩放等等,功能齐全
    2020-12-11下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载