咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是1-10 订阅
排序:
An Oblivious ellipsoid algorithm for Solving a System of (In)Feasible Linear Inequalities
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2024年 第1期49卷 1-651, C2页
作者: Lamperski, Jourdain Freund, Robert M. Todd, Michael J. Univ Pittsburgh Ind Engn Pittsburgh PA 15213 USA MIT Sloan Sch Management Cambridge MA 02139 USA Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14853 USA
The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of m linear inequalities in n variables (P) : A(T)x = 0. This paper develops an oblivious ellipsoid algorithm (OEA) that either... 详细信息
来源: 评论
A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints
收藏 引用
AUTOMATICA 2015年 52卷 248-254页
作者: Ataei, Armin Wang, Qian Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Penn State Univ Dept Mech & Nucl Engn University Pk PA 16802 USA
In this paper, a probabilistic algorithm based on the deep cut ellipsoid method is proposed to solve a linear optimization problem subject to an uncertain linear matrix inequality (LMI). First, a deep cut ellipsoid al... 详细信息
来源: 评论
Optimized ellipsoid algorithm for LMI feasibility problems
收藏 引用
INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2014年 第4期12卷 915-917页
作者: Im, Ki Hong Baang, Dane Samsung Elect Co Suwon Gyeonggi Do South Korea Korea Atom Energy Res Inst Taejon South Korea
ellipsoid algorithm with deepest-cut method is presented for LMI(Linear Matrix Inequality) feasibility problems. The proposed algorithm removes more than half of the previous step's ellipsoid to obtain faster conv... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Robust Portfolio Selection Based on Optimization Methods
Robust Portfolio Selection Based on Optimization Methods
收藏 引用
37th Chinese Control Conference (CCC)
作者: Jin Chu-xin Chen Wan-yi Yu Shu-jing Nankai Univ Coll Comp & Control Engn Tianjin 300350 Peoples R China Qingdao Campus Naval Aeronaut Univ Qingdao 266041 Shandong Peoples R China
Linear matrix inequalities (LMI) are used to solve robust portfolio problems and many other control problems. ellipsoid algorithm and interior-point method are used to solve EAU. In this paper, we consider a robust po... 详细信息
来源: 评论
Robust Portfolio Selection Based on Optimization Methods
Robust Portfolio Selection Based on Optimization Methods
收藏 引用
第37届中国控制会议
作者: JIN Chu-xin CHEN Wan-yi YU Shu-jing College of Computer and Control Engineering Nankai University Qingdao Campus of Naval Aeronautical University
Linear matrix inequalities(LMI) are used to solve robust portfolio problems and many other control problems. ellipsoid algorithm and interior-point method are used to solve LMI. In this paper, we consider a robust p... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Improved ellipsoid algorithm for LMI Feasibility Problems
收藏 引用
INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2009年 第6期7卷 1015-1019页
作者: Baang, Dane Samsung Elect Suwon 443742 Gyeonggi Do South Korea
An improved ellipsoid algorithm for solving general LMI feasibility problems is proposed. The proposed algorithm uses a deep-cut approach and introduces an affine transformation-based design to obtain the minimal-volu... 详细信息
来源: 评论