咨询与建议

限定检索结果

文献类型

  • 235 篇 期刊文献
  • 53 篇 会议
  • 29 篇 学位论文
  • 18 册 图书

馆藏范围

  • 335 篇 电子文献
  • 3 种 纸本馆藏

日期分布

学科分类号

  • 225 篇 理学
    • 215 篇 数学
    • 7 篇 系统科学
    • 6 篇 统计学(可授理学、...
    • 5 篇 物理学
    • 3 篇 生物学
    • 1 篇 天文学
    • 1 篇 地球物理学
  • 155 篇 管理学
    • 154 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 129 篇 工学
    • 58 篇 计算机科学与技术...
    • 57 篇 软件工程
    • 21 篇 电气工程
    • 13 篇 控制科学与工程
    • 5 篇 机械工程
    • 5 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 3 篇 力学(可授工学、理...
    • 2 篇 仪器科学与技术
    • 2 篇 土木工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 地质资源与地质工...
    • 1 篇 石油与天然气工程
  • 6 篇 经济学
    • 2 篇 理论经济学
    • 2 篇 应用经济学
  • 2 篇 农学
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 109 篇 linear programmi...
  • 44 篇 interior-point m...
  • 44 篇 interior point m...
  • 26 篇 semidefinite pro...
  • 20 篇 optimization
  • 13 篇 convex optimizat...
  • 11 篇 quadratic progra...
  • 10 篇 线性规划
  • 10 篇 nonlinear progra...
  • 9 篇 interior-point m...
  • 8 篇 convex programmi...
  • 8 篇 linear matrix in...
  • 7 篇 interior point m...
  • 7 篇 complexity theor...
  • 7 篇 linear optimizat...
  • 6 篇 polynomial compl...
  • 6 篇 iterative method...
  • 6 篇 central path
  • 6 篇 mathematical pro...
  • 6 篇 integer programm...

机构

  • 5 篇 univ waterloo de...
  • 5 篇 school of mathem...
  • 4 篇 stanford univ de...
  • 4 篇 univ iowa dept m...
  • 3 篇 department of co...
  • 3 篇 河南科技大学
  • 3 篇 univ edinburgh s...
  • 3 篇 university of wa...
  • 3 篇 univ iowa dept m...
  • 3 篇 rice univ dept c...
  • 2 篇 department of ma...
  • 2 篇 mit alfred p slo...
  • 2 篇 n carolina state...
  • 2 篇 cornell universi...
  • 2 篇 northwestern uni...
  • 2 篇 univ limoges xli...
  • 2 篇 department of co...
  • 2 篇 univ maryland sy...
  • 2 篇 purdue universit...
  • 2 篇 cornell univ sch...

作者

  • 7 篇 gondzio jacek
  • 6 篇 ye yy
  • 6 篇 vandenberghe l
  • 6 篇 zhang y
  • 5 篇 freund rm
  • 5 篇 roos c
  • 5 篇 boyd s
  • 5 篇 tapia ra
  • 5 篇 tuncel levent
  • 4 篇 todd mj
  • 4 篇 terlaky t
  • 4 篇 mitchell je
  • 4 篇 karimi mehdi
  • 4 篇 drineas petros
  • 4 篇 avron haim
  • 4 篇 chowdhury agniva
  • 4 篇 tsuchiya t
  • 4 篇 london palma
  • 3 篇 tamás terlaky
  • 3 篇 meszaros csaba

语言

  • 294 篇 英文
  • 26 篇 中文
  • 15 篇 其他
检索条件"任意字段=Interior Point Methods for Linear Programming: Theory and Practice"
335 条 记 录,以下是121-130 订阅
interior proximal methods and central paths for convex second-order cone programming
收藏 引用
NONlinear ANALYSIS-theory methods & APPLICATIONS 2010年 第9期73卷 3083-3100页
作者: Pan, Shaohua Chen, Jein-Shan Natl Taiwan Normal Univ Dept Math Taipei 11677 Taiwan S China Univ Technol Dept Math Guangzhou 510640 Peoples R China
We make a unified analysis of interior proximal methods of solving convex second-order cone programming problems. These methods use a proximal distance with respect to second-order cones which can be produced with an ... 详细信息
来源: 评论
interior-point method for second-order cone programming based on a simple kernel function
Interior-point method for second-order cone programming base...
收藏 引用
2010 2nd International Conference on Computational Intelligence and Natural Computing, CINC 2010
作者: Dong, Li Tang, Jingyong College of Mathematics and Information Science Xinyang Normal University Xinyang 464000 China Department of Mathematics Shanghai Jiaotong University Shanghai 200240 China
interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interior-point algorithm for second-order cone programming pr... 详细信息
来源: 评论
Outlier detection and least trimmed squares approximation using semi-definite programming
收藏 引用
COMPUTATIONAL STATISTICS & DATA ANALYSIS 2010年 第12期54卷 3212-3226页
作者: Nguyen, T. D. Welsch, R. UIUC Newmark Civil Engn Lab 3103 Urbana IL 61801 USA MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA MIT Ctr Computat Res Econ & Management Sci Cambridge MA 02139 USA
Robust linear regression is one of the most popular problems in the robust statistics community. It is often conducted via least trimmed squares, which minimizes the sum of the k smallest squared residuals. Least trim... 详细信息
来源: 评论
Primal-dual interior-point methods for second-order cone complementarity based on a new class of kernel function
Primal-dual interior-point methods for second-order cone com...
收藏 引用
3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering practice
作者: Yang, Xue-Mei Zhao, Hua-Li Hu, Guo-Ling College of Mathematics and Information Science Xianyang Normal University Xianyang 712000 China Xianyang Meteorological Bureau of Shaanxi Province Xianyang 712000 China
In this paper we study primal-dual interior point methods (IPMs) based on a new class of kernel functions which were designed by M. El Ghami, J.B.M Melissen and C. Roos for linear optimization, we extend the functions... 详细信息
来源: 评论
Optimizing a polyhedral-semidefinite relaxation of completely positive programs
收藏 引用
MATHEMATICAL programming COMPUTATION 2010年 第1期2卷 1-19页
作者: Burer, Samuel Univ Iowa Dept Management Sci Iowa City IA 52242 USA
It has recently been shown (Burer, Math Program 120: 479-495, 2009) that a large class of NP-hard nonconvex quadratic programs (NQPs) can be modeled as so-called completely positive programs, i.e., the minimization of... 详细信息
来源: 评论
The complexity analysis of an efficient interior-point algorithm for linear optimization
The complexity analysis of an efficient interior-point algor...
收藏 引用
3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering practice
作者: Liu, Liying Fan, Liya College of Mathematics Science Liaocheng University Liaocheng 252059 China
In this paper, an efficient primal-dual interiorpoint algorithm for large-update methods is introduced by means of a new kernel function. We analysis the complexity of the algorithm and conclude that its iteration bou... 详细信息
来源: 评论
Preconditioners for inexact interior point methods for predictive control
Preconditioners for inexact interior point methods for predi...
收藏 引用
作者: Shahzad, Amir Kerrigan, Eric C. Constantinides, George A. Department of Electrical and Electronic Engineering Imperial College London SW7 2AZ United Kingdom Department of Aeronautics Imperial College London SW7 2AZ United Kingdom
This paper presents a new method for solving a linear discrete-time finite horizon optimal control problem (FHOCP) with quadratic cost and linear constraints on the states and inputs. Such a FHOCP needs to be solved o... 详细信息
来源: 评论
interior-point method for second-order cone programming based on a simple kernel function
Interior-point method for second-order cone programming base...
收藏 引用
International Conference on Computational Intelligence and Natural Computing, CINC
作者: Li Dong Jingyong Tang College of Mathematics and Information Science Xinyang Normal University Xinyang China Department of Mathematics Shanghai Jiaotong University Shanghai China
interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interior-point algorithm for second-order cone programming pr... 详细信息
来源: 评论
Probabilistic and topological methods in computational geometry
Probabilistic and topological methods in computational geome...
收藏 引用
作者: Dhandapani, Raghavan S New York University
学位级别:Ph.D.
We consider four problems connected by the common thread of geometry. The first three arise in applications that apriori do not involve geometry but this turns out to be the right language for visualizing and analyzin...
来源: 评论
interior-point Method for Second-order Cone programming Based on a Simple Kernel Function
Interior-Point Method for Second-order Cone Programming Base...
收藏 引用
2010 Second International Conference on Computational Intelligence and Natural Computing (CINC 2010)
作者: Li DongCollege of Mathematics and Information Science Xinyang Normal University Xinyang 464000, China Jingyong Tanga,b a. College of Mathematics and Information Science Xinyang Normal University Xinyang 464000, China b. Department of Mathematics Shanghai Jiaotong University Shanghai 200240, China
interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interiorpoint algorithm for second-order cone programming pro... 详细信息
来源: 评论