咨询与建议

限定检索结果

文献类型

  • 30 篇 期刊文献
  • 4 篇 会议

馆藏范围

  • 34 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 24 篇 工学
    • 10 篇 控制科学与工程
    • 9 篇 计算机科学与技术...
    • 5 篇 电气工程
    • 4 篇 软件工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
  • 18 篇 理学
    • 18 篇 数学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 18 篇 管理学
    • 18 篇 管理科学与工程(可...
    • 1 篇 公共管理
  • 2 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 社会学

主题

  • 34 篇 ellipsoid algori...
  • 5 篇 linear programmi...
  • 4 篇 computational co...
  • 4 篇 nonlinear progra...
  • 3 篇 linear inequalit...
  • 3 篇 convex programmi...
  • 3 篇 lmi
  • 3 篇 convex optimizat...
  • 2 篇 cutting plane me...
  • 2 篇 computational ex...
  • 2 篇 interior-point m...
  • 2 篇 nonlinear optimi...
  • 2 篇 linear matrix in...
  • 2 篇 algorithm evalua...
  • 2 篇 ewma
  • 2 篇 equality constra...
  • 2 篇 tracking error
  • 2 篇 geometric progra...
  • 2 篇 robustness
  • 2 篇 portfolio select...

机构

  • 1 篇 cornell univ ith...
  • 1 篇 tel aviv univers...
  • 1 篇 hebrew univ jeru...
  • 1 篇 heinz nixdorf in...
  • 1 篇 politecn torino ...
  • 1 篇 department of co...
  • 1 篇 qingdao campus n...
  • 1 篇 bell laboratorie...
  • 1 篇 department of ma...
  • 1 篇 rensselaer polyt...
  • 1 篇 european institu...
  • 1 篇 nankai univ coll...
  • 1 篇 eecs mit
  • 1 篇 cornell univ sch...
  • 1 篇 rensselaer polyt...
  • 1 篇 univ waterloo de...
  • 1 篇 department of ma...
  • 1 篇 delft univ techn...
  • 1 篇 mit dept elect e...
  • 1 篇 korea adv inst s...

作者

  • 5 篇 kupferschmid m
  • 3 篇 ecker jg
  • 2 篇 jin chu-xin
  • 2 篇 chen wan-yi
  • 2 篇 freund robert m.
  • 2 篇 baang dane
  • 2 篇 yu shu-jing
  • 1 篇 kim s
  • 1 篇 yang cai
  • 1 篇 zhang s
  • 1 篇 recht p.
  • 1 篇 de sterck hans
  • 1 篇 todd mj
  • 1 篇 kanev s
  • 1 篇 goldfarb d
  • 1 篇 haim kaplan
  • 1 篇 calafiore giusep...
  • 1 篇 safonov mg
  • 1 篇 sanders geoffrey
  • 1 篇 miller killian

语言

  • 32 篇 英文
  • 2 篇 其他
检索条件"主题词=ellipsoid algorithm"
34 条 记 录,以下是21-30 订阅
排序:
Recursive Set-Membership Parameter Estimation Using Fractional Model
收藏 引用
CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2015年 第12期34卷 3757-3788页
作者: Amairi, M. Univ Gabes Natl Engn Sch Gabes ENIG Res Unit Modeling Anal & Control Syst MACS UR 06 Gabes 6029 Tunisia
This paper deals with time-domain set-membership parameter estimation using fractional model in case of unknown-but-bounded equation error with a priori known noise bounds. In such bounded-error context, the main goal... 详细信息
来源: 评论
Efficient Localization Methods for Passivity Enforcement of Linear Dynamical Models
收藏 引用
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2014年 第9期33卷 1328-1341页
作者: Mahmood, Zohaib Grivet-Talocia, Stefano Chinea, Alessandro Calafiore, Giuseppe C. Daniel, Luca MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA Politecn Torino Dept Elect I-10129 Turin Italy IdemWorks Srl I-10129 Turin Italy Politecn Torino Dept Control & Comp Engn I-10129 Turin Italy
This paper describes a novel approach for passivity enforcement of compact dynamical models of electrical interconnects. The proposed approach is based on a parameterization of general state-space scattering models wi... 详细信息
来源: 评论
Linear Precoding Design for Mutual Information Maximization in Generalized Spatial Modulation With Finite Alphabet Inputs
收藏 引用
IEEE COMMUNICATIONS LETTERS 2015年 第8期19卷 1323-1326页
作者: Jin, Seung-Ri Choi, Won-Chul Park, Jung-Hyun Park, Dong-Jo Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea Samsung Elect Co Ltd Suwon 443742 South Korea
In this letter, we develop a new precoding scheme that improves the performance of mutual information for generalized spatial modulation (GSM). First, the closed-form expression of the mutual information of the GSM wi... 详细信息
来源: 评论
FUZZY-PROGRAMMING TECHNIQUE TO SOLVE MULTIOBJECTIVE GEOMETRIC-PROGRAMMING PROBLEMS
收藏 引用
FUZZY SETS AND SYSTEMS 1992年 第1期51卷 67-71页
作者: BISWAL, MP Department of Mathematics Indian Institute of Technology Kharagpur India
In this paper fuzzy programming technique is used to solve a multi-objective geometric programming problem as a vector minimum problem. A fuzzy membership function is defined for the multi-objective geometric programm... 详细信息
来源: 评论
A note on two fixed point problems
收藏 引用
JOURNAL OF COMPLEXITY 2007年 第4-6期23卷 952-961页
作者: Boonyasiriwat, Ch. Sikorski, K. Xiong, Ch. Univ Utah Sch Comp Salt Lake City UT 84112 USA Univ Utah Dept Chem Salt Lake City UT 84112 USA
We extend the applicability of the Exterior ellipsoid algorithm for approximating n-dimensional fixed points of directionally nonexpanding functions. Such functions model many practical problems that cannot be formula... 详细信息
来源: 评论
COMPARISON OF A SPECIAL-PURPOSE algorithm WITH GENERAL-PURPOSE algorithmS FOR SOLVING GEOMETRIC-PROGRAMMING PROBLEMS
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1984年 第2期43卷 237-263页
作者: ECKER, JG KUPFERSCHMID, M SACHER, RS RENSSELAER POLYTECH INST OPERAT RES & STAT PROGRAMTROYNY 12181 VOORHEES COMP CTR TROYNY
We study the performance of four general-purpose nonlinear programming algorithms and one special-purpose geometric programming algorithm when used to solve geometric programming problems. Experiments are reported whi... 详细信息
来源: 评论
The optimal power distribution in cooperative communication relay system
收藏 引用
High Technology Letters 2013年 第4期19卷 371-377页
作者: 张超一 Wu Muqing Miao Jiansong Luan Linlin Laboratory of Network System Architecture and Convergence Beijing University of Post and Telecommunications College of Technology Beijing Forestry University
In order to optimize power utilization of relay nodes in cooperative communication,a power allocation algorithm with objective function to maximize system capacity is *** on the convex optimization theory,an ellipsoid... 详细信息
来源: 评论
Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
收藏 引用
COMPUTING AND VISUALIZATION IN SCIENCE 2011年 第2期14卷 51-65页
作者: De Sterck, Hans Miller, Killian Sanders, Geoffrey Univ Waterloo Dept Appl Math Waterloo ON N2L 3G1 Canada Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94551 USA
Recently, it was shown how the convergence of a class of multigrid methods for computing the stationary distribution of sparse, irreducible Markov chains can be accelerated by the addition of an outer iteration based ... 详细信息
来源: 评论
Achieving target equilibria in network routing games without knowing the latency functions
收藏 引用
GAMES AND ECONOMIC BEHAVIOR 2019年 第0期118卷 533-569页
作者: Bhaskar, Umang Ligett, Katrina Schulman, Leonard J. Swamy, Chaitanya Tata Inst Fundamental Res Sch Technol & Comp Sci Mumbai Maharashtra India CALTECH Dept Comp & Math Sci Pasadena CA 91125 USA Hebrew Univ Jerusalem Benin Sch Comp Sci & Engn Jerusalem Israel Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada Univ Calif Berkeley Simons Inst Theory Comp Berkeley CA USA
The analysis of network routing games typically assumes precise, detailed information about the latency functions. Such information may, however, be unavailable or difficult to obtain. Moreover, one is often primarily... 详细信息
来源: 评论
Complexity of linear programming
收藏 引用
Operations Research Letters 1982年 第2期1卷 59-62页
作者: Traub, J.F. Woźniakowski, H. Department of Computer Science Columbia University New York NY 10027 United States Institute of Informatics University of Warsaw Warsaw Poland Department of Computer Science Columbia University New York NY 10027 United States
The complexity of linear programming is discussed in the "integer" and "real number" models of computation. Even though the integer model is widely used in theoretical computer science, the real nu... 详细信息
来源: 评论