课题基金 / 基金详情

Mathematical Sciences: Interior Point Methods for Convex Programming--Theory and Applications

Mathematical Sciences: Interior Point Methods for Convex Programming--Theory and Applications
数学科学:凸规划的内点方法--理论与应用
批准号:
9623135
负责人:
Osman Guler
金额:
$6.4万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1996
资助国家:
美国
项目状态:
已结题
起止时间:
1996-06-01 至 1999-05-31

项目摘要

项目成果

Osman Guler的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
9623135 Guler The object of this project is to develop algorithms for large scale programming problems and to analyze their performance. The investigator will continue his research in interior point methods in order to seek answers to several theoretical and practical issues concerning these methods. Particular issues include: (1) developing workable and near optimal barrier functions for general convex problems, (2) using any special property a problem might have in order to construct barrier functions with additional desirable properties, (3) developing efficient long--step interior point methods by taking advantage of the properties of the underlying problem and/or the barrier function, (4) computational testing of the developed algorithms in order to gauge their performance and gain additional insight into their behavior, and (5) developing new tools to analyze interior point methods. Many problems in industry can be formulated as large scale optimization problems. For example, many production, scheduling (such as airline crew scheduling), planning problems, etc. can be formulated as linear programs. The practical impact of interior point methods on such large scale linear programs have been phenomenal. This has been followed by similar successes in linear complementarity problems, and more recently in semi-- definite programming. The latter problems also have practical applications in industry, engineering, economics, and in many hard problems in discrete optimization. (Some of these applications have been unexpected, and can be attributed to the practical success of interior point methods.) Many other industrial problems can be posed as convex programs. At present, interior point methods provide the theoretical promise to solve such problems efficiently. The investigator will perform research towards advancing interior point methods in order to make this promise a reality. These advances will have a direct effect on our a bility to solve important large scale industrial problems in manufacturing, planning, transportation, distribution, and engineering.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Efficient Algorithms for Large Scale Convex Programming
Investigations in Interior Point Methods and Convex Programming
Mathematical Sciences: Algorithms for Convex Programming-Interior Point and Proximal Point Methods
国内基金
海外基金
Handbook of the Mathematics of the Arts and Sciences的中文翻译
  • 批准号:
    12226504
  • 项目类别:
    数学天元基金项目
  • 资助金额:
    20.0万元
  • 批准年份:
    2022
  • 负责人:
    黄朝凌
  • 依托单位:
SCIENCE CHINA: Earth Sciences
Journal of Environmental Sciences
SCIENCE CHINA Information Sciences